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-167813692800603.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-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800603
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 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.5K 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 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 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 192K 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-20-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678503810405

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-20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:03:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:03:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:03:32] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-11 03:03:32] [INFO ] Transformed 782 places.
[2023-03-11 03:03:32] [INFO ] Transformed 697 transitions.
[2023-03-11 03:03:32] [INFO ] Found NUPN structural information;
[2023-03-11 03:03:32] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 142 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 3 formulas.
Deduced a syphon composed of 63 places in 13 ms
Reduce places removed 63 places and 59 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-20-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 120 place count 599 transition count 532
Iterating global reduction 1 with 106 rules applied. Total rules applied 226 place count 599 transition count 532
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 283 place count 542 transition count 475
Iterating global reduction 1 with 57 rules applied. Total rules applied 340 place count 542 transition count 475
Applied a total of 340 rules in 152 ms. Remains 542 /719 variables (removed 177) and now considering 475/638 (removed 163) transitions.
// Phase 1: matrix 475 rows 542 cols
[2023-03-11 03:03:32] [INFO ] Computed 107 place invariants in 28 ms
[2023-03-11 03:03:32] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-11 03:03:32] [INFO ] Invariant cache hit.
[2023-03-11 03:03:33] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
[2023-03-11 03:03:33] [INFO ] Invariant cache hit.
[2023-03-11 03:03:33] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 542/719 places, 475/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1353 ms. Remains : 542/719 places, 475/638 transitions.
Support contains 10 out of 542 places after structural reductions.
[2023-03-11 03:03:33] [INFO ] Flatten gal took : 54 ms
[2023-03-11 03:03:33] [INFO ] Flatten gal took : 26 ms
[2023-03-11 03:03:33] [INFO ] Input system was already deterministic with 475 transitions.
Support contains 9 out of 542 places (down from 10) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 03:03:34] [INFO ] Invariant cache hit.
[2023-03-11 03:03:34] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:03:34] [INFO ] [Nat]Absence check using 64 positive place invariants in 14 ms returned sat
[2023-03-11 03:03:34] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 8 ms returned sat
[2023-03-11 03:03:34] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:03:34] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 6 ms to minimize.
[2023-03-11 03:03:35] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2023-03-11 03:03:35] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 0 ms to minimize.
[2023-03-11 03:03:35] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 1 ms to minimize.
[2023-03-11 03:03:35] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2023-03-11 03:03:35] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2023-03-11 03:03:35] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 0 ms to minimize.
[2023-03-11 03:03:36] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2023-03-11 03:03:36] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2023-03-11 03:03:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1411 ms
[2023-03-11 03:03:36] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 1 ms to minimize.
[2023-03-11 03:03:36] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 0 ms to minimize.
[2023-03-11 03:03:36] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 0 ms to minimize.
[2023-03-11 03:03:36] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 0 ms to minimize.
[2023-03-11 03:03:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 675 ms
[2023-03-11 03:03:37] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 0 ms to minimize.
[2023-03-11 03:03:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-11 03:03:37] [INFO ] After 2565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-11 03:03:37] [INFO ] After 2821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 85 ms.
Support contains 6 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 475/475 transitions.
Graph (trivial) has 248 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1206 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 535 transition count 398
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 467 transition count 398
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 138 place count 467 transition count 290
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 237 rules applied. Total rules applied 375 place count 338 transition count 290
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 376 place count 337 transition count 289
Iterating global reduction 2 with 1 rules applied. Total rules applied 377 place count 337 transition count 289
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 665 place count 191 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 669 place count 189 transition count 154
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 671 place count 189 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 673 place count 187 transition count 152
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 674 place count 187 transition count 152
Applied a total of 674 rules in 171 ms. Remains 187 /542 variables (removed 355) and now considering 152/475 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 187/542 places, 152/475 transitions.
Finished random walk after 1074 steps, including 58 resets, run visited all 4 properties in 23 ms. (steps per millisecond=46 )
Computed a total of 474 stabilizing places and 417 stable transitions
Graph (complete) has 1213 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 3 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 475/475 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 540 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 540 transition count 473
Applied a total of 4 rules in 65 ms. Remains 540 /542 variables (removed 2) and now considering 473/475 (removed 2) transitions.
// Phase 1: matrix 473 rows 540 cols
[2023-03-11 03:03:37] [INFO ] Computed 107 place invariants in 24 ms
[2023-03-11 03:03:38] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-11 03:03:38] [INFO ] Invariant cache hit.
[2023-03-11 03:03:38] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2023-03-11 03:03:38] [INFO ] Invariant cache hit.
[2023-03-11 03:03:39] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 540/542 places, 473/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1233 ms. Remains : 540/542 places, 473/475 transitions.
Stuttering acceptance computed with spot in 380 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s480 0) (EQ s61 1)), p0:(EQ s416 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 507 ms.
Product exploration explored 100000 steps with 33333 reset in 396 ms.
Computed a total of 472 stabilizing places and 415 stable transitions
Graph (complete) has 1211 edges and 540 vertex of which 538 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Computed a total of 472 stabilizing places and 415 stable transitions
Detected a total of 472/540 stabilizing places and 415/473 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 7 factoid took 203 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLCardinality-03 finished in 2814 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 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 475/475 transitions.
Graph (trivial) has 253 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1207 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 534 transition count 397
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 465 transition count 397
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 140 place count 465 transition count 287
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 382 place count 333 transition count 287
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 385 place count 330 transition count 284
Iterating global reduction 2 with 3 rules applied. Total rules applied 388 place count 330 transition count 284
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 674 place count 185 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 678 place count 183 transition count 150
Applied a total of 678 rules in 95 ms. Remains 183 /542 variables (removed 359) and now considering 150/475 (removed 325) transitions.
[2023-03-11 03:03:40] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 183 cols
[2023-03-11 03:03:40] [INFO ] Computed 81 place invariants in 16 ms
[2023-03-11 03:03:42] [INFO ] Implicit Places using invariants in 1776 ms returned [28, 29, 30, 31, 32, 39, 40, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1780 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/542 places, 150/475 transitions.
Applied a total of 0 rules in 11 ms. Remains 159 /159 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1887 ms. Remains : 159/542 places, 150/475 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-05 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 (EQ s28 0) (EQ s26 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-05 finished in 1992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 475/475 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 540 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 540 transition count 473
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 539 transition count 472
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 539 transition count 472
Applied a total of 6 rules in 54 ms. Remains 539 /542 variables (removed 3) and now considering 472/475 (removed 3) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-11 03:03:42] [INFO ] Computed 107 place invariants in 13 ms
[2023-03-11 03:03:42] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-11 03:03:42] [INFO ] Invariant cache hit.
[2023-03-11 03:03:43] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2023-03-11 03:03:43] [INFO ] Invariant cache hit.
[2023-03-11 03:03:43] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/542 places, 472/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1100 ms. Remains : 539/542 places, 472/475 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s525 0), p1:(EQ s486 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 507 reset in 403 ms.
Product exploration explored 100000 steps with 509 reset in 336 ms.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1210 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 351 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 765551 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 765551 steps, saw 120975 distinct states, run finished after 3002 ms. (steps per millisecond=255 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-11 03:03:48] [INFO ] Invariant cache hit.
[2023-03-11 03:03:48] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:03:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 22 ms returned sat
[2023-03-11 03:03:48] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 15 ms returned sat
[2023-03-11 03:03:48] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 389 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Applied a total of 0 rules in 13 ms. Remains 539 /539 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2023-03-11 03:03:49] [INFO ] Invariant cache hit.
[2023-03-11 03:03:49] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-11 03:03:49] [INFO ] Invariant cache hit.
[2023-03-11 03:03:50] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2023-03-11 03:03:50] [INFO ] Invariant cache hit.
[2023-03-11 03:03:50] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 924 ms. Remains : 539/539 places, 472/472 transitions.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1210 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3098 steps, run visited all 1 properties in 18 ms. (steps per millisecond=172 )
Probabilistic random walk after 3098 steps, saw 2838 distinct states, run finished after 18 ms. (steps per millisecond=172 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Product exploration explored 100000 steps with 508 reset in 193 ms.
Product exploration explored 100000 steps with 501 reset in 300 ms.
Support contains 1 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 252 edges and 539 vertex of which 6 / 539 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1204 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 531 transition count 395
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 463 transition count 395
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 138 place count 463 transition count 283
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 384 place count 329 transition count 283
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 672 place count 183 transition count 141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 676 place count 181 transition count 148
Applied a total of 676 rules in 45 ms. Remains 181 /539 variables (removed 358) and now considering 148/472 (removed 324) transitions.
[2023-03-11 03:03:51] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 181 cols
[2023-03-11 03:03:51] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-11 03:03:51] [INFO ] Implicit Places using invariants in 105 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 106 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/539 places, 148/472 transitions.
Applied a total of 0 rules in 8 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 159 ms. Remains : 157/539 places, 148/472 transitions.
Treatment of property BusinessProcesses-PT-20-LTLCardinality-12 finished in 9295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 475/475 transitions.
Graph (trivial) has 253 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1207 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 534 transition count 397
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 465 transition count 397
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 140 place count 465 transition count 286
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 384 place count 332 transition count 286
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 386 place count 330 transition count 284
Iterating global reduction 2 with 2 rules applied. Total rules applied 388 place count 330 transition count 284
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 672 place count 186 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 676 place count 184 transition count 151
Applied a total of 676 rules in 47 ms. Remains 184 /542 variables (removed 358) and now considering 151/475 (removed 324) transitions.
[2023-03-11 03:03:51] [INFO ] Flow matrix only has 150 transitions (discarded 1 similar events)
// Phase 1: matrix 150 rows 184 cols
[2023-03-11 03:03:51] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-11 03:03:52] [INFO ] Implicit Places using invariants in 124 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 126 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/542 places, 151/475 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 160/542 places, 151/475 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s99 0) (NEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-13 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-20-LTLCardinality-12
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 542/542 places, 475/475 transitions.
Graph (trivial) has 254 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1207 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 534 transition count 396
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 464 transition count 396
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 142 place count 464 transition count 285
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 386 place count 331 transition count 285
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 388 place count 329 transition count 283
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 329 transition count 283
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 676 place count 184 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 680 place count 182 transition count 149
Applied a total of 680 rules in 58 ms. Remains 182 /542 variables (removed 360) and now considering 149/475 (removed 326) transitions.
[2023-03-11 03:03:52] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 182 cols
[2023-03-11 03:03:52] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-11 03:03:52] [INFO ] Implicit Places using invariants in 108 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 110 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 158/542 places, 149/475 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 173 ms. Remains : 158/542 places, 149/475 transitions.
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s148 0), p1:(EQ s125 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15729 reset in 269 ms.
Product exploration explored 100000 steps with 15721 reset in 261 ms.
Computed a total of 85 stabilizing places and 97 stable transitions
Computed a total of 85 stabilizing places and 97 stable transitions
Detected a total of 85/158 stabilizing places and 97/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 288 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1742 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 419 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-11 03:03:53] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 158 cols
[2023-03-11 03:03:53] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-11 03:03:53] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:03:53] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2023-03-11 03:03:53] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-11 03:03:53] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 357 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 149/149 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2023-03-11 03:03:54] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
[2023-03-11 03:03:54] [INFO ] Invariant cache hit.
[2023-03-11 03:03:54] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-11 03:03:54] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
[2023-03-11 03:03:54] [INFO ] Invariant cache hit.
[2023-03-11 03:03:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-11 03:03:54] [INFO ] Implicit Places using invariants and state equation in 218 ms returned [5, 44, 46, 48, 56, 90, 92, 94, 96, 98, 100, 102]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 352 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/158 places, 149/149 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 144 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 144 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 143 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 143 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 142 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 142 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 142 transition count 143
Applied a total of 9 rules in 9 ms. Remains 142 /146 variables (removed 4) and now considering 143/149 (removed 6) transitions.
[2023-03-11 03:03:54] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
// Phase 1: matrix 142 rows 142 cols
[2023-03-11 03:03:54] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-11 03:03:54] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 03:03:54] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
[2023-03-11 03:03:54] [INFO ] Invariant cache hit.
[2023-03-11 03:03:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 03:03:54] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/158 places, 143/149 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 613 ms. Remains : 142/158 places, 143/149 transitions.
Computed a total of 69 stabilizing places and 91 stable transitions
Graph (complete) has 519 edges and 142 vertex of which 133 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Computed a total of 69 stabilizing places and 91 stable transitions
Detected a total of 69/142 stabilizing places and 91/143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 211 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p1)]
Finished random walk after 9186 steps, including 1663 resets, run visited all 1 properties in 19 ms. (steps per millisecond=483 )
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Product exploration explored 100000 steps with 15666 reset in 150 ms.
Product exploration explored 100000 steps with 15594 reset in 252 ms.
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 143/143 transitions.
Graph (complete) has 519 edges and 142 vertex of which 133 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 133 transition count 134
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 128 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 128 transition count 133
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 127 transition count 133
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 22 place count 118 transition count 97
Iterating global reduction 2 with 9 rules applied. Total rules applied 31 place count 118 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 116 transition count 95
Applied a total of 35 rules in 9 ms. Remains 116 /142 variables (removed 26) and now considering 95/143 (removed 48) transitions.
[2023-03-11 03:03:55] [INFO ] Flow matrix only has 94 transitions (discarded 1 similar events)
// Phase 1: matrix 94 rows 116 cols
[2023-03-11 03:03:55] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-11 03:03:55] [INFO ] Implicit Places using invariants in 106 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 107 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/142 places, 95/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 113/142 places, 95/143 transitions.
Treatment of property BusinessProcesses-PT-20-LTLCardinality-12 finished in 3922 ms.
[2023-03-11 03:03:56] [INFO ] Flatten gal took : 28 ms
[2023-03-11 03:03:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 03:03:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 542 places, 475 transitions and 1519 arcs took 4 ms.
Total runtime 24082 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-20
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1678503926381

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-20-LTLCardinality-12
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 3/32 BusinessProcesses-PT-20-LTLCardinality-12 292197 m, 58439 m/sec, 1979271 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 5/32 BusinessProcesses-PT-20-LTLCardinality-12 571599 m, 55880 m/sec, 4041334 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 7/32 BusinessProcesses-PT-20-LTLCardinality-12 805007 m, 46681 m/sec, 5992701 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 9/32 BusinessProcesses-PT-20-LTLCardinality-12 1041974 m, 47393 m/sec, 7851576 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 11/32 BusinessProcesses-PT-20-LTLCardinality-12 1271522 m, 45909 m/sec, 9812376 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 13/32 BusinessProcesses-PT-20-LTLCardinality-12 1482614 m, 42218 m/sec, 11635681 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 14/32 BusinessProcesses-PT-20-LTLCardinality-12 1678354 m, 39148 m/sec, 13541960 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 16/32 BusinessProcesses-PT-20-LTLCardinality-12 1939760 m, 52281 m/sec, 15587354 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 19/32 BusinessProcesses-PT-20-LTLCardinality-12 2190586 m, 50165 m/sec, 17693095 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 20/32 BusinessProcesses-PT-20-LTLCardinality-12 2399972 m, 41877 m/sec, 19656860 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 22/32 BusinessProcesses-PT-20-LTLCardinality-12 2645714 m, 49148 m/sec, 21748752 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 24/32 BusinessProcesses-PT-20-LTLCardinality-12 2875921 m, 46041 m/sec, 23658626 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 26/32 BusinessProcesses-PT-20-LTLCardinality-12 3103977 m, 45611 m/sec, 25609284 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3600 28/32 BusinessProcesses-PT-20-LTLCardinality-12 3311165 m, 41437 m/sec, 27560624 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3600 29/32 BusinessProcesses-PT-20-LTLCardinality-12 3518580 m, 41483 m/sec, 29431570 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3600 31/32 BusinessProcesses-PT-20-LTLCardinality-12 3716580 m, 39600 m/sec, 31270417 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3600 32/32 BusinessProcesses-PT-20-LTLCardinality-12 3915297 m, 39743 m/sec, 33162274 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for BusinessProcesses-PT-20-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-LTLCardinality-12: LTL unknown AGGR


Time elapsed: 90 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-20"
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-20, 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-167813692800603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 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 ;