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.r037-tajo-167813690600604.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 itstools
Input is BusinessProcesses-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690600604
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678365591846

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 12:39:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 12:39:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:39:53] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-09 12:39:53] [INFO ] Transformed 782 places.
[2023-03-09 12:39:53] [INFO ] Transformed 697 transitions.
[2023-03-09 12:39:53] [INFO ] Found NUPN structural information;
[2023-03-09 12:39:53] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 63 places in 12 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 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 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 117 place count 602 transition count 535
Iterating global reduction 1 with 103 rules applied. Total rules applied 220 place count 602 transition count 535
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 273 place count 549 transition count 482
Iterating global reduction 1 with 53 rules applied. Total rules applied 326 place count 549 transition count 482
Applied a total of 326 rules in 180 ms. Remains 549 /719 variables (removed 170) and now considering 482/638 (removed 156) transitions.
// Phase 1: matrix 482 rows 549 cols
[2023-03-09 12:39:54] [INFO ] Computed 107 place invariants in 28 ms
[2023-03-09 12:39:54] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-09 12:39:54] [INFO ] Invariant cache hit.
[2023-03-09 12:39:54] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2023-03-09 12:39:54] [INFO ] Invariant cache hit.
[2023-03-09 12:39:54] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/719 places, 482/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1200 ms. Remains : 549/719 places, 482/638 transitions.
Support contains 35 out of 549 places after structural reductions.
[2023-03-09 12:39:55] [INFO ] Flatten gal took : 61 ms
[2023-03-09 12:39:55] [INFO ] Flatten gal took : 29 ms
[2023-03-09 12:39:55] [INFO ] Input system was already deterministic with 482 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-09 12:39:55] [INFO ] Invariant cache hit.
[2023-03-09 12:39:56] [INFO ] [Real]Absence check using 64 positive place invariants in 15 ms returned sat
[2023-03-09 12:39:56] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 9 ms returned sat
[2023-03-09 12:39:56] [INFO ] After 503ms SMT Verify possible using state equation in real domain returned unsat :1 sat :10 real:6
[2023-03-09 12:39:57] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 28 ms to minimize.
[2023-03-09 12:39:57] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2023-03-09 12:39:57] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2023-03-09 12:39:57] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2023-03-09 12:39:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 681 ms
[2023-03-09 12:39:57] [INFO ] After 1597ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:16
[2023-03-09 12:39:57] [INFO ] After 1945ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2023-03-09 12:39:58] [INFO ] [Nat]Absence check using 64 positive place invariants in 24 ms returned sat
[2023-03-09 12:39:58] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 14 ms returned sat
[2023-03-09 12:39:59] [INFO ] After 601ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2023-03-09 12:39:59] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2023-03-09 12:39:59] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-03-09 12:39:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2023-03-09 12:39:59] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 0 ms to minimize.
[2023-03-09 12:39:59] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2023-03-09 12:39:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2023-03-09 12:39:59] [INFO ] Deduced a trap composed of 102 places in 226 ms of which 1 ms to minimize.
[2023-03-09 12:40:00] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 1 ms to minimize.
[2023-03-09 12:40:00] [INFO ] Deduced a trap composed of 95 places in 182 ms of which 1 ms to minimize.
[2023-03-09 12:40:00] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 1 ms to minimize.
[2023-03-09 12:40:00] [INFO ] Deduced a trap composed of 101 places in 180 ms of which 1 ms to minimize.
[2023-03-09 12:40:00] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 1 ms to minimize.
[2023-03-09 12:40:01] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 0 ms to minimize.
[2023-03-09 12:40:01] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2023-03-09 12:40:01] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2023-03-09 12:40:01] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2023-03-09 12:40:01] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2023-03-09 12:40:01] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2023-03-09 12:40:01] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2023-03-09 12:40:01] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2023-03-09 12:40:02] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2023-03-09 12:40:02] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2023-03-09 12:40:02] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2475 ms
[2023-03-09 12:40:02] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-09 12:40:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-09 12:40:02] [INFO ] Deduced a trap composed of 96 places in 197 ms of which 1 ms to minimize.
[2023-03-09 12:40:03] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 0 ms to minimize.
[2023-03-09 12:40:03] [INFO ] Deduced a trap composed of 92 places in 192 ms of which 0 ms to minimize.
[2023-03-09 12:40:03] [INFO ] Deduced a trap composed of 114 places in 161 ms of which 17 ms to minimize.
[2023-03-09 12:40:03] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 1 ms to minimize.
[2023-03-09 12:40:03] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 0 ms to minimize.
[2023-03-09 12:40:03] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 1 ms to minimize.
[2023-03-09 12:40:04] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 0 ms to minimize.
[2023-03-09 12:40:04] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 1 ms to minimize.
[2023-03-09 12:40:04] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 1 ms to minimize.
[2023-03-09 12:40:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1830 ms
[2023-03-09 12:40:04] [INFO ] After 6094ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 259 ms.
[2023-03-09 12:40:04] [INFO ] After 6860ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 15 different solutions.
Parikh walk visited 13 properties in 124 ms.
Support contains 3 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 259 edges and 549 vertex of which 6 / 549 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1222 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 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 542 transition count 403
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 472 transition count 403
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 472 transition count 292
Deduced a syphon composed of 111 places in 1 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 339 transition count 292
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 392 place count 333 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 398 place count 333 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 398 place count 333 transition count 285
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 400 place count 332 transition count 285
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 3 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 287 rules applied. Total rules applied 687 place count 187 transition count 143
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 691 place count 185 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 693 place count 185 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 695 place count 183 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 696 place count 183 transition count 148
Applied a total of 696 rules in 94 ms. Remains 183 /549 variables (removed 366) and now considering 148/482 (removed 334) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 183/549 places, 148/482 transitions.
Finished random walk after 237 steps, including 15 resets, run visited all 3 properties in 5 ms. (steps per millisecond=47 )
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-20-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 481 stabilizing places and 424 stable transitions
Graph (complete) has 1229 edges and 549 vertex of which 547 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 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)||G(p1))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 260 edges and 549 vertex of which 6 / 549 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 1223 edges and 544 vertex of which 542 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 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 541 transition count 403
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 471 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 470 transition count 402
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 144 place count 470 transition count 291
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 388 place count 337 transition count 291
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 395 place count 330 transition count 284
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 403 place count 329 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 403 place count 329 transition count 283
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 405 place count 328 transition count 283
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 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 283 rules applied. Total rules applied 688 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 3 with 4 rules applied. Total rules applied 692 place count 183 transition count 150
Applied a total of 692 rules in 81 ms. Remains 183 /549 variables (removed 366) and now considering 150/482 (removed 332) transitions.
[2023-03-09 12:40:05] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 183 cols
[2023-03-09 12:40:05] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-09 12:40:05] [INFO ] Implicit Places using invariants in 167 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 171 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/549 places, 150/482 transitions.
Applied a total of 0 rules in 21 ms. Remains 160 /160 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 273 ms. Remains : 160/549 places, 150/482 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s63 1), p1:(EQ s35 1)], nbAcceptance=2, 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 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-00 finished in 533 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(((p0&&F(p1))||(p2&&X(G(p3))))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 36 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
// Phase 1: matrix 471 rows 538 cols
[2023-03-09 12:40:06] [INFO ] Computed 107 place invariants in 6 ms
[2023-03-09 12:40:06] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-09 12:40:06] [INFO ] Invariant cache hit.
[2023-03-09 12:40:06] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2023-03-09 12:40:06] [INFO ] Invariant cache hit.
[2023-03-09 12:40:07] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 987 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (EQ s84 1) (EQ s338 1) (EQ s523 1)), p0:(EQ s64 1), p2:(EQ s277 0), p3:(EQ s102 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-02 finished in 1291 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(G((p1&&F(G(p2))))))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 40 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
[2023-03-09 12:40:07] [INFO ] Invariant cache hit.
[2023-03-09 12:40:07] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-09 12:40:07] [INFO ] Invariant cache hit.
[2023-03-09 12:40:08] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2023-03-09 12:40:08] [INFO ] Invariant cache hit.
[2023-03-09 12:40:08] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1112 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s287 1), p1:(EQ s203 0), p2:(EQ s203 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 193 steps with 0 reset in 7 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-03 finished in 1324 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(F(p1)))))'
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 261 edges and 549 vertex of which 6 / 549 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1223 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 541 transition count 402
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 470 transition count 402
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 144 place count 470 transition count 290
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 390 place count 336 transition count 290
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 397 place count 329 transition count 283
Ensure Unique test removed 1 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 405 place count 328 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 405 place count 328 transition count 282
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 407 place count 327 transition count 282
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 690 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 694 place count 182 transition count 149
Applied a total of 694 rules in 89 ms. Remains 182 /549 variables (removed 367) and now considering 149/482 (removed 333) transitions.
[2023-03-09 12:40:08] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 182 cols
[2023-03-09 12:40:08] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-09 12:40:08] [INFO ] Implicit Places using invariants in 158 ms returned [29, 30, 31, 32, 33, 38, 39, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 159 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/549 places, 149/482 transitions.
Applied a total of 0 rules in 14 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 268 ms. Remains : 158/549 places, 149/482 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s6 0), p1:(EQ s6 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 482 steps with 60 reset in 4 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 364 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((X(X(p0))&&G(p1))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 542 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 541 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 541 transition count 474
Applied a total of 16 rules in 47 ms. Remains 541 /549 variables (removed 8) and now considering 474/482 (removed 8) transitions.
// Phase 1: matrix 474 rows 541 cols
[2023-03-09 12:40:09] [INFO ] Computed 107 place invariants in 5 ms
[2023-03-09 12:40:09] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-09 12:40:09] [INFO ] Invariant cache hit.
[2023-03-09 12:40:09] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2023-03-09 12:40:09] [INFO ] Invariant cache hit.
[2023-03-09 12:40:10] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 541/549 places, 474/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1247 ms. Remains : 541/549 places, 474/482 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 3}, { cond=p1, acceptance={0} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}]], initial=0, aps=[p1:(NEQ s464 1), p0:(EQ s166 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 507 reset in 333 ms.
Product exploration explored 100000 steps with 501 reset in 316 ms.
Computed a total of 473 stabilizing places and 416 stable transitions
Graph (complete) has 1213 edges and 541 vertex of which 539 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 473 stabilizing places and 416 stable transitions
Detected a total of 473/541 stabilizing places and 416/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 367 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 398670 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398670 steps, saw 67848 distinct states, run finished after 3003 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 12:40:15] [INFO ] Invariant cache hit.
[2023-03-09 12:40:15] [INFO ] [Real]Absence check using 64 positive place invariants in 22 ms returned sat
[2023-03-09 12:40:15] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-09 12:40:15] [INFO ] After 226ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-09 12:40:15] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-09 12:40:15] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2023-03-09 12:40:15] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2023-03-09 12:40:16] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1112 ms
[2023-03-09 12:40:16] [INFO ] After 1480ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 12:40:16] [INFO ] After 1667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 12:40:17] [INFO ] [Nat]Absence check using 64 positive place invariants in 22 ms returned sat
[2023-03-09 12:40:17] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-09 12:40:17] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 12:40:17] [INFO ] Deduced a trap composed of 93 places in 176 ms of which 2 ms to minimize.
[2023-03-09 12:40:17] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 1 ms to minimize.
[2023-03-09 12:40:17] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2023-03-09 12:40:18] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2023-03-09 12:40:18] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 1 ms to minimize.
[2023-03-09 12:40:18] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 1 ms to minimize.
[2023-03-09 12:40:18] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 1 ms to minimize.
[2023-03-09 12:40:18] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 0 ms to minimize.
[2023-03-09 12:40:19] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 1 ms to minimize.
[2023-03-09 12:40:19] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 0 ms to minimize.
[2023-03-09 12:40:19] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 1 ms to minimize.
[2023-03-09 12:40:19] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 1 ms to minimize.
[2023-03-09 12:40:19] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 0 ms to minimize.
[2023-03-09 12:40:19] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2023-03-09 12:40:20] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 0 ms to minimize.
[2023-03-09 12:40:20] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 0 ms to minimize.
[2023-03-09 12:40:20] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 1 ms to minimize.
[2023-03-09 12:40:20] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 1 ms to minimize.
[2023-03-09 12:40:20] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 0 ms to minimize.
[2023-03-09 12:40:20] [INFO ] Deduced a trap composed of 90 places in 183 ms of which 1 ms to minimize.
[2023-03-09 12:40:21] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 1 ms to minimize.
[2023-03-09 12:40:21] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 1 ms to minimize.
[2023-03-09 12:40:21] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 1 ms to minimize.
[2023-03-09 12:40:21] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 1 ms to minimize.
[2023-03-09 12:40:21] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 0 ms to minimize.
[2023-03-09 12:40:21] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2023-03-09 12:40:22] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2023-03-09 12:40:22] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2023-03-09 12:40:22] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2023-03-09 12:40:22] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2023-03-09 12:40:22] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2023-03-09 12:40:22] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4986 ms
[2023-03-09 12:40:22] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2023-03-09 12:40:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-09 12:40:22] [INFO ] After 5470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-09 12:40:22] [INFO ] After 5749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 474/474 transitions.
Graph (trivial) has 252 edges and 541 vertex of which 6 / 541 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1206 edges and 536 vertex of which 534 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 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 396
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 396
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 285
Deduced a syphon composed of 111 places in 1 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 285
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 673 place count 186 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 677 place count 184 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 679 place count 184 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 681 place count 182 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 682 place count 182 transition count 147
Applied a total of 682 rules in 65 ms. Remains 182 /541 variables (removed 359) and now considering 147/474 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 182/541 places, 147/474 transitions.
Finished random walk after 275 steps, including 15 resets, run visited all 3 properties in 6 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 536 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
[2023-03-09 12:40:23] [INFO ] Invariant cache hit.
[2023-03-09 12:40:24] [INFO ] [Real]Absence check using 64 positive place invariants in 33 ms returned sat
[2023-03-09 12:40:24] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 3 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 228 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLFireability-05 finished in 15451 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)||F(p1)))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 261 edges and 549 vertex of which 6 / 549 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1223 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 541 transition count 401
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 469 transition count 401
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 146 place count 469 transition count 289
Deduced a syphon composed of 112 places in 1 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 392 place count 335 transition count 289
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 398 place count 329 transition count 283
Ensure Unique test removed 1 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 405 place count 328 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 405 place count 328 transition count 282
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 407 place count 327 transition count 282
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 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 690 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 694 place count 182 transition count 149
Applied a total of 694 rules in 50 ms. Remains 182 /549 variables (removed 367) and now considering 149/482 (removed 333) transitions.
[2023-03-09 12:40:24] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 182 cols
[2023-03-09 12:40:24] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-09 12:40:24] [INFO ] Implicit Places using invariants in 188 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 193 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/549 places, 149/482 transitions.
Applied a total of 0 rules in 28 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 273 ms. Remains : 158/549 places, 149/482 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s107 1), p0:(EQ s133 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-07 finished in 432 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 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 54 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-09 12:40:25] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-09 12:40:25] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-09 12:40:25] [INFO ] Invariant cache hit.
[2023-03-09 12:40:25] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2023-03-09 12:40:25] [INFO ] Invariant cache hit.
[2023-03-09 12:40:26] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/549 places, 472/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1246 ms. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-08 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:(EQ s480 0)], 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 11662 steps with 57 reset in 25 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-08 finished in 1358 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))&&(p1||X(p2)))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 31 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
// Phase 1: matrix 471 rows 538 cols
[2023-03-09 12:40:26] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-09 12:40:26] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-09 12:40:26] [INFO ] Invariant cache hit.
[2023-03-09 12:40:27] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2023-03-09 12:40:27] [INFO ] Invariant cache hit.
[2023-03-09 12:40:27] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1006 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s189 1) (EQ s345 1) (EQ s503 1)), p2:(AND (EQ s225 1) (EQ s425 1) (EQ s503 1)), p1:(EQ s29 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-10 finished in 1133 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((p0&&X(X(X(p1)))))||G(p2))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 30 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-09 12:40:27] [INFO ] Computed 107 place invariants in 3 ms
[2023-03-09 12:40:27] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-09 12:40:27] [INFO ] Invariant cache hit.
[2023-03-09 12:40:28] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2023-03-09 12:40:28] [INFO ] Invariant cache hit.
[2023-03-09 12:40:28] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/549 places, 472/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 897 ms. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={} source=1 dest: 10}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 11}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=p2, acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 6}, { cond=(NOT p0), acceptance={} source=9 dest: 8}], [{ cond=p2, acceptance={} source=10 dest: 7}, { cond=(NOT p2), acceptance={} source=10 dest: 9}], [{ cond=(NOT p2), acceptance={} source=11 dest: 8}, { cond=p2, acceptance={} source=11 dest: 11}]], initial=1, aps=[p1:(EQ s467 1), p2:(EQ s395 1), p0:(OR (EQ s225 0) (EQ s425 0) (EQ s504 0) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-11 finished in 1198 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)))'
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 25 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
// Phase 1: matrix 471 rows 538 cols
[2023-03-09 12:40:28] [INFO ] Computed 107 place invariants in 3 ms
[2023-03-09 12:40:28] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-09 12:40:28] [INFO ] Invariant cache hit.
[2023-03-09 12:40:29] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2023-03-09 12:40:29] [INFO ] Invariant cache hit.
[2023-03-09 12:40:29] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1130 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s491 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][false, false]]
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-12 finished in 1234 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(G((X(X(!F(p0))) U p0)))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 261 edges and 549 vertex of which 6 / 549 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 1223 edges and 544 vertex of which 542 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 541 transition count 401
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 469 transition count 401
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 146 place count 469 transition count 289
Deduced a syphon composed of 112 places in 1 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 392 place count 335 transition count 289
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 400 place count 327 transition count 281
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 326 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 409 place count 326 transition count 280
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 411 place count 325 transition count 280
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 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 694 place count 182 transition count 140
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 696 place count 181 transition count 143
Applied a total of 696 rules in 32 ms. Remains 181 /549 variables (removed 368) and now considering 143/482 (removed 339) transitions.
// Phase 1: matrix 143 rows 181 cols
[2023-03-09 12:40:29] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-09 12:40:30] [INFO ] Implicit Places using invariants in 122 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 124 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/549 places, 143/482 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 159 ms. Remains : 157/549 places, 143/482 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-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 (EQ s3 1) (EQ s107 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-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-13 finished in 203 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||X(F(p0))))||((!p0||X(F(p0)))&&F(G(p1))))))'
Support contains 4 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 29 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-09 12:40:30] [INFO ] Computed 107 place invariants in 3 ms
[2023-03-09 12:40:30] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-09 12:40:30] [INFO ] Invariant cache hit.
[2023-03-09 12:40:30] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2023-03-09 12:40:30] [INFO ] Invariant cache hit.
[2023-03-09 12:40:31] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/549 places, 472/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 980 ms. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 172 ms :[false, false, (NOT p0), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s331 1) (EQ s521 1)), p1:(NEQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 505 reset in 279 ms.
Product exploration explored 100000 steps with 507 reset in 263 ms.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1212 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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 (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (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 6 factoid took 418 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[false, false, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 12:40:32] [INFO ] Invariant cache hit.
[2023-03-09 12:40:32] [INFO ] [Real]Absence check using 64 positive place invariants in 25 ms returned sat
[2023-03-09 12:40:32] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 44 ms returned sat
[2023-03-09 12:40:33] [INFO ] After 229ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 12:40:33] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-09 12:40:33] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 0 ms to minimize.
[2023-03-09 12:40:33] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2023-03-09 12:40:33] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 0 ms to minimize.
[2023-03-09 12:40:33] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2023-03-09 12:40:33] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 0 ms to minimize.
[2023-03-09 12:40:33] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2023-03-09 12:40:33] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2023-03-09 12:40:33] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2023-03-09 12:40:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 899 ms
[2023-03-09 12:40:33] [INFO ] After 1152ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:40:33] [INFO ] After 1357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:40:34] [INFO ] [Nat]Absence check using 64 positive place invariants in 21 ms returned sat
[2023-03-09 12:40:34] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 17 ms returned sat
[2023-03-09 12:40:34] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:40:34] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2023-03-09 12:40:34] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-09 12:40:34] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2023-03-09 12:40:34] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2023-03-09 12:40:34] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2023-03-09 12:40:34] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2023-03-09 12:40:34] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2023-03-09 12:40:35] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2023-03-09 12:40:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 860 ms
[2023-03-09 12:40:35] [INFO ] After 1076ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-09 12:40:35] [INFO ] After 1244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1205 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 532 transition count 396
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 465 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 136 place count 465 transition count 285
Deduced a syphon composed of 111 places in 1 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 380 place count 332 transition count 285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 381 place count 331 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 382 place count 331 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 382 place count 331 transition count 283
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 384 place count 330 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 670 place count 185 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 674 place count 183 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 676 place count 183 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 678 place count 181 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 679 place count 181 transition count 147
Applied a total of 679 rules in 44 ms. Remains 181 /539 variables (removed 358) and now considering 147/472 (removed 325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 181/539 places, 147/472 transitions.
Finished random walk after 508 steps, including 26 resets, run visited all 1 properties in 5 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 399 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[false, false, (AND (NOT p0) (NOT p1))]
Support contains 4 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 17 ms. Remains 539 /539 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2023-03-09 12:40:35] [INFO ] Invariant cache hit.
[2023-03-09 12:40:36] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-09 12:40:36] [INFO ] Invariant cache hit.
[2023-03-09 12:40:36] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-03-09 12:40:36] [INFO ] Invariant cache hit.
[2023-03-09 12:40:37] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1130 ms. Remains : 539/539 places, 472/472 transitions.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1212 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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 (NOT p0) p1), (X (NOT p0)), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 395 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[false, false, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 568515 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 568515 steps, saw 94529 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-09 12:40:40] [INFO ] Invariant cache hit.
[2023-03-09 12:40:40] [INFO ] [Real]Absence check using 64 positive place invariants in 17 ms returned sat
[2023-03-09 12:40:40] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-09 12:40:40] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:40:41] [INFO ] [Nat]Absence check using 64 positive place invariants in 15 ms returned sat
[2023-03-09 12:40:41] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 12 ms returned sat
[2023-03-09 12:40:41] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:40:41] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2023-03-09 12:40:41] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2023-03-09 12:40:41] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2023-03-09 12:40:41] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-03-09 12:40:41] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2023-03-09 12:40:41] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-03-09 12:40:41] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 0 ms to minimize.
[2023-03-09 12:40:41] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2023-03-09 12:40:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 800 ms
[2023-03-09 12:40:42] [INFO ] After 981ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 12:40:42] [INFO ] After 1115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 251 edges and 539 vertex of which 6 / 539 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1205 edges and 534 vertex of which 532 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
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 532 transition count 396
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 465 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 136 place count 465 transition count 285
Deduced a syphon composed of 111 places in 1 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 380 place count 332 transition count 285
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 668 place count 186 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 672 place count 184 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 674 place count 184 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 676 place count 182 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 677 place count 182 transition count 148
Applied a total of 677 rules in 45 ms. Remains 182 /539 variables (removed 357) and now considering 148/472 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 182/539 places, 148/472 transitions.
Incomplete random walk after 10000 steps, including 497 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 989706 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 989706 steps, saw 292151 distinct states, run finished after 3002 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 12:40:45] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 182 cols
[2023-03-09 12:40:45] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-09 12:40:45] [INFO ] [Real]Absence check using 64 positive place invariants in 13 ms returned sat
[2023-03-09 12:40:45] [INFO ] [Real]Absence check using 64 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-09 12:40:45] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:40:45] [INFO ] [Nat]Absence check using 64 positive place invariants in 11 ms returned sat
[2023-03-09 12:40:45] [INFO ] [Nat]Absence check using 64 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-09 12:40:45] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:40:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-09 12:40:45] [INFO ] After 15ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 12:40:45] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 12:40:45] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 387 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[false, false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 496 reset in 257 ms.
Product exploration explored 100000 steps with 507 reset in 273 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 129 ms :[false, false, (AND (NOT p0) (NOT p1))]
Support contains 4 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 251 edges and 539 vertex of which 6 / 539 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 1206 edges and 534 vertex of which 532 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
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 532 transition count 464
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 86 Pre rules applied. Total rules applied 63 place count 532 transition count 524
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 1 with 86 rules applied. Total rules applied 149 place count 532 transition count 524
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 176 place count 505 transition count 479
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 203 place count 505 transition count 479
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 292 places in 0 ms
Iterating global reduction 1 with 172 rules applied. Total rules applied 375 place count 505 transition count 479
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 419 place count 461 transition count 435
Deduced a syphon composed of 248 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 463 place count 461 transition count 435
Deduced a syphon composed of 248 places in 0 ms
Applied a total of 463 rules in 99 ms. Remains 461 /539 variables (removed 78) and now considering 435/472 (removed 37) transitions.
[2023-03-09 12:40:47] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 435 rows 461 cols
[2023-03-09 12:40:47] [INFO ] Computed 107 place invariants in 5 ms
[2023-03-09 12:40:47] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 461/539 places, 435/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 485 ms. Remains : 461/539 places, 435/472 transitions.
Built C files in :
/tmp/ltsmin15025000025661881345
[2023-03-09 12:40:47] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15025000025661881345
Running compilation step : cd /tmp/ltsmin15025000025661881345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 878 ms.
Running link step : cd /tmp/ltsmin15025000025661881345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin15025000025661881345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11565774637655320371.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 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 38 ms. Remains 539 /539 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-09 12:41:02] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-09 12:41:03] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-09 12:41:03] [INFO ] Invariant cache hit.
[2023-03-09 12:41:03] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-09 12:41:03] [INFO ] Invariant cache hit.
[2023-03-09 12:41:03] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1033 ms. Remains : 539/539 places, 472/472 transitions.
Built C files in :
/tmp/ltsmin18013646963113499420
[2023-03-09 12:41:03] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18013646963113499420
Running compilation step : cd /tmp/ltsmin18013646963113499420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 603 ms.
Running link step : cd /tmp/ltsmin18013646963113499420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin18013646963113499420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5848125803800354580.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 12:41:19] [INFO ] Flatten gal took : 43 ms
[2023-03-09 12:41:19] [INFO ] Flatten gal took : 32 ms
[2023-03-09 12:41:19] [INFO ] Time to serialize gal into /tmp/LTL11420386234594396896.gal : 7 ms
[2023-03-09 12:41:19] [INFO ] Time to serialize properties into /tmp/LTL9041039753857004750.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11420386234594396896.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18145169177974530913.hoa' '-atoms' '/tmp/LTL9041039753857004750.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9041039753857004750.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18145169177974530913.hoa
Detected timeout of ITS tools.
[2023-03-09 12:41:34] [INFO ] Flatten gal took : 47 ms
[2023-03-09 12:41:34] [INFO ] Flatten gal took : 61 ms
[2023-03-09 12:41:34] [INFO ] Time to serialize gal into /tmp/LTL3941455179280657079.gal : 6 ms
[2023-03-09 12:41:34] [INFO ] Time to serialize properties into /tmp/LTL3273058640159220100.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3941455179280657079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3273058640159220100.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G(("((p105!=1)||(p417!=1))")||(("(p764!=1)")||(X(F("(((p105==1)&&(p417==1))&&(p764==1))"))))))||((F(G("(p63!=1)")))&&(("((p105!=...240
Formula 0 simplified : X(F(!"((p105!=1)||(p417!=1))" & !"(p764!=1)" & XG!"(((p105==1)&&(p417==1))&&(p764==1))") & ((!"((p105!=1)||(p417!=1))" & !"(p764!=1)...218
Detected timeout of ITS tools.
[2023-03-09 12:41:49] [INFO ] Flatten gal took : 58 ms
[2023-03-09 12:41:49] [INFO ] Applying decomposition
[2023-03-09 12:41:49] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7002811287747022612.txt' '-o' '/tmp/graph7002811287747022612.bin' '-w' '/tmp/graph7002811287747022612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7002811287747022612.bin' '-l' '-1' '-v' '-w' '/tmp/graph7002811287747022612.weights' '-q' '0' '-e' '0.001'
[2023-03-09 12:41:49] [INFO ] Decomposing Gal with order
[2023-03-09 12:41:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:41:49] [INFO ] Removed a total of 283 redundant transitions.
[2023-03-09 12:41:50] [INFO ] Flatten gal took : 332 ms
[2023-03-09 12:41:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 20 ms.
[2023-03-09 12:41:50] [INFO ] Time to serialize gal into /tmp/LTL4398859179306992956.gal : 15 ms
[2023-03-09 12:41:50] [INFO ] Time to serialize properties into /tmp/LTL4516119680978805234.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4398859179306992956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4516119680978805234.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G(("((i18.i1.u31.p105!=1)||(i18.i2.u119.p417!=1))")||(("(i18.i2.u151.p764!=1)")||(X(F("(((i18.i1.u31.p105==1)&&(i18.i2.u119.p417...387
Formula 0 simplified : X(F(!"((i18.i1.u31.p105!=1)||(i18.i2.u119.p417!=1))" & !"(i18.i2.u151.p764!=1)" & XG!"(((i18.i1.u31.p105==1)&&(i18.i2.u119.p417==1))...365
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16856630460045342357
[2023-03-09 12:42:05] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16856630460045342357
Running compilation step : cd /tmp/ltsmin16856630460045342357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 910 ms.
Running link step : cd /tmp/ltsmin16856630460045342357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin16856630460045342357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true)))||(<>([]((LTLAPp2==true)))&&(X(<>((LTLAPp1==true)))||(LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-20-LTLFireability-14 finished in 110372 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||X(F(p0))))||((!p0||X(F(p0)))&&F(G(p1))))))'
[2023-03-09 12:42:20] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5757506968087666442
[2023-03-09 12:42:20] [INFO ] Computing symmetric may disable matrix : 482 transitions.
[2023-03-09 12:42:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:42:20] [INFO ] Computing symmetric may enable matrix : 482 transitions.
[2023-03-09 12:42:20] [INFO ] Applying decomposition
[2023-03-09 12:42:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:42:20] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15465156123021375485.txt' '-o' '/tmp/graph15465156123021375485.bin' '-w' '/tmp/graph15465156123021375485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15465156123021375485.bin' '-l' '-1' '-v' '-w' '/tmp/graph15465156123021375485.weights' '-q' '0' '-e' '0.001'
[2023-03-09 12:42:20] [INFO ] Decomposing Gal with order
[2023-03-09 12:42:20] [INFO ] Computing Do-Not-Accords matrix : 482 transitions.
[2023-03-09 12:42:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:42:20] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:42:20] [INFO ] Built C files in 155ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5757506968087666442
Running compilation step : cd /tmp/ltsmin5757506968087666442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 12:42:20] [INFO ] Removed a total of 290 redundant transitions.
[2023-03-09 12:42:20] [INFO ] Flatten gal took : 30 ms
[2023-03-09 12:42:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 10 ms.
[2023-03-09 12:42:20] [INFO ] Time to serialize gal into /tmp/LTLFireability6288934032004249493.gal : 7 ms
[2023-03-09 12:42:20] [INFO ] Time to serialize properties into /tmp/LTLFireability8174281851471619570.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6288934032004249493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8174281851471619570.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G((!("(((i19.i1.u35.p105==1)&&(i19.i0.u124.p417==1))&&(i19.i0.u155.p764==1))"))||(X(F("(((i19.i1.u35.p105==1)&&(i19.i0.u124.p417...389
Formula 0 simplified : X(F("(((i19.i1.u35.p105==1)&&(i19.i0.u124.p417==1))&&(i19.i0.u155.p764==1))" & XG!"(((i19.i1.u35.p105==1)&&(i19.i0.u124.p417==1))&&(...363
Compilation finished in 1007 ms.
Running link step : cd /tmp/ltsmin5757506968087666442;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin5757506968087666442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((!(LTLAPp0==true)||X(<>((LTLAPp0==true)))))||((!(LTLAPp0==true)||X(<>((LTLAPp0==true))))&&<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.075: LTL layer: formula: X(([]((!(LTLAPp0==true)||X(<>((LTLAPp0==true)))))||((!(LTLAPp0==true)||X(<>((LTLAPp0==true))))&&<>([]((LTLAPp1==true))))))
pins2lts-mc-linux64( 2/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.079: "X(([]((!(LTLAPp0==true)||X(<>((LTLAPp0==true)))))||((!(LTLAPp0==true)||X(<>((LTLAPp0==true))))&&<>([]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.079: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.105: buchi has 6 states
pins2lts-mc-linux64( 5/ 8), 0.109: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.122: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.122: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.243: There are 485 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.243: State length is 550, there are 492 groups
pins2lts-mc-linux64( 0/ 8), 0.243: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.243: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.243: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.243: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.321: [Blue] ~120 levels ~960 states ~4576 transitions
pins2lts-mc-linux64( 0/ 8), 0.389: [Blue] ~178 levels ~1920 states ~9528 transitions
pins2lts-mc-linux64( 0/ 8), 0.438: [Blue] ~178 levels ~3840 states ~17008 transitions
pins2lts-mc-linux64( 0/ 8), 0.552: [Blue] ~178 levels ~7680 states ~34160 transitions
pins2lts-mc-linux64( 1/ 8), 0.713: [Blue] ~191 levels ~15360 states ~71800 transitions
pins2lts-mc-linux64( 0/ 8), 0.999: [Blue] ~178 levels ~30720 states ~155336 transitions
pins2lts-mc-linux64( 5/ 8), 1.556: [Blue] ~819 levels ~61440 states ~239832 transitions
pins2lts-mc-linux64( 5/ 8), 2.523: [Blue] ~823 levels ~122880 states ~503248 transitions
pins2lts-mc-linux64( 5/ 8), 4.257: [Blue] ~850 levels ~245760 states ~1108648 transitions
pins2lts-mc-linux64( 5/ 8), 7.391: [Blue] ~850 levels ~491520 states ~2428048 transitions
pins2lts-mc-linux64( 2/ 8), 13.433: [Blue] ~177 levels ~983040 states ~6573384 transitions
pins2lts-mc-linux64( 7/ 8), 24.605: [Blue] ~633 levels ~1966080 states ~11547776 transitions
pins2lts-mc-linux64( 7/ 8), 46.808: [Blue] ~633 levels ~3932160 states ~25053064 transitions
pins2lts-mc-linux64( 7/ 8), 92.476: [Blue] ~633 levels ~7864320 states ~52303392 transitions
pins2lts-mc-linux64( 7/ 8), 189.461: [Blue] ~633 levels ~15728640 states ~112427304 transitions
pins2lts-mc-linux64( 7/ 8), 375.432: [Blue] ~633 levels ~31457280 states ~239366568 transitions
pins2lts-mc-linux64( 5/ 8), 772.963: [Blue] ~850 levels ~62914560 states ~509353424 transitions
pins2lts-mc-linux64( 0/ 8), 1101.839: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1101.859:
pins2lts-mc-linux64( 0/ 8), 1101.859: Explored 80595060 states 736937286 transitions, fanout: 9.144
pins2lts-mc-linux64( 0/ 8), 1101.859: Total exploration time 1101.600 sec (1101.540 sec minimum, 1101.579 sec on average)
pins2lts-mc-linux64( 0/ 8), 1101.859: States per second: 73162, Transitions per second: 668970
pins2lts-mc-linux64( 0/ 8), 1101.859:
pins2lts-mc-linux64( 0/ 8), 1101.859: State space has 80497331 states, 898 are accepting
pins2lts-mc-linux64( 0/ 8), 1101.859: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1101.859: blue states: 80595060 (100.12%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1101.859: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1101.859: all-red states: 898 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1101.859:
pins2lts-mc-linux64( 0/ 8), 1101.859: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 1101.859:
pins2lts-mc-linux64( 0/ 8), 1101.859: Queue width: 8B, total height: 3803, memory: 0.03MB
pins2lts-mc-linux64( 0/ 8), 1101.859: Tree memory: 870.1MB, 11.3 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1101.859: Tree fill ratio (roots/leafs): 59.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1101.859: Stored 507 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1101.859: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1101.859: Est. total memory use: 870.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5757506968087666442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((!(LTLAPp0==true)||X(<>((LTLAPp0==true)))))||((!(LTLAPp0==true)||X(<>((LTLAPp0==true))))&&<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5757506968087666442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((!(LTLAPp0==true)||X(<>((LTLAPp0==true)))))||((!(LTLAPp0==true)||X(<>((LTLAPp0==true))))&&<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-09 13:03:10] [INFO ] Applying decomposition
[2023-03-09 13:03:10] [INFO ] Flatten gal took : 35 ms
[2023-03-09 13:03:10] [INFO ] Decomposing Gal with order
[2023-03-09 13:03:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 13:03:10] [INFO ] Removed a total of 145 redundant transitions.
[2023-03-09 13:03:10] [INFO ] Flatten gal took : 41 ms
[2023-03-09 13:03:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 306 labels/synchronizations in 291 ms.
[2023-03-09 13:03:10] [INFO ] Time to serialize gal into /tmp/LTLFireability13688994429594112976.gal : 12 ms
[2023-03-09 13:03:10] [INFO ] Time to serialize properties into /tmp/LTLFireability8296088519037463278.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13688994429594112976.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8296088519037463278.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G((!("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u46.p105==1...1234
Formula 0 simplified : X(F("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u46.p105==1)&&(i...1208
Detected timeout of ITS tools.
[2023-03-09 13:24:03] [INFO ] Flatten gal took : 358 ms
[2023-03-09 13:24:04] [INFO ] Input system was already deterministic with 482 transitions.
[2023-03-09 13:24:04] [INFO ] Transformed 549 places.
[2023-03-09 13:24:04] [INFO ] Transformed 482 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 13:24:35] [INFO ] Time to serialize gal into /tmp/LTLFireability6874054436179853927.gal : 31 ms
[2023-03-09 13:24:35] [INFO ] Time to serialize properties into /tmp/LTLFireability11523192796404975906.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6874054436179853927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11523192796404975906.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G((!("(((p105==1)&&(p417==1))&&(p764==1))"))||(X(F("(((p105==1)&&(p417==1))&&(p764==1))")))))||(((!("(((p105==1)&&(p417==1))&&(p...238
Formula 0 simplified : X(F("(((p105==1)&&(p417==1))&&(p764==1))" & XG!"(((p105==1)&&(p417==1))&&(p764==1))") & (("(((p105==1)&&(p417==1))&&(p764==1))" & XG...212
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 156940 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16056040 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690600604"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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