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

About the Execution of LoLa+red for BusinessProcesses-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
384.651 12253.00 26282.00 64.90 FTFFTTTFTTTFFFTT 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.r039-tajo-167813692700531.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 BusinessProcesses-PT-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700531
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678502779118

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:46:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:46:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:46:20] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-11 02:46:20] [INFO ] Transformed 567 places.
[2023-03-11 02:46:20] [INFO ] Transformed 508 transitions.
[2023-03-11 02:46:20] [INFO ] Found NUPN structural information;
[2023-03-11 02:46:20] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 7 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-11-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 79 place count 481 transition count 426
Iterating global reduction 1 with 75 rules applied. Total rules applied 154 place count 481 transition count 426
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 192 place count 443 transition count 388
Iterating global reduction 1 with 38 rules applied. Total rules applied 230 place count 443 transition count 388
Applied a total of 230 rules in 89 ms. Remains 443 /560 variables (removed 117) and now considering 388/501 (removed 113) transitions.
// Phase 1: matrix 388 rows 443 cols
[2023-03-11 02:46:20] [INFO ] Computed 91 place invariants in 27 ms
[2023-03-11 02:46:21] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-11 02:46:21] [INFO ] Invariant cache hit.
[2023-03-11 02:46:21] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2023-03-11 02:46:21] [INFO ] Invariant cache hit.
[2023-03-11 02:46:21] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 443/560 places, 388/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1130 ms. Remains : 443/560 places, 388/501 transitions.
Support contains 13 out of 443 places after structural reductions.
[2023-03-11 02:46:22] [INFO ] Flatten gal took : 74 ms
[2023-03-11 02:46:22] [INFO ] Flatten gal took : 31 ms
[2023-03-11 02:46:22] [INFO ] Input system was already deterministic with 388 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 02:46:22] [INFO ] Invariant cache hit.
[2023-03-11 02:46:23] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 02:46:23] [INFO ] [Nat]Absence check using 49 positive place invariants in 39 ms returned sat
[2023-03-11 02:46:23] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 66 ms returned sat
[2023-03-11 02:46:23] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-11 02:46:23] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 9 ms to minimize.
[2023-03-11 02:46:23] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2023-03-11 02:46:24] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2023-03-11 02:46:24] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2023-03-11 02:46:24] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2023-03-11 02:46:24] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2023-03-11 02:46:24] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2023-03-11 02:46:24] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2023-03-11 02:46:24] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2023-03-11 02:46:24] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2023-03-11 02:46:24] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2023-03-11 02:46:24] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1145 ms
[2023-03-11 02:46:25] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:46:25] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 1 ms to minimize.
[2023-03-11 02:46:25] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 1 ms to minimize.
[2023-03-11 02:46:25] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 0 ms to minimize.
[2023-03-11 02:46:25] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:46:25] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:46:26] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 0 ms to minimize.
[2023-03-11 02:46:26] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 1 ms to minimize.
[2023-03-11 02:46:26] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 0 ms to minimize.
[2023-03-11 02:46:26] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 1 ms to minimize.
[2023-03-11 02:46:26] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:46:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1746 ms
[2023-03-11 02:46:26] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 1 ms to minimize.
[2023-03-11 02:46:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-11 02:46:26] [INFO ] After 3468ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-11 02:46:27] [INFO ] After 3899ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 50 ms.
Support contains 7 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 388/388 transitions.
Graph (trivial) has 193 edges and 443 vertex of which 6 / 443 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 990 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 437 transition count 336
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 393 transition count 336
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 90 place count 393 transition count 246
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 197 rules applied. Total rules applied 287 place count 286 transition count 246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 288 place count 285 transition count 245
Iterating global reduction 2 with 1 rules applied. Total rules applied 289 place count 285 transition count 245
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 229 rules applied. Total rules applied 518 place count 169 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 520 place count 168 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 522 place count 168 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 524 place count 166 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 525 place count 166 transition count 134
Applied a total of 525 rules in 151 ms. Remains 166 /443 variables (removed 277) and now considering 134/388 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 166/443 places, 134/388 transitions.
Finished random walk after 3129 steps, including 134 resets, run visited all 4 properties in 58 ms. (steps per millisecond=53 )
FORMULA BusinessProcesses-PT-11-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA BusinessProcesses-PT-11-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 428 stabilizing places and 373 stable transitions
Graph (complete) has 997 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 388/388 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 439 transition count 384
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 439 transition count 384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 438 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 438 transition count 383
Applied a total of 10 rules in 56 ms. Remains 438 /443 variables (removed 5) and now considering 383/388 (removed 5) transitions.
// Phase 1: matrix 383 rows 438 cols
[2023-03-11 02:46:27] [INFO ] Computed 91 place invariants in 24 ms
[2023-03-11 02:46:27] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-11 02:46:27] [INFO ] Invariant cache hit.
[2023-03-11 02:46:28] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2023-03-11 02:46:28] [INFO ] Invariant cache hit.
[2023-03-11 02:46:28] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/443 places, 383/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1065 ms. Remains : 438/443 places, 383/388 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s182 0) (EQ s146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 465 ms.
Product exploration explored 100000 steps with 33333 reset in 350 ms.
Computed a total of 423 stabilizing places and 368 stable transitions
Graph (complete) has 992 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 423 stabilizing places and 368 stable transitions
Detected a total of 423/438 stabilizing places and 368/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLCardinality-10 finished in 2367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 388/388 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 440 transition count 385
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 440 transition count 385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 439 transition count 384
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 439 transition count 384
Applied a total of 8 rules in 45 ms. Remains 439 /443 variables (removed 4) and now considering 384/388 (removed 4) transitions.
// Phase 1: matrix 384 rows 439 cols
[2023-03-11 02:46:29] [INFO ] Computed 91 place invariants in 55 ms
[2023-03-11 02:46:30] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-11 02:46:30] [INFO ] Invariant cache hit.
[2023-03-11 02:46:30] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
[2023-03-11 02:46:30] [INFO ] Invariant cache hit.
[2023-03-11 02:46:31] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/443 places, 384/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1303 ms. Remains : 439/443 places, 384/388 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s43 0), p1:(AND (NEQ s403 0) (NEQ s270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 129 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-11 finished in 1404 ms.
All properties solved by simple procedures.
Total runtime 10637 ms.
ITS solved all properties within timeout

BK_STOP 1678502791371

--------------------
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 LTLCardinality -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="BusinessProcesses-PT-11"
export BK_EXAMINATION="LTLCardinality"
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 BusinessProcesses-PT-11, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692700531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;