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-167813690500572.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-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K 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:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K 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 159K 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-16-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678363730957

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-16
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 12:08:52] [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:08:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:08:53] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-09 12:08:53] [INFO ] Transformed 638 places.
[2023-03-09 12:08:53] [INFO ] Transformed 578 transitions.
[2023-03-09 12:08:53] [INFO ] Found NUPN structural information;
[2023-03-09 12:08:53] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 96 place count 534 transition count 479
Iterating global reduction 1 with 91 rules applied. Total rules applied 187 place count 534 transition count 479
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 238 place count 483 transition count 428
Iterating global reduction 1 with 51 rules applied. Total rules applied 289 place count 483 transition count 428
Applied a total of 289 rules in 165 ms. Remains 483 /630 variables (removed 147) and now considering 428/570 (removed 142) transitions.
// Phase 1: matrix 428 rows 483 cols
[2023-03-09 12:08:53] [INFO ] Computed 95 place invariants in 34 ms
[2023-03-09 12:08:54] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-09 12:08:54] [INFO ] Invariant cache hit.
[2023-03-09 12:08:54] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2023-03-09 12:08:54] [INFO ] Invariant cache hit.
[2023-03-09 12:08:55] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/630 places, 428/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1658 ms. Remains : 483/630 places, 428/570 transitions.
Support contains 36 out of 483 places after structural reductions.
[2023-03-09 12:08:55] [INFO ] Flatten gal took : 95 ms
[2023-03-09 12:08:55] [INFO ] Flatten gal took : 42 ms
[2023-03-09 12:08:55] [INFO ] Input system was already deterministic with 428 transitions.
Support contains 34 out of 483 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 31) seen :10
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-09 12:08:56] [INFO ] Invariant cache hit.
[2023-03-09 12:08:56] [INFO ] [Real]Absence check using 56 positive place invariants in 14 ms returned sat
[2023-03-09 12:08:56] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 9 ms returned sat
[2023-03-09 12:08:57] [INFO ] After 507ms SMT Verify possible using state equation in real domain returned unsat :2 sat :17 real:2
[2023-03-09 12:08:57] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 10 ms to minimize.
[2023-03-09 12:08:57] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 0 ms to minimize.
[2023-03-09 12:08:57] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 4 ms to minimize.
[2023-03-09 12:08:57] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2023-03-09 12:08:57] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 5 ms to minimize.
[2023-03-09 12:08:58] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2023-03-09 12:08:58] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2023-03-09 12:08:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 854 ms
[2023-03-09 12:08:58] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2023-03-09 12:08:59] [INFO ] Deduced a trap composed of 37 places in 638 ms of which 0 ms to minimize.
[2023-03-09 12:08:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 773 ms
[2023-03-09 12:08:59] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 1 ms to minimize.
[2023-03-09 12:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-09 12:08:59] [INFO ] After 2968ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:19
[2023-03-09 12:08:59] [INFO ] After 3584ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:19
[2023-03-09 12:09:00] [INFO ] [Nat]Absence check using 56 positive place invariants in 20 ms returned sat
[2023-03-09 12:09:00] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 70 ms returned sat
[2023-03-09 12:09:00] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :19
[2023-03-09 12:09:00] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2023-03-09 12:09:00] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-09 12:09:01] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 0 ms to minimize.
[2023-03-09 12:09:01] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 0 ms to minimize.
[2023-03-09 12:09:01] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2023-03-09 12:09:01] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2023-03-09 12:09:01] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2023-03-09 12:09:01] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2023-03-09 12:09:01] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2023-03-09 12:09:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 824 ms
[2023-03-09 12:09:01] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 1 ms to minimize.
[2023-03-09 12:09:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-09 12:09:02] [INFO ] After 1903ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
Attempting to minimize the solution found.
Minimization took 310 ms.
[2023-03-09 12:09:02] [INFO ] After 2795ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Fused 21 Parikh solutions to 17 different solutions.
Parikh walk visited 4 properties in 287 ms.
Support contains 16 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 211 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1086 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 477 transition count 370
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 427 transition count 370
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 102 place count 427 transition count 275
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 307 place count 317 transition count 275
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 312 place count 312 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 317 place count 312 transition count 270
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 559 place count 189 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 561 place count 188 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 563 place count 188 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 565 place count 186 transition count 153
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 566 place count 186 transition count 153
Applied a total of 566 rules in 110 ms. Remains 186 /483 variables (removed 297) and now considering 153/428 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 186/483 places, 153/428 transitions.
Incomplete random walk after 10000 steps, including 363 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 15) seen :14
Finished Best-First random walk after 1163 steps, including 21 resets, run visited all 1 properties in 6 ms. (steps per millisecond=193 )
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-16-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 130 stabilizing places and 123 stable transitions
Graph (complete) has 1093 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1&&(p2 U p3)))))))'
Support contains 4 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 221 edges and 483 vertex of which 6 / 483 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 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 476 transition count 367
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 423 transition count 367
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 108 place count 423 transition count 270
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 318 place count 310 transition count 270
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 324 place count 304 transition count 264
Ensure Unique test removed 1 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 331 place count 303 transition count 264
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 585 place count 174 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 587 place count 173 transition count 143
Applied a total of 587 rules in 67 ms. Remains 173 /483 variables (removed 310) and now considering 143/428 (removed 285) transitions.
// Phase 1: matrix 143 rows 173 cols
[2023-03-09 12:09:03] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-09 12:09:03] [INFO ] Implicit Places using invariants in 249 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 253 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/483 places, 143/428 transitions.
Applied a total of 0 rules in 13 ms. Remains 152 /152 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 334 ms. Remains : 152/483 places, 143/428 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s76 1), p1:(EQ s118 1), p3:(EQ s48 1), p2:(EQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-00 finished in 735 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' '!((p0 U (G(p1) U p2)))'
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 227 edges and 483 vertex of which 6 / 483 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 477 transition count 365
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 421 transition count 365
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 113 place count 421 transition count 265
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 330 place count 304 transition count 265
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 339 place count 295 transition count 256
Ensure Unique test removed 1 places
Iterating global reduction 2 with 10 rules applied. Total rules applied 349 place count 294 transition count 256
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 593 place count 170 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 595 place count 169 transition count 140
Applied a total of 595 rules in 59 ms. Remains 169 /483 variables (removed 314) and now considering 140/428 (removed 288) transitions.
// Phase 1: matrix 140 rows 169 cols
[2023-03-09 12:09:04] [INFO ] Computed 73 place invariants in 18 ms
[2023-03-09 12:09:04] [INFO ] Implicit Places using invariants in 236 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 240 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/483 places, 140/428 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 307 ms. Remains : 149/483 places, 140/428 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(NEQ s34 1), p2:(EQ s36 1), p0:(NEQ s26 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, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-01 finished in 472 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))&&((F(p1) U p2) U (G((F(p1) U p2))||(p3&&(F(p1) U p2))))))'
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 472 transition count 417
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 471 transition count 416
Applied a total of 24 rules in 46 ms. Remains 471 /483 variables (removed 12) and now considering 416/428 (removed 12) transitions.
// Phase 1: matrix 416 rows 471 cols
[2023-03-09 12:09:04] [INFO ] Computed 95 place invariants in 3 ms
[2023-03-09 12:09:05] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-09 12:09:05] [INFO ] Invariant cache hit.
[2023-03-09 12:09:05] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2023-03-09 12:09:05] [INFO ] Invariant cache hit.
[2023-03-09 12:09:05] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/483 places, 416/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1048 ms. Remains : 471/483 places, 416/428 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p3), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s299 1), p1:(EQ s443 1), p3:(NEQ s335 1), p0:(EQ s299 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 79 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-02 finished in 1252 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 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 225 edges and 483 vertex of which 6 / 483 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 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 476 transition count 365
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 421 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 420 transition count 364
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 114 place count 420 transition count 263
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 333 place count 302 transition count 263
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 340 place count 295 transition count 256
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 348 place count 294 transition count 256
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 592 place count 170 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 594 place count 169 transition count 140
Applied a total of 594 rules in 48 ms. Remains 169 /483 variables (removed 314) and now considering 140/428 (removed 288) transitions.
// Phase 1: matrix 140 rows 169 cols
[2023-03-09 12:09:05] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-09 12:09:06] [INFO ] Implicit Places using invariants in 124 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 136 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/483 places, 140/428 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 149/483 places, 140/428 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-05 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:(AND (EQ s114 1) (EQ s82 0) (EQ s109 0)), p1:(NEQ s82 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 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-05 finished in 264 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((X(X(X(p0)))||F(p1))))'
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 474 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 473 transition count 418
Applied a total of 20 rules in 43 ms. Remains 473 /483 variables (removed 10) and now considering 418/428 (removed 10) transitions.
// Phase 1: matrix 418 rows 473 cols
[2023-03-09 12:09:06] [INFO ] Computed 95 place invariants in 4 ms
[2023-03-09 12:09:06] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-09 12:09:06] [INFO ] Invariant cache hit.
[2023-03-09 12:09:07] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2023-03-09 12:09:07] [INFO ] Invariant cache hit.
[2023-03-09 12:09:07] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/483 places, 418/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1037 ms. Remains : 473/483 places, 418/428 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s325 1), p0:(AND (EQ s325 1) (EQ s143 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 141 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-06 finished in 1199 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||G(p1)||(p1&&G(F(p2)))))))'
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 473 transition count 418
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 473 transition count 418
Applied a total of 20 rules in 20 ms. Remains 473 /483 variables (removed 10) and now considering 418/428 (removed 10) transitions.
// Phase 1: matrix 418 rows 473 cols
[2023-03-09 12:09:07] [INFO ] Computed 95 place invariants in 4 ms
[2023-03-09 12:09:07] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-09 12:09:07] [INFO ] Invariant cache hit.
[2023-03-09 12:09:08] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2023-03-09 12:09:08] [INFO ] Invariant cache hit.
[2023-03-09 12:09:08] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/483 places, 418/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1044 ms. Remains : 473/483 places, 418/428 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(EQ s411 1), p1:(NEQ s67 1), p2:(NEQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 669 reset in 359 ms.
Product exploration explored 100000 steps with 663 reset in 293 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1083 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 355 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 970606 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 970606 steps, saw 148582 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-09 12:09:13] [INFO ] Invariant cache hit.
[2023-03-09 12:09:13] [INFO ] [Real]Absence check using 56 positive place invariants in 22 ms returned sat
[2023-03-09 12:09:13] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 18 ms returned sat
[2023-03-09 12:09:13] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:09:13] [INFO ] [Nat]Absence check using 56 positive place invariants in 20 ms returned sat
[2023-03-09 12:09:13] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-09 12:09:13] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:09:13] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 13 ms to minimize.
[2023-03-09 12:09:14] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2023-03-09 12:09:14] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-09 12:09:14] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2023-03-09 12:09:14] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2023-03-09 12:09:14] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2023-03-09 12:09:14] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-09 12:09:14] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2023-03-09 12:09:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 856 ms
[2023-03-09 12:09:14] [INFO ] After 1060ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 12:09:14] [INFO ] After 1230ms 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 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 418/418 transitions.
Graph (trivial) has 212 edges and 473 vertex of which 6 / 473 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 1076 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 467 transition count 365
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 422 transition count 365
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 92 place count 422 transition count 264
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 311 place count 304 transition count 264
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 570 place count 172 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 572 place count 171 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 574 place count 171 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 576 place count 169 transition count 139
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 577 place count 169 transition count 139
Applied a total of 577 rules in 41 ms. Remains 169 /473 variables (removed 304) and now considering 139/418 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 169/473 places, 139/418 transitions.
Incomplete random walk after 10000 steps, including 399 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Finished Best-First random walk after 233 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=116 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 496 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 3 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 418/418 transitions.
Applied a total of 0 rules in 19 ms. Remains 473 /473 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-09 12:09:15] [INFO ] Invariant cache hit.
[2023-03-09 12:09:15] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-09 12:09:15] [INFO ] Invariant cache hit.
[2023-03-09 12:09:16] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2023-03-09 12:09:16] [INFO ] Invariant cache hit.
[2023-03-09 12:09:16] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1034 ms. Remains : 473/473 places, 418/418 transitions.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1083 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 264 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 947699 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 947699 steps, saw 145449 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-09 12:09:20] [INFO ] Invariant cache hit.
[2023-03-09 12:09:20] [INFO ] [Real]Absence check using 56 positive place invariants in 19 ms returned sat
[2023-03-09 12:09:20] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-09 12:09:20] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:09:20] [INFO ] [Nat]Absence check using 56 positive place invariants in 15 ms returned sat
[2023-03-09 12:09:20] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 14 ms returned sat
[2023-03-09 12:09:20] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:09:20] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2023-03-09 12:09:20] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-03-09 12:09:20] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2023-03-09 12:09:21] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2023-03-09 12:09:21] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2023-03-09 12:09:21] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2023-03-09 12:09:21] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2023-03-09 12:09:21] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2023-03-09 12:09:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 754 ms
[2023-03-09 12:09:21] [INFO ] After 932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 12:09:21] [INFO ] After 1060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 418/418 transitions.
Graph (trivial) has 212 edges and 473 vertex of which 6 / 473 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 1076 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 467 transition count 365
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 422 transition count 365
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 92 place count 422 transition count 264
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 311 place count 304 transition count 264
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 570 place count 172 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 572 place count 171 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 574 place count 171 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 576 place count 169 transition count 139
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 577 place count 169 transition count 139
Applied a total of 577 rules in 43 ms. Remains 169 /473 variables (removed 304) and now considering 139/418 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 169/473 places, 139/418 transitions.
Incomplete random walk after 10000 steps, including 425 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Finished Best-First random walk after 303 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=151 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 482 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 665 reset in 227 ms.
Product exploration explored 100000 steps with 673 reset in 367 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 418/418 transitions.
Graph (trivial) has 212 edges and 473 vertex of which 6 / 473 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 1077 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 467 transition count 411
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 46 place count 467 transition count 464
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 118 place count 467 transition count 464
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 132 place count 453 transition count 438
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 146 place count 453 transition count 438
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 258 places in 1 ms
Iterating global reduction 1 with 156 rules applied. Total rules applied 302 place count 453 transition count 438
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 337 place count 418 transition count 403
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 372 place count 418 transition count 403
Deduced a syphon composed of 223 places in 1 ms
Applied a total of 372 rules in 97 ms. Remains 418 /473 variables (removed 55) and now considering 403/418 (removed 15) transitions.
[2023-03-09 12:09:23] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 403 rows 418 cols
[2023-03-09 12:09:23] [INFO ] Computed 95 place invariants in 9 ms
[2023-03-09 12:09:24] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 418/473 places, 403/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 600 ms. Remains : 418/473 places, 403/418 transitions.
Built C files in :
/tmp/ltsmin12039499724531022763
[2023-03-09 12:09:24] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12039499724531022763
Running compilation step : cd /tmp/ltsmin12039499724531022763;'/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 690 ms.
Running link step : cd /tmp/ltsmin12039499724531022763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin12039499724531022763;'/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/stateBased2963804365075717245.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 418/418 transitions.
Applied a total of 0 rules in 7 ms. Remains 473 /473 variables (removed 0) and now considering 418/418 (removed 0) transitions.
// Phase 1: matrix 418 rows 473 cols
[2023-03-09 12:09:39] [INFO ] Computed 95 place invariants in 4 ms
[2023-03-09 12:09:39] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-09 12:09:39] [INFO ] Invariant cache hit.
[2023-03-09 12:09:39] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2023-03-09 12:09:40] [INFO ] Invariant cache hit.
[2023-03-09 12:09:40] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 473/473 places, 418/418 transitions.
Built C files in :
/tmp/ltsmin12182037220549390036
[2023-03-09 12:09:40] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12182037220549390036
Running compilation step : cd /tmp/ltsmin12182037220549390036;'/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 491 ms.
Running link step : cd /tmp/ltsmin12182037220549390036;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12182037220549390036;'/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/stateBased9110877548200885521.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 12:09:55] [INFO ] Flatten gal took : 38 ms
[2023-03-09 12:09:55] [INFO ] Flatten gal took : 27 ms
[2023-03-09 12:09:55] [INFO ] Time to serialize gal into /tmp/LTL1963163750546982918.gal : 5 ms
[2023-03-09 12:09:55] [INFO ] Time to serialize properties into /tmp/LTL9201786049255514339.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/LTL1963163750546982918.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10367019766616276885.hoa' '-atoms' '/tmp/LTL9201786049255514339.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...318
Loading property file /tmp/LTL9201786049255514339.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10367019766616276885.hoa
Detected timeout of ITS tools.
[2023-03-09 12:10:10] [INFO ] Flatten gal took : 30 ms
[2023-03-09 12:10:10] [INFO ] Flatten gal took : 24 ms
[2023-03-09 12:10:10] [INFO ] Time to serialize gal into /tmp/LTL11633506408196264577.gal : 4 ms
[2023-03-09 12:10:10] [INFO ] Time to serialize properties into /tmp/LTL10482347088855199860.ltl : 4 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/LTL11633506408196264577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10482347088855199860.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...277
Read 1 LTL properties
Checking formula 0 : !((X(F((("(p550==1)")||(G("(p84!=1)")))||(("(p84!=1)")&&(G(F("(p33!=1)"))))))))
Formula 0 simplified : XG(!"(p550==1)" & F!"(p84!=1)" & (!"(p84!=1)" | FG!"(p33!=1)"))
Detected timeout of ITS tools.
[2023-03-09 12:10:25] [INFO ] Flatten gal took : 14 ms
[2023-03-09 12:10:25] [INFO ] Applying decomposition
[2023-03-09 12:10:25] [INFO ] Flatten gal took : 14 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/graph8762542913363935888.txt' '-o' '/tmp/graph8762542913363935888.bin' '-w' '/tmp/graph8762542913363935888.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8762542913363935888.bin' '-l' '-1' '-v' '-w' '/tmp/graph8762542913363935888.weights' '-q' '0' '-e' '0.001'
[2023-03-09 12:10:25] [INFO ] Decomposing Gal with order
[2023-03-09 12:10:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:10:25] [INFO ] Removed a total of 283 redundant transitions.
[2023-03-09 12:10:25] [INFO ] Flatten gal took : 57 ms
[2023-03-09 12:10:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 13 ms.
[2023-03-09 12:10:25] [INFO ] Time to serialize gal into /tmp/LTL3776771380552424829.gal : 8 ms
[2023-03-09 12:10:25] [INFO ] Time to serialize properties into /tmp/LTL10153633505871420630.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/LTL3776771380552424829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10153633505871420630.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...255
Read 1 LTL properties
Checking formula 0 : !((X(F((("(i6.i1.u142.p550==1)")||(G("(i5.i0.u28.p84!=1)")))||(("(i5.i0.u28.p84!=1)")&&(G(F("(i3.i0.u13.p33!=1)"))))))))
Formula 0 simplified : XG(!"(i6.i1.u142.p550==1)" & F!"(i5.i0.u28.p84!=1)" & (!"(i5.i0.u28.p84!=1)" | FG!"(i3.i0.u13.p33!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t178, t252, t279, t289, t396, t397, t405, t406, t413, t418, t420, t422, t423...1319
Computing Next relation with stutter on 1215 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4802334901028159579
[2023-03-09 12:10:41] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4802334901028159579
Running compilation step : cd /tmp/ltsmin4802334901028159579;'/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 552 ms.
Running link step : cd /tmp/ltsmin4802334901028159579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4802334901028159579;'/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)||[]((LTLAPp1==true))||((LTLAPp1==true)&&[](<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-16-LTLFireability-08 finished in 108708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X((p2 U p0)))))'
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 473 transition count 418
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 472 transition count 417
Applied a total of 22 rules in 23 ms. Remains 472 /483 variables (removed 11) and now considering 417/428 (removed 11) transitions.
// Phase 1: matrix 417 rows 472 cols
[2023-03-09 12:10:56] [INFO ] Computed 95 place invariants in 10 ms
[2023-03-09 12:10:56] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-09 12:10:56] [INFO ] Invariant cache hit.
[2023-03-09 12:10:56] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2023-03-09 12:10:56] [INFO ] Invariant cache hit.
[2023-03-09 12:10:57] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/483 places, 417/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 472/483 places, 417/428 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s111 1), p0:(EQ s40 1), p2:(NEQ s206 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-09 finished in 1156 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)))&&F(p2)))'
Support contains 4 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 472 transition count 417
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 471 transition count 416
Applied a total of 24 rules in 30 ms. Remains 471 /483 variables (removed 12) and now considering 416/428 (removed 12) transitions.
// Phase 1: matrix 416 rows 471 cols
[2023-03-09 12:10:57] [INFO ] Computed 95 place invariants in 6 ms
[2023-03-09 12:10:57] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-09 12:10:57] [INFO ] Invariant cache hit.
[2023-03-09 12:10:57] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2023-03-09 12:10:57] [INFO ] Invariant cache hit.
[2023-03-09 12:10:58] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/483 places, 416/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 830 ms. Remains : 471/483 places, 416/428 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s48 1) (EQ s286 1) (EQ s392 1)), p0:(EQ s32 0), p1:(EQ s32 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 141 steps with 2 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-10 finished in 998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 227 edges and 483 vertex of which 6 / 483 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 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 476 transition count 365
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 421 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 420 transition count 364
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 114 place count 420 transition count 264
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 330 place count 304 transition count 264
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 339 place count 295 transition count 255
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 349 place count 294 transition count 255
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 597 place count 168 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 599 place count 167 transition count 137
Applied a total of 599 rules in 42 ms. Remains 167 /483 variables (removed 316) and now considering 137/428 (removed 291) transitions.
// Phase 1: matrix 137 rows 167 cols
[2023-03-09 12:10:58] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-09 12:10:58] [INFO ] Implicit Places using invariants in 147 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 131]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 148 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/483 places, 137/428 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 146/483 places, 137/428 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s11 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-16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-12 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 472 transition count 417
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 471 transition count 416
Applied a total of 24 rules in 18 ms. Remains 471 /483 variables (removed 12) and now considering 416/428 (removed 12) transitions.
// Phase 1: matrix 416 rows 471 cols
[2023-03-09 12:10:58] [INFO ] Computed 95 place invariants in 2 ms
[2023-03-09 12:10:58] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-09 12:10:58] [INFO ] Invariant cache hit.
[2023-03-09 12:10:59] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2023-03-09 12:10:59] [INFO ] Invariant cache hit.
[2023-03-09 12:10:59] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/483 places, 416/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 752 ms. Remains : 471/483 places, 416/428 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-13 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:(AND (EQ s114 0) (EQ s193 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-13 finished in 846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 227 edges and 483 vertex of which 6 / 483 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 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 476 transition count 364
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 420 transition count 364
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 114 place count 420 transition count 263
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 333 place count 302 transition count 263
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 341 place count 294 transition count 255
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 350 place count 293 transition count 255
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 598 place count 167 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 600 place count 166 transition count 137
Applied a total of 600 rules in 36 ms. Remains 166 /483 variables (removed 317) and now considering 137/428 (removed 291) transitions.
// Phase 1: matrix 137 rows 166 cols
[2023-03-09 12:10:59] [INFO ] Computed 73 place invariants in 3 ms
[2023-03-09 12:10:59] [INFO ] Implicit Places using invariants in 174 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 175 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/483 places, 137/428 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 215 ms. Remains : 146/483 places, 137/428 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s114 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-14 finished in 585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 227 edges and 483 vertex of which 6 / 483 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 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 476 transition count 364
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 420 transition count 364
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 114 place count 420 transition count 264
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 331 place count 303 transition count 264
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 339 place count 295 transition count 256
Iterating global reduction 2 with 8 rules applied. Total rules applied 347 place count 295 transition count 256
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 597 place count 168 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 599 place count 167 transition count 137
Applied a total of 599 rules in 44 ms. Remains 167 /483 variables (removed 316) and now considering 137/428 (removed 291) transitions.
// Phase 1: matrix 137 rows 167 cols
[2023-03-09 12:10:59] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-09 12:11:00] [INFO ] Implicit Places using invariants in 203 ms returned [1, 2, 3, 6, 7, 8, 9, 16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 124]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 205 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/483 places, 137/428 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 252 ms. Remains : 146/483 places, 137/428 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 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-16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-15 finished in 333 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||G(p1)||(p1&&G(F(p2)))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-16-LTLFireability-08
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 483/483 places, 428/428 transitions.
Graph (trivial) has 222 edges and 483 vertex of which 6 / 483 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 1087 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 476 transition count 367
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 423 transition count 367
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 108 place count 423 transition count 266
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 327 place count 305 transition count 266
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 335 place count 297 transition count 258
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 344 place count 296 transition count 258
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 588 place count 172 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 590 place count 171 transition count 142
Applied a total of 590 rules in 48 ms. Remains 171 /483 variables (removed 312) and now considering 142/428 (removed 286) transitions.
// Phase 1: matrix 142 rows 171 cols
[2023-03-09 12:11:00] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-09 12:11:00] [INFO ] Implicit Places using invariants in 207 ms returned [4, 5, 6, 7, 8, 9, 18, 19, 23, 24, 25, 26, 27, 28, 51, 52, 53, 54, 55]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 209 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 152/483 places, 142/428 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 260 ms. Remains : 152/483 places, 142/428 transitions.
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(EQ s116 1), p1:(NEQ s4 1), p2:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21869 reset in 342 ms.
Product exploration explored 100000 steps with 21838 reset in 322 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 381 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2505 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 768 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 765 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 767 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Finished probabilistic random walk after 306 steps, run visited all 3 properties in 8 ms. (steps per millisecond=38 )
Probabilistic random walk after 306 steps, saw 193 distinct states, run finished after 8 ms. (steps per millisecond=38 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 343 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 142/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 152 /152 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 152 cols
[2023-03-09 12:11:02] [INFO ] Computed 54 place invariants in 2 ms
[2023-03-09 12:11:03] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-09 12:11:03] [INFO ] Invariant cache hit.
[2023-03-09 12:11:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 12:11:03] [INFO ] Implicit Places using invariants and state equation in 248 ms returned [1, 6, 8, 12, 15, 38, 40, 42, 44, 45, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 70, 72, 74, 76, 78, 80, 82, 84, 92, 94, 96, 98, 100]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 381 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/152 places, 142/142 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 112 transition count 134
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 112 transition count 134
Applied a total of 12 rules in 3 ms. Remains 112 /118 variables (removed 6) and now considering 134/142 (removed 8) transitions.
// Phase 1: matrix 134 rows 112 cols
[2023-03-09 12:11:03] [INFO ] Computed 22 place invariants in 13 ms
[2023-03-09 12:11:03] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 12:11:03] [INFO ] Invariant cache hit.
[2023-03-09 12:11:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 12:11:03] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/152 places, 134/142 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 747 ms. Remains : 112/152 places, 134/142 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 368 edges and 112 vertex of which 97 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 295 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2451 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 770 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 773 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 12:11:04] [INFO ] Invariant cache hit.
[2023-03-09 12:11:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-09 12:11:04] [INFO ] [Real]Absence check using 7 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-09 12:11:04] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-09 12:11:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 12:11:04] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 12:11:04] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 12:11:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-09 12:11:04] [INFO ] [Nat]Absence check using 7 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-09 12:11:04] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 12:11:04] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 12:11:04] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 12:11:04] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 134/134 transitions.
Graph (complete) has 354 edges and 112 vertex of which 101 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 116
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 89 transition count 116
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 35 place count 80 transition count 80
Iterating global reduction 2 with 9 rules applied. Total rules applied 44 place count 80 transition count 80
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 63 place count 70 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 65 place count 69 transition count 70
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 69 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 67 transition count 68
Applied a total of 69 rules in 11 ms. Remains 67 /112 variables (removed 45) and now considering 68/134 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 67/112 places, 68/134 transitions.
Finished random walk after 2970 steps, including 184 resets, run visited all 2 properties in 8 ms. (steps per millisecond=371 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 305 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 21861 reset in 139 ms.
Product exploration explored 100000 steps with 21747 reset in 166 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 134/134 transitions.
Graph (complete) has 368 edges and 112 vertex of which 101 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 101 transition count 129
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 22 place count 92 transition count 93
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 31 place count 92 transition count 93
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 92 transition count 99
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 40 rules in 4 ms. Remains 92 /112 variables (removed 20) and now considering 99/134 (removed 35) transitions.
[2023-03-09 12:11:05] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 99 rows 92 cols
[2023-03-09 12:11:05] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-09 12:11:05] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/112 places, 99/134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 92/112 places, 99/134 transitions.
Built C files in :
/tmp/ltsmin9880312028829603083
[2023-03-09 12:11:06] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9880312028829603083
Running compilation step : cd /tmp/ltsmin9880312028829603083;'/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 265 ms.
Running link step : cd /tmp/ltsmin9880312028829603083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9880312028829603083;'/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/stateBased14465359300096673154.hoa' '--buchi-type=spotba'
LTSmin run took 701 ms.
Treatment of property BusinessProcesses-PT-16-LTLFireability-08 finished in 6765 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-09 12:11:07] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
[2023-03-09 12:11:07] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin3786334778345655647
[2023-03-09 12:11:07] [INFO ] Flatten gal took : 24 ms
[2023-03-09 12:11:07] [INFO ] Computing symmetric may disable matrix : 428 transitions.
[2023-03-09 12:11:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:11:07] [INFO ] Computing symmetric may enable matrix : 428 transitions.
[2023-03-09 12:11:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:11:07] [INFO ] Computing Do-Not-Accords matrix : 428 transitions.
[2023-03-09 12:11:07] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:11:07] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3786334778345655647
Running compilation step : cd /tmp/ltsmin3786334778345655647;'/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'
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/graph17645386262725517542.txt' '-o' '/tmp/graph17645386262725517542.bin' '-w' '/tmp/graph17645386262725517542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17645386262725517542.bin' '-l' '-1' '-v' '-w' '/tmp/graph17645386262725517542.weights' '-q' '0' '-e' '0.001'
[2023-03-09 12:11:07] [INFO ] Decomposing Gal with order
[2023-03-09 12:11:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:11:07] [INFO ] Removed a total of 282 redundant transitions.
[2023-03-09 12:11:07] [INFO ] Flatten gal took : 54 ms
[2023-03-09 12:11:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 22 ms.
[2023-03-09 12:11:07] [INFO ] Time to serialize gal into /tmp/LTLFireability8109411575939315743.gal : 17 ms
[2023-03-09 12:11:07] [INFO ] Time to serialize properties into /tmp/LTLFireability4237013352374803399.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/LTLFireability8109411575939315743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4237013352374803399.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(F((("(i4.u150.p550==1)")||(G("(i3.i0.u28.p84!=1)")))||(("(i3.i0.u28.p84!=1)")&&(G(F("(i14.i0.u12.p33!=1)"))))))))
Formula 0 simplified : XG(!"(i4.u150.p550==1)" & F!"(i3.i0.u28.p84!=1)" & (!"(i3.i0.u28.p84!=1)" | FG!"(i14.i0.u12.p33!=1)"))
Compilation finished in 1036 ms.
Running link step : cd /tmp/ltsmin3786334778345655647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin3786334778345655647;'/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)||[]((LTLAPp1==true))||((LTLAPp1==true)&&[](<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
LTSmin run took 9632 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 144994 ms.

BK_STOP 1678363878321

--------------------
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-16"
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-16, 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-167813690500572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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