About the Execution of LoLa+red for NoC3x3-PT-5B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
411.644 | 60297.00 | 86729.00 | 645.60 | FFFTTFTFTTTTFFTT | 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.r263-smll-167863538100303.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is NoC3x3-PT-5B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538100303
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 525K 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 NoC3x3-PT-5B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678761761649
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 02:42:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 02:42:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 02:42:45] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2023-03-14 02:42:46] [INFO ] Transformed 1571 places.
[2023-03-14 02:42:46] [INFO ] Transformed 2173 transitions.
[2023-03-14 02:42:46] [INFO ] Found NUPN structural information;
[2023-03-14 02:42:46] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 587 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 838 ms. (steps per millisecond=11 ) properties (out of 16) seen :10
FORMULA NoC3x3-PT-5B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :1
FORMULA NoC3x3-PT-5B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2173 rows 1571 cols
[2023-03-14 02:42:47] [INFO ] Computed 66 place invariants in 46 ms
[2023-03-14 02:42:49] [INFO ] After 1575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 02:42:51] [INFO ] [Nat]Absence check using 66 positive place invariants in 73 ms returned sat
[2023-03-14 02:43:14] [INFO ] After 23331ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-14 02:43:14] [INFO ] After 23341ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-14 02:43:14] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA NoC3x3-PT-5B-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 94 out of 1571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1571 transition count 1897
Reduce places removed 276 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 294 rules applied. Total rules applied 570 place count 1295 transition count 1879
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 588 place count 1277 transition count 1879
Discarding 282 places :
Symmetric choice reduction at 3 with 282 rule applications. Total rules 870 place count 995 transition count 1597
Iterating global reduction 3 with 282 rules applied. Total rules applied 1152 place count 995 transition count 1597
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 1152 place count 995 transition count 1570
Deduced a syphon composed of 27 places in 17 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 1206 place count 968 transition count 1570
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 1302 place count 872 transition count 1420
Iterating global reduction 3 with 96 rules applied. Total rules applied 1398 place count 872 transition count 1420
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 1444 place count 826 transition count 1321
Iterating global reduction 3 with 46 rules applied. Total rules applied 1490 place count 826 transition count 1321
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1507 place count 809 transition count 1287
Iterating global reduction 3 with 17 rules applied. Total rules applied 1524 place count 809 transition count 1287
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1529 place count 804 transition count 1277
Iterating global reduction 3 with 5 rules applied. Total rules applied 1534 place count 804 transition count 1277
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1535 place count 803 transition count 1275
Iterating global reduction 3 with 1 rules applied. Total rules applied 1536 place count 803 transition count 1275
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1537 place count 802 transition count 1272
Iterating global reduction 3 with 1 rules applied. Total rules applied 1538 place count 802 transition count 1272
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 6 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 1800 place count 671 transition count 1141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1801 place count 671 transition count 1140
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1802 place count 670 transition count 1136
Iterating global reduction 4 with 1 rules applied. Total rules applied 1803 place count 670 transition count 1136
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2005 place count 569 transition count 1176
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2013 place count 569 transition count 1168
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 2055 place count 548 transition count 1172
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 2112 place count 548 transition count 1115
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 2120 place count 540 transition count 1115
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 2120 place count 540 transition count 1111
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 2128 place count 536 transition count 1111
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 2150 place count 525 transition count 1100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 2162 place count 519 transition count 1113
Free-agglomeration rule applied 16 times with reduction of 3 identical transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 2178 place count 519 transition count 1094
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 2199 place count 503 transition count 1089
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 2203 place count 503 transition count 1085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2204 place count 502 transition count 1085
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 2216 place count 502 transition count 1085
Applied a total of 2216 rules in 1244 ms. Remains 502 /1571 variables (removed 1069) and now considering 1085/2173 (removed 1088) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1245 ms. Remains : 502/1571 places, 1085/2173 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :1
FORMULA NoC3x3-PT-5B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-14 02:43:16] [INFO ] Flow matrix only has 1081 transitions (discarded 4 similar events)
// Phase 1: matrix 1081 rows 502 cols
[2023-03-14 02:43:16] [INFO ] Computed 57 place invariants in 10 ms
[2023-03-14 02:43:16] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 02:43:17] [INFO ] [Nat]Absence check using 57 positive place invariants in 51 ms returned sat
[2023-03-14 02:43:18] [INFO ] After 1567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 02:43:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-14 02:43:19] [INFO ] After 975ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 02:43:20] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 10 ms to minimize.
[2023-03-14 02:43:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 253 ms
[2023-03-14 02:43:20] [INFO ] After 2236ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 1198 ms.
[2023-03-14 02:43:22] [INFO ] After 5306ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA NoC3x3-PT-5B-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 83 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 1085/1085 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 502 transition count 1084
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 501 transition count 1084
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 501 transition count 1081
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 498 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 496 transition count 1076
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 496 transition count 1076
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 26 place count 489 transition count 1069
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 487 transition count 1069
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 487 transition count 1068
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 486 transition count 1062
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 486 transition count 1062
Applied a total of 33 rules in 143 ms. Remains 486 /502 variables (removed 16) and now considering 1062/1085 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 486/502 places, 1062/1085 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 132851 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132851 steps, saw 53569 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 02:43:25] [INFO ] Flow matrix only has 1058 transitions (discarded 4 similar events)
// Phase 1: matrix 1058 rows 486 cols
[2023-03-14 02:43:25] [INFO ] Computed 57 place invariants in 15 ms
[2023-03-14 02:43:25] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 02:43:26] [INFO ] [Nat]Absence check using 57 positive place invariants in 47 ms returned sat
[2023-03-14 02:43:27] [INFO ] After 1346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 02:43:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-14 02:43:28] [INFO ] After 1268ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 02:43:30] [INFO ] After 2488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 751 ms.
[2023-03-14 02:43:30] [INFO ] After 4986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 83 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 1062/1062 transitions.
Applied a total of 0 rules in 27 ms. Remains 486 /486 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 486/486 places, 1062/1062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 1062/1062 transitions.
Applied a total of 0 rules in 23 ms. Remains 486 /486 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
[2023-03-14 02:43:31] [INFO ] Flow matrix only has 1058 transitions (discarded 4 similar events)
[2023-03-14 02:43:31] [INFO ] Invariant cache hit.
[2023-03-14 02:43:31] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-14 02:43:31] [INFO ] Flow matrix only has 1058 transitions (discarded 4 similar events)
[2023-03-14 02:43:31] [INFO ] Invariant cache hit.
[2023-03-14 02:43:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-14 02:43:32] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
[2023-03-14 02:43:33] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-14 02:43:33] [INFO ] Flow matrix only has 1058 transitions (discarded 4 similar events)
[2023-03-14 02:43:33] [INFO ] Invariant cache hit.
[2023-03-14 02:43:34] [INFO ] Dead Transitions using invariants and state equation in 1228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3340 ms. Remains : 486/486 places, 1062/1062 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 486 transition count 1058
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 37 place count 486 transition count 1025
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 486 transition count 1025
Applied a total of 46 rules in 52 ms. Remains 486 /486 variables (removed 0) and now considering 1025/1062 (removed 37) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1025 rows 486 cols
[2023-03-14 02:43:34] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-14 02:43:34] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 02:43:34] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2023-03-14 02:43:36] [INFO ] After 1630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 02:43:37] [INFO ] After 2670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1438 ms.
[2023-03-14 02:43:38] [INFO ] After 4259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-14 02:43:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-14 02:43:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 486 places, 1062 transitions and 3974 arcs took 12 ms.
[2023-03-14 02:43:39] [INFO ] Flatten gal took : 272 ms
Total runtime 54022 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-5B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityFireability
FORMULA NoC3x3-PT-5B-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NoC3x3-PT-5B-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678761821946
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 3 NoC3x3-PT-5B-ReachabilityFireability-10
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 NoC3x3-PT-5B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 NoC3x3-PT-5B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 9 (type SRCH) for 3 NoC3x3-PT-5B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type FNDP) for NoC3x3-PT-5B-ReachabilityFireability-10
lola: result : true
lola: fired transitions : 53
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 7 (type EQUN) for NoC3x3-PT-5B-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 9 (type SRCH) for NoC3x3-PT-5B-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 10 (type EXCL) for NoC3x3-PT-5B-ReachabilityFireability-10 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 17 (type EXCL) for 0 NoC3x3-PT-5B-ReachabilityFireability-01
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 0 NoC3x3-PT-5B-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 NoC3x3-PT-5B-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 16 (type SRCH) for 0 NoC3x3-PT-5B-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/376/ReachabilityFireability-7.sara.
lola: FINISHED task # 16 (type SRCH) for NoC3x3-PT-5B-ReachabilityFireability-01
lola: result : true
lola: markings : 34
lola: fired transitions : 33
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for NoC3x3-PT-5B-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 14 (type EQUN) for NoC3x3-PT-5B-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 17 (type EXCL) for NoC3x3-PT-5B-ReachabilityFireability-01 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-5B-ReachabilityFireability-01: AG false tandem / insertion
NoC3x3-PT-5B-ReachabilityFireability-10: EF true findpath
Time elapsed: 1 secs. Pages in use: 2
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="NoC3x3-PT-5B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is NoC3x3-PT-5B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863538100303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-5B.tgz
mv NoC3x3-PT-5B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;