About the Execution of LoLa+red for BusinessProcesses-PT-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
362.096 | 10593.00 | 19994.00 | 82.60 | FFFFFFTTTFFFTFTT | 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-167813692500451.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-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692500451
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:46 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.3K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 47K 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-01-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678500747556
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-01
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:12:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:12:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:12:29] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-11 02:12:29] [INFO ] Transformed 200 places.
[2023-03-11 02:12:29] [INFO ] Transformed 178 transitions.
[2023-03-11 02:12:29] [INFO ] Found NUPN structural information;
[2023-03-11 02:12:29] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 166 transition count 146
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 166 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 166 transition count 145
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 83 place count 148 transition count 127
Iterating global reduction 2 with 18 rules applied. Total rules applied 101 place count 148 transition count 127
Applied a total of 101 rules in 61 ms. Remains 148 /199 variables (removed 51) and now considering 127/177 (removed 50) transitions.
// Phase 1: matrix 127 rows 148 cols
[2023-03-11 02:12:29] [INFO ] Computed 28 place invariants in 7 ms
[2023-03-11 02:12:29] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-11 02:12:29] [INFO ] Invariant cache hit.
[2023-03-11 02:12:30] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-11 02:12:30] [INFO ] Invariant cache hit.
[2023-03-11 02:12:30] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/199 places, 127/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 565 ms. Remains : 148/199 places, 127/177 transitions.
Support contains 17 out of 148 places after structural reductions.
[2023-03-11 02:12:30] [INFO ] Flatten gal took : 25 ms
[2023-03-11 02:12:30] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:12:30] [INFO ] Input system was already deterministic with 127 transitions.
Finished random walk after 1567 steps, including 19 resets, run visited all 11 properties in 39 ms. (steps per millisecond=40 )
FORMULA BusinessProcesses-PT-01-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 124 stabilizing places and 104 stable transitions
Graph (complete) has 317 edges and 148 vertex of which 147 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 127/127 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 145 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 145 transition count 124
Applied a total of 6 rules in 7 ms. Remains 145 /148 variables (removed 3) and now considering 124/127 (removed 3) transitions.
// Phase 1: matrix 124 rows 145 cols
[2023-03-11 02:12:30] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-11 02:12:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 02:12:30] [INFO ] Invariant cache hit.
[2023-03-11 02:12:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-11 02:12:30] [INFO ] Invariant cache hit.
[2023-03-11 02:12:30] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/148 places, 124/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 145/148 places, 124/127 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s134 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 447 steps with 3 reset in 8 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-02 finished in 460 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 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 127/127 transitions.
Graph (trivial) has 73 edges and 148 vertex of which 7 / 148 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 309 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 140 transition count 104
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 126 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 125 transition count 103
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 32 place count 125 transition count 75
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 94 place count 91 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 90 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 90 transition count 74
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 168 place count 54 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 53 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 171 place count 52 transition count 40
Applied a total of 171 rules in 30 ms. Remains 52 /148 variables (removed 96) and now considering 40/127 (removed 87) transitions.
// Phase 1: matrix 40 rows 52 cols
[2023-03-11 02:12:31] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-11 02:12:31] [INFO ] Implicit Places using invariants in 39 ms returned [1, 2, 5, 6, 7, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 43 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/148 places, 40/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 78 ms. Remains : 46/148 places, 40/127 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-04 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:(NEQ s12 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 13 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-04 finished in 136 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) U X((F(!p0) U p1))))))'
Support contains 2 out of 148 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 127/127 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 146 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 146 transition count 125
Applied a total of 4 rules in 9 ms. Remains 146 /148 variables (removed 2) and now considering 125/127 (removed 2) transitions.
// Phase 1: matrix 125 rows 146 cols
[2023-03-11 02:12:31] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-11 02:12:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-11 02:12:31] [INFO ] Invariant cache hit.
[2023-03-11 02:12:31] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-11 02:12:31] [INFO ] Invariant cache hit.
[2023-03-11 02:12:31] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/148 places, 125/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 146/148 places, 125/127 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s0 0) (EQ s52 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][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 201 ms.
Product exploration explored 100000 steps with 25000 reset in 195 ms.
Computed a total of 123 stabilizing places and 103 stable transitions
Graph (complete) has 315 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 123 stabilizing places and 103 stable transitions
Detected a total of 123/146 stabilizing places and 103/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-11 02:12:32] [INFO ] Invariant cache hit.
[2023-03-11 02:12:32] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-11 02:12:32] [INFO ] [Real]Absence check using 18 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-11 02:12:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:12:32] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-11 02:12:32] [INFO ] Computed and/alt/rep : 123/217/123 causal constraints (skipped 1 transitions) in 8 ms.
[2023-03-11 02:12:32] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 146 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-11 02:12:32] [INFO ] Invariant cache hit.
[2023-03-11 02:12:32] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-11 02:12:32] [INFO ] Invariant cache hit.
[2023-03-11 02:12:32] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-11 02:12:32] [INFO ] Invariant cache hit.
[2023-03-11 02:12:32] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 146/146 places, 125/125 transitions.
Computed a total of 123 stabilizing places and 103 stable transitions
Graph (complete) has 315 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 123 stabilizing places and 103 stable transitions
Detected a total of 123/146 stabilizing places and 103/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-11 02:12:33] [INFO ] Invariant cache hit.
[2023-03-11 02:12:33] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-11 02:12:33] [INFO ] [Real]Absence check using 18 positive and 10 generalized place invariants in 1 ms returned sat
[2023-03-11 02:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:12:33] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-11 02:12:33] [INFO ] Computed and/alt/rep : 123/217/123 causal constraints (skipped 1 transitions) in 9 ms.
[2023-03-11 02:12:33] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 125/125 transitions.
Graph (trivial) has 71 edges and 146 vertex of which 6 / 146 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 308 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 140 transition count 118
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 17 place count 140 transition count 134
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 36 place count 140 transition count 134
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 135 transition count 125
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 135 transition count 125
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 93 place count 135 transition count 125
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 106 place count 122 transition count 112
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 119 place count 122 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 122 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 121 transition count 125
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 121 transition count 125
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 122 rules in 23 ms. Remains 121 /146 variables (removed 25) and now considering 125/125 (removed 0) transitions.
[2023-03-11 02:12:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 121 cols
[2023-03-11 02:12:34] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-11 02:12:34] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/146 places, 125/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 121/146 places, 125/125 transitions.
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 146 cols
[2023-03-11 02:12:34] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-11 02:12:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 02:12:34] [INFO ] Invariant cache hit.
[2023-03-11 02:12:34] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-11 02:12:34] [INFO ] Invariant cache hit.
[2023-03-11 02:12:34] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 146/146 places, 125/125 transitions.
Treatment of property BusinessProcesses-PT-01-LTLCardinality-08 finished in 3374 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(((p1||F(p2))&&p0))))'
Support contains 6 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 127/127 transitions.
Graph (trivial) has 70 edges and 148 vertex of which 7 / 148 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 309 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 141 transition count 105
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 127 transition count 105
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 30 place count 127 transition count 78
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 90 place count 94 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 93 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 93 transition count 77
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 166 place count 56 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 168 place count 55 transition count 43
Applied a total of 168 rules in 15 ms. Remains 55 /148 variables (removed 93) and now considering 43/127 (removed 84) transitions.
// Phase 1: matrix 43 rows 55 cols
[2023-03-11 02:12:34] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-11 02:12:34] [INFO ] Implicit Places using invariants in 60 ms returned [2, 3, 9, 10, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 61 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/148 places, 43/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 78 ms. Remains : 50/148 places, 43/127 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s6 1)), p1:(AND (EQ s5 0) (EQ s16 1)), p2:(OR (EQ s0 0) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-09 finished in 181 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(G(p0))))'
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 127/127 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 145 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 145 transition count 124
Applied a total of 6 rules in 3 ms. Remains 145 /148 variables (removed 3) and now considering 124/127 (removed 3) transitions.
// Phase 1: matrix 124 rows 145 cols
[2023-03-11 02:12:34] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-11 02:12:34] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-11 02:12:34] [INFO ] Invariant cache hit.
[2023-03-11 02:12:34] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-11 02:12:34] [INFO ] Invariant cache hit.
[2023-03-11 02:12:35] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/148 places, 124/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 145/148 places, 124/127 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s111 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-10 finished in 420 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 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 127/127 transitions.
Graph (trivial) has 70 edges and 148 vertex of which 4 / 148 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 313 edges and 145 vertex of which 144 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 143 transition count 107
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 128 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 127 transition count 106
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 34 place count 127 transition count 79
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 94 place count 94 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 93 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 93 transition count 78
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 168 place count 57 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 56 transition count 45
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 171 place count 56 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 55 transition count 44
Applied a total of 172 rules in 21 ms. Remains 55 /148 variables (removed 93) and now considering 44/127 (removed 83) transitions.
// Phase 1: matrix 44 rows 55 cols
[2023-03-11 02:12:35] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-11 02:12:35] [INFO ] Implicit Places using invariants in 46 ms returned [1, 2, 5, 6, 7, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 47 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/148 places, 44/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 71 ms. Remains : 49/148 places, 44/127 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s33 1) (AND (EQ s12 0) (EQ s22 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-01-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-13 finished in 128 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) U X((F(!p0) U p1))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-01-LTLCardinality-08
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 148 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 148/148 places, 127/127 transitions.
Graph (trivial) has 72 edges and 148 vertex of which 7 / 148 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 309 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 141 transition count 105
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 127 transition count 105
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 30 place count 127 transition count 77
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 92 place count 93 transition count 77
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 172 place count 53 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 174 place count 52 transition count 40
Applied a total of 174 rules in 27 ms. Remains 52 /148 variables (removed 96) and now considering 40/127 (removed 87) transitions.
// Phase 1: matrix 40 rows 52 cols
[2023-03-11 02:12:35] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-11 02:12:35] [INFO ] Implicit Places using invariants in 42 ms returned [1, 2, 5, 6, 7, 16]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 43 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 46/148 places, 40/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 74 ms. Remains : 46/148 places, 40/127 transitions.
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s0 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 208 ms.
Product exploration explored 100000 steps with 25000 reset in 196 ms.
Computed a total of 39 stabilizing places and 33 stable transitions
Computed a total of 39 stabilizing places and 33 stable transitions
Detected a total of 39/46 stabilizing places and 33/40 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 40 rows 46 cols
[2023-03-11 02:12:36] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-11 02:12:36] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-11 02:12:36] [INFO ] [Real]Absence check using 12 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-11 02:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:12:36] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-11 02:12:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 02:12:36] [INFO ] [Real]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-11 02:12:36] [INFO ] Computed and/alt/rep : 22/102/22 causal constraints (skipped 16 transitions) in 2 ms.
[2023-03-11 02:12:36] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-11 02:12:36] [INFO ] Invariant cache hit.
[2023-03-11 02:12:36] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-11 02:12:36] [INFO ] Invariant cache hit.
[2023-03-11 02:12:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 02:12:36] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [3, 14, 18, 20, 22, 28, 30]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 116 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 39/46 places, 40/40 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 38 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 38 transition count 38
Applied a total of 2 rules in 0 ms. Remains 38 /39 variables (removed 1) and now considering 38/40 (removed 2) transitions.
// Phase 1: matrix 38 rows 38 cols
[2023-03-11 02:12:36] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 02:12:36] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-11 02:12:36] [INFO ] Invariant cache hit.
[2023-03-11 02:12:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-11 02:12:36] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 38/46 places, 38/40 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 206 ms. Remains : 38/46 places, 38/40 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Graph (complete) has 122 edges and 38 vertex of which 35 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 31 stabilizing places and 31 stable transitions
Detected a total of 31/38 stabilizing places and 31/38 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-11 02:12:37] [INFO ] Invariant cache hit.
[2023-03-11 02:12:37] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-11 02:12:37] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 02:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:12:37] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-11 02:12:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-11 02:12:37] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2023-03-11 02:12:37] [INFO ] Computed and/alt/rep : 22/81/22 causal constraints (skipped 14 transitions) in 3 ms.
[2023-03-11 02:12:37] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 95 ms.
Product exploration explored 100000 steps with 25000 reset in 91 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Graph (complete) has 122 edges and 38 vertex of which 36 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 36 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 36 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 36 transition count 37
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 35 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 35 transition count 35
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 35 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 8 rules in 3 ms. Remains 35 /38 variables (removed 3) and now considering 36/38 (removed 2) transitions.
[2023-03-11 02:12:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 36 rows 35 cols
[2023-03-11 02:12:37] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 02:12:37] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/38 places, 36/38 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 35/38 places, 36/38 transitions.
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 38 cols
[2023-03-11 02:12:37] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 02:12:37] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 02:12:37] [INFO ] Invariant cache hit.
[2023-03-11 02:12:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-11 02:12:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-11 02:12:37] [INFO ] Invariant cache hit.
[2023-03-11 02:12:37] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 38/38 places, 38/38 transitions.
Treatment of property BusinessProcesses-PT-01-LTLCardinality-08 finished in 2694 ms.
[2023-03-11 02:12:37] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:12:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 02:12:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 148 places, 127 transitions and 383 arcs took 1 ms.
Total runtime 8718 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-01
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality
FORMULA BusinessProcesses-PT-01-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678500758149
--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/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-01-LTLCardinality-08
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-01-LTLCardinality-08
lola: result : true
lola: markings : 9
lola: fired transitions : 9
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-01-LTLCardinality-08: LTL true LTL model checker
Time elapsed: 0 secs. Pages in use: 1
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-01"
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-01, 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-167813692500451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 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 '
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 ;