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

About the Execution of LoLa+red for SieveSingleMsgMbox-PT-d1m04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
343.520 12673.00 24350.00 82.40 FFTFFFTFFTTTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976700404.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is SieveSingleMsgMbox-PT-d1m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976700404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 10:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 10:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K 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 SieveSingleMsgMbox-PT-d1m04-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679247042232

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:30:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:30:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:30:44] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-19 17:30:44] [INFO ] Transformed 1295 places.
[2023-03-19 17:30:44] [INFO ] Transformed 749 transitions.
[2023-03-19 17:30:44] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 11 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 299 place count 200 transition count 411
Iterating global reduction 1 with 42 rules applied. Total rules applied 341 place count 200 transition count 411
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 346 place count 200 transition count 406
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 375 place count 171 transition count 377
Iterating global reduction 2 with 29 rules applied. Total rules applied 404 place count 171 transition count 377
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 415 place count 171 transition count 366
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 432 place count 154 transition count 348
Iterating global reduction 3 with 17 rules applied. Total rules applied 449 place count 154 transition count 348
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 497 place count 154 transition count 300
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 502 place count 149 transition count 292
Iterating global reduction 4 with 5 rules applied. Total rules applied 507 place count 149 transition count 292
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 511 place count 145 transition count 288
Iterating global reduction 4 with 4 rules applied. Total rules applied 515 place count 145 transition count 288
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 517 place count 143 transition count 286
Iterating global reduction 4 with 2 rules applied. Total rules applied 519 place count 143 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 520 place count 142 transition count 285
Iterating global reduction 4 with 1 rules applied. Total rules applied 521 place count 142 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 522 place count 141 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 523 place count 141 transition count 284
Applied a total of 523 rules in 72 ms. Remains 141 /259 variables (removed 118) and now considering 284/749 (removed 465) transitions.
// Phase 1: matrix 284 rows 141 cols
[2023-03-19 17:30:44] [INFO ] Computed 5 place invariants in 15 ms
[2023-03-19 17:30:44] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-19 17:30:44] [INFO ] Invariant cache hit.
[2023-03-19 17:30:44] [INFO ] State equation strengthened by 189 read => feed constraints.
[2023-03-19 17:30:45] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2023-03-19 17:30:45] [INFO ] Invariant cache hit.
[2023-03-19 17:30:45] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/259 places, 284/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1368 ms. Remains : 141/259 places, 284/749 transitions.
Support contains 26 out of 141 places after structural reductions.
[2023-03-19 17:30:46] [INFO ] Flatten gal took : 81 ms
[2023-03-19 17:30:46] [INFO ] Flatten gal took : 47 ms
[2023-03-19 17:30:46] [INFO ] Input system was already deterministic with 284 transitions.
Support contains 25 out of 141 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 23) seen :5
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-19 17:30:46] [INFO ] Invariant cache hit.
[2023-03-19 17:30:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:30:47] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:30:47] [INFO ] After 722ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:15
[2023-03-19 17:30:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:30:47] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:30:48] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :15
[2023-03-19 17:30:48] [INFO ] State equation strengthened by 189 read => feed constraints.
[2023-03-19 17:30:48] [INFO ] After 615ms SMT Verify possible using 189 Read/Feed constraints in natural domain returned unsat :3 sat :15
[2023-03-19 17:30:49] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 5 ms to minimize.
[2023-03-19 17:30:49] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2023-03-19 17:30:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-03-19 17:30:50] [INFO ] After 2026ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :15
Attempting to minimize the solution found.
Minimization took 916 ms.
[2023-03-19 17:30:51] [INFO ] After 3512ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :15
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 200 ms.
Support contains 14 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 284/284 transitions.
Graph (complete) has 498 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 140 transition count 282
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 133 transition count 257
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 133 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 133 transition count 255
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 129 transition count 250
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 129 transition count 250
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 127 transition count 247
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 127 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 127 transition count 246
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 126 transition count 245
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 126 transition count 245
Applied a total of 34 rules in 51 ms. Remains 126 /141 variables (removed 15) and now considering 245/284 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 126/141 places, 245/284 transitions.
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Probably explored full state space saw : 981 states, properties seen :1
Probabilistic random walk after 2334 steps, saw 981 distinct states, run finished after 87 ms. (steps per millisecond=26 ) properties seen :1
Explored full state space saw : 981 states, properties seen :0
Exhaustive walk after 2334 steps, saw 981 distinct states, run finished after 57 ms. (steps per millisecond=40 ) properties seen :0
Successfully simplified 17 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 28 stabilizing places and 50 stable transitions
Graph (complete) has 554 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 284/284 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 121 transition count 146
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 121 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 121 transition count 144
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 104 transition count 126
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 104 transition count 126
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 104 transition count 119
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 93 transition count 107
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 93 transition count 107
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 112 place count 93 transition count 100
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 117 place count 88 transition count 95
Iterating global reduction 3 with 5 rules applied. Total rules applied 122 place count 88 transition count 95
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 84 transition count 91
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 84 transition count 91
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 81 transition count 87
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 81 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 81 transition count 85
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 141 place count 78 transition count 82
Iterating global reduction 4 with 3 rules applied. Total rules applied 144 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 145 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 77 transition count 81
Applied a total of 146 rules in 18 ms. Remains 77 /141 variables (removed 64) and now considering 81/284 (removed 203) transitions.
// Phase 1: matrix 81 rows 77 cols
[2023-03-19 17:30:52] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:30:53] [INFO ] Implicit Places using invariants in 968 ms returned []
[2023-03-19 17:30:53] [INFO ] Invariant cache hit.
[2023-03-19 17:30:53] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-19 17:30:53] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
[2023-03-19 17:30:53] [INFO ] Invariant cache hit.
[2023-03-19 17:30:53] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/141 places, 81/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1263 ms. Remains : 77/141 places, 81/284 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s40 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 853 steps with 183 reset in 8 ms.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLFireability-12 finished in 1540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 284/284 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 122 transition count 147
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 122 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 122 transition count 145
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 57 place count 105 transition count 127
Iterating global reduction 1 with 17 rules applied. Total rules applied 74 place count 105 transition count 127
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 81 place count 105 transition count 120
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 94 transition count 108
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 94 transition count 108
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 94 transition count 101
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 89 transition count 96
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 89 transition count 96
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 124 place count 85 transition count 92
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 85 transition count 92
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 82 transition count 88
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 82 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 82 transition count 86
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 79 transition count 83
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 78 transition count 82
Applied a total of 144 rules in 49 ms. Remains 78 /141 variables (removed 63) and now considering 82/284 (removed 202) transitions.
// Phase 1: matrix 82 rows 78 cols
[2023-03-19 17:30:54] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-19 17:30:54] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-19 17:30:54] [INFO ] Invariant cache hit.
[2023-03-19 17:30:54] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-19 17:30:54] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-19 17:30:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:30:54] [INFO ] Invariant cache hit.
[2023-03-19 17:30:54] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/141 places, 82/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 530 ms. Remains : 78/141 places, 82/284 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLFireability-13 finished in 615 ms.
All properties solved by simple procedures.
Total runtime 10690 ms.
ITS solved all properties within timeout

BK_STOP 1679247054905

--------------------
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

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="SieveSingleMsgMbox-PT-d1m04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is SieveSingleMsgMbox-PT-d1m04, 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 r423-tajo-167905976700404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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