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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:47 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 177K 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-18-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678364411635

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 12:20:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 12:20:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:20:14] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-09 12:20:14] [INFO ] Transformed 717 places.
[2023-03-09 12:20:14] [INFO ] Transformed 642 transitions.
[2023-03-09 12:20:14] [INFO ] Found NUPN structural information;
[2023-03-09 12:20:14] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 15 places in 16 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 109 place count 593 transition count 526
Iterating global reduction 1 with 101 rules applied. Total rules applied 210 place count 593 transition count 526
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 211 place count 593 transition count 525
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 264 place count 540 transition count 472
Iterating global reduction 2 with 53 rules applied. Total rules applied 317 place count 540 transition count 472
Applied a total of 317 rules in 172 ms. Remains 540 /702 variables (removed 162) and now considering 472/627 (removed 155) transitions.
// Phase 1: matrix 472 rows 540 cols
[2023-03-09 12:20:14] [INFO ] Computed 106 place invariants in 47 ms
[2023-03-09 12:20:15] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-09 12:20:15] [INFO ] Invariant cache hit.
[2023-03-09 12:20:15] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2023-03-09 12:20:15] [INFO ] Invariant cache hit.
[2023-03-09 12:20:16] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 540/702 places, 472/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1675 ms. Remains : 540/702 places, 472/627 transitions.
Support contains 20 out of 540 places after structural reductions.
[2023-03-09 12:20:16] [INFO ] Flatten gal took : 61 ms
[2023-03-09 12:20:16] [INFO ] Flatten gal took : 27 ms
[2023-03-09 12:20:16] [INFO ] Input system was already deterministic with 472 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2023-03-09 12:20:17] [INFO ] Invariant cache hit.
[2023-03-09 12:20:17] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-09 12:20:17] [INFO ] [Real]Absence check using 63 positive and 43 generalized place invariants in 9 ms returned sat
[2023-03-09 12:20:17] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 12:20:17] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-09 12:20:17] [INFO ] [Nat]Absence check using 63 positive and 43 generalized place invariants in 10 ms returned sat
[2023-03-09 12:20:17] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 12:20:17] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 6 ms to minimize.
[2023-03-09 12:20:17] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2023-03-09 12:20:17] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2023-03-09 12:20:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 247 ms
[2023-03-09 12:20:18] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 2 ms to minimize.
[2023-03-09 12:20:18] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 1 ms to minimize.
[2023-03-09 12:20:18] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2023-03-09 12:20:18] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 0 ms to minimize.
[2023-03-09 12:20:18] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2023-03-09 12:20:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 661 ms
[2023-03-09 12:20:18] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 1 ms to minimize.
[2023-03-09 12:20:19] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 0 ms to minimize.
[2023-03-09 12:20:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 472 ms
[2023-03-09 12:20:19] [INFO ] After 1780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-09 12:20:19] [INFO ] After 2071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 109 ms.
Support contains 9 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 472/472 transitions.
Graph (trivial) has 248 edges and 540 vertex of which 6 / 540 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 1197 edges and 535 vertex of which 534 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 534 transition count 404
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 474 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 473 transition count 403
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 124 place count 473 transition count 291
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 249 rules applied. Total rules applied 373 place count 336 transition count 291
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 375 place count 334 transition count 289
Iterating global reduction 3 with 2 rules applied. Total rules applied 377 place count 334 transition count 289
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 285 rules applied. Total rules applied 662 place count 190 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 664 place count 189 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 665 place count 189 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 666 place count 188 transition count 150
Applied a total of 666 rules in 122 ms. Remains 188 /540 variables (removed 352) and now considering 150/472 (removed 322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 188/540 places, 150/472 transitions.
Incomplete random walk after 10000 steps, including 456 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 188 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 150 rows 188 cols
[2023-03-09 12:20:19] [INFO ] Computed 78 place invariants in 5 ms
[2023-03-09 12:20:20] [INFO ] [Real]Absence check using 65 positive place invariants in 7 ms returned sat
[2023-03-09 12:20:20] [INFO ] [Real]Absence check using 65 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-09 12:20:20] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 12:20:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 8 ms returned sat
[2023-03-09 12:20:20] [INFO ] [Nat]Absence check using 65 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-09 12:20:20] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 12:20:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 12:20:20] [INFO ] After 48ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 12:20:20] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2023-03-09 12:20:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-09 12:20:20] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2023-03-09 12:20:20] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2023-03-09 12:20:20] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2023-03-09 12:20:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 204 ms
[2023-03-09 12:20:20] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-09 12:20:20] [INFO ] After 522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 6 ms.
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 150/150 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 188 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 187 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 187 transition count 147
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 185 transition count 147
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 178 transition count 140
Applied a total of 20 rules in 33 ms. Remains 178 /188 variables (removed 10) and now considering 140/150 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 178/188 places, 140/150 transitions.
Incomplete random walk after 10000 steps, including 571 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 241553 steps, run visited all 1 properties in 657 ms. (steps per millisecond=367 )
Probabilistic random walk after 241553 steps, saw 78024 distinct states, run finished after 658 ms. (steps per millisecond=367 ) properties seen :1
Computed a total of 484 stabilizing places and 426 stable transitions
Graph (complete) has 1212 edges and 540 vertex of which 539 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 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 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 534 transition count 466
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 531 transition count 463
Applied a total of 18 rules in 38 ms. Remains 531 /540 variables (removed 9) and now considering 463/472 (removed 9) transitions.
// Phase 1: matrix 463 rows 531 cols
[2023-03-09 12:20:21] [INFO ] Computed 106 place invariants in 14 ms
[2023-03-09 12:20:21] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-09 12:20:21] [INFO ] Invariant cache hit.
[2023-03-09 12:20:22] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2023-03-09 12:20:22] [INFO ] Invariant cache hit.
[2023-03-09 12:20:22] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 531/540 places, 463/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1256 ms. Remains : 531/540 places, 463/472 transitions.
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s229 0) (EQ s169 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 5934 steps with 29 reset in 98 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-03 finished in 1668 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||G(p1)))))'
Support contains 3 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Graph (trivial) has 255 edges and 540 vertex of which 6 / 540 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 1205 edges and 535 vertex of which 534 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 533 transition count 402
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 471 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 470 transition count 401
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 128 place count 470 transition count 289
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 249 rules applied. Total rules applied 377 place count 333 transition count 289
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 381 place count 329 transition count 285
Iterating global reduction 3 with 4 rules applied. Total rules applied 385 place count 329 transition count 285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 385 place count 329 transition count 284
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 387 place count 328 transition count 284
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 289 rules applied. Total rules applied 676 place count 182 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 678 place count 181 transition count 144
Applied a total of 678 rules in 106 ms. Remains 181 /540 variables (removed 359) and now considering 144/472 (removed 328) transitions.
// Phase 1: matrix 144 rows 181 cols
[2023-03-09 12:20:23] [INFO ] Computed 78 place invariants in 2 ms
[2023-03-09 12:20:23] [INFO ] Implicit Places using invariants in 272 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 279 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/540 places, 144/472 transitions.
Applied a total of 0 rules in 11 ms. Remains 153 /153 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 396 ms. Remains : 153/540 places, 144/472 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s123 1), p0:(AND (NEQ s34 0) (NEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9318 reset in 341 ms.
Product exploration explored 100000 steps with 9168 reset in 331 ms.
Computed a total of 131 stabilizing places and 127 stable transitions
Computed a total of 131 stabilizing places and 127 stable transitions
Detected a total of 131/153 stabilizing places and 127/144 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 6 factoid took 412 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1053 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 351 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 144 rows 153 cols
[2023-03-09 12:20:25] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-09 12:20:25] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-09 12:20:25] [INFO ] [Real]Absence check using 37 positive and 13 generalized place invariants in 14 ms returned sat
[2023-03-09 12:20:25] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:20:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-09 12:20:25] [INFO ] [Nat]Absence check using 37 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-09 12:20:25] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:20:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 12:20:25] [INFO ] After 12ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 12:20:25] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-09 12:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-09 12:20:25] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-09 12:20:25] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 144/144 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 143
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 153 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 152 transition count 142
Applied a total of 3 rules in 16 ms. Remains 152 /153 variables (removed 1) and now considering 142/144 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 152/153 places, 142/144 transitions.
Finished random walk after 193 steps, including 10 resets, run visited all 1 properties in 1 ms. (steps per millisecond=193 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 368 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 144/144 transitions.
Applied a total of 0 rules in 11 ms. Remains 153 /153 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2023-03-09 12:20:26] [INFO ] Invariant cache hit.
[2023-03-09 12:20:26] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-09 12:20:26] [INFO ] Invariant cache hit.
[2023-03-09 12:20:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 12:20:26] [INFO ] Implicit Places using invariants and state equation in 259 ms returned [3, 36, 53, 55, 59, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 369 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/153 places, 144/144 transitions.
Graph (complete) has 423 edges and 130 vertex of which 121 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 121 transition count 129
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 110 transition count 129
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 36 place count 97 transition count 88
Iterating global reduction 2 with 13 rules applied. Total rules applied 49 place count 97 transition count 88
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 97 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 53 place count 95 transition count 86
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 92 transition count 83
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 92 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 92 transition count 81
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 71 place count 87 transition count 76
Applied a total of 71 rules in 20 ms. Remains 87 /130 variables (removed 43) and now considering 76/144 (removed 68) transitions.
// Phase 1: matrix 76 rows 87 cols
[2023-03-09 12:20:26] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-09 12:20:26] [INFO ] Implicit Places using invariants in 74 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 76 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/153 places, 76/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 482 ms. Remains : 84/153 places, 76/144 transitions.
Computed a total of 62 stabilizing places and 59 stable transitions
Computed a total of 62 stabilizing places and 59 stable transitions
Detected a total of 62/84 stabilizing places and 59/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 6 factoid took 317 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1054 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 356 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 76 rows 84 cols
[2023-03-09 12:20:27] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-09 12:20:27] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-09 12:20:27] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 12:20:27] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:20:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-09 12:20:27] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-09 12:20:27] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:20:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 12:20:27] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 12:20:27] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 12:20:27] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 76/76 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 75
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 84 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 83 transition count 74
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 8 place count 83 transition count 69
Reduce places removed 5 places and 0 transitions.
Graph (complete) has 206 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 6 rules applied. Total rules applied 14 place count 76 transition count 69
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 76 transition count 68
Applied a total of 15 rules in 12 ms. Remains 76 /84 variables (removed 8) and now considering 68/76 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 76/84 places, 68/76 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 413 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9277 reset in 145 ms.
Product exploration explored 100000 steps with 9361 reset in 151 ms.
Built C files in :
/tmp/ltsmin15802218263189656886
[2023-03-09 12:20:28] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2023-03-09 12:20:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:20:28] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2023-03-09 12:20:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:20:28] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2023-03-09 12:20:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:20:28] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15802218263189656886
Running compilation step : cd /tmp/ltsmin15802218263189656886;'/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 380 ms.
Running link step : cd /tmp/ltsmin15802218263189656886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin15802218263189656886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1860418244772138009.hoa' '--buchi-type=spotba'
LTSmin run took 9311 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-18-LTLCardinality-04 finished in 14968 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(p1)&&p0)))'
Support contains 4 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 534 transition count 466
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 531 transition count 463
Applied a total of 18 rules in 75 ms. Remains 531 /540 variables (removed 9) and now considering 463/472 (removed 9) transitions.
// Phase 1: matrix 463 rows 531 cols
[2023-03-09 12:20:38] [INFO ] Computed 106 place invariants in 8 ms
[2023-03-09 12:20:38] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-09 12:20:38] [INFO ] Invariant cache hit.
[2023-03-09 12:20:39] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2023-03-09 12:20:39] [INFO ] Invariant cache hit.
[2023-03-09 12:20:39] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 531/540 places, 463/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1442 ms. Remains : 531/540 places, 463/472 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s385 0) (EQ s521 1) (EQ s194 0) (EQ s51 1)), p0:(AND (EQ s521 0) (EQ s385 1) (EQ s51 0) (EQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-07 finished in 1609 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(!p0) U ((p1&&X(!p0))||X(G(!p0)))))||(F(!p1)&&(X(!p0) U ((p1&&X(!p0))||X(G(!p0)))))))'
Support contains 4 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 536 transition count 468
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 535 transition count 467
Applied a total of 10 rules in 35 ms. Remains 535 /540 variables (removed 5) and now considering 467/472 (removed 5) transitions.
// Phase 1: matrix 467 rows 535 cols
[2023-03-09 12:20:39] [INFO ] Computed 106 place invariants in 4 ms
[2023-03-09 12:20:40] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-09 12:20:40] [INFO ] Invariant cache hit.
[2023-03-09 12:20:40] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2023-03-09 12:20:40] [INFO ] Invariant cache hit.
[2023-03-09 12:20:40] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 535/540 places, 467/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1119 ms. Remains : 535/540 places, 467/472 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, p0, p1, p0, p0, p0, (AND p1 p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(OR (EQ s435 0) (EQ s310 1)), p1:(OR (EQ s174 0) (EQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-09 finished in 1339 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(F(p0))||(!p1&&F(p0)&&F(!p2)&&X(!p3)))))'
Support contains 5 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 536 transition count 468
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 535 transition count 467
Applied a total of 10 rules in 27 ms. Remains 535 /540 variables (removed 5) and now considering 467/472 (removed 5) transitions.
// Phase 1: matrix 467 rows 535 cols
[2023-03-09 12:20:41] [INFO ] Computed 106 place invariants in 4 ms
[2023-03-09 12:20:41] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-09 12:20:41] [INFO ] Invariant cache hit.
[2023-03-09 12:20:41] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2023-03-09 12:20:42] [INFO ] Invariant cache hit.
[2023-03-09 12:20:42] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 535/540 places, 467/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1168 ms. Remains : 535/540 places, 467/472 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s310 0) (EQ s483 1)), p0:(NEQ s295 1), p2:(OR (EQ s243 0) (EQ s33 1)), p3:(OR (EQ s295 1) (EQ s310 0) (EQ s483 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 629 reset in 317 ms.
Product exploration explored 100000 steps with 630 reset in 434 ms.
Computed a total of 480 stabilizing places and 422 stable transitions
Graph (complete) has 1205 edges and 535 vertex of which 534 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 480 stabilizing places and 422 stable transitions
Detected a total of 480/535 stabilizing places and 422/467 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X (AND p1 p3)), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p0) p2))), (X p1), (X p0), (X (NOT (AND (NOT p0) p3))), (X (X (AND p1 p3))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1270 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Finished random walk after 1878 steps, including 9 resets, run visited all 9 properties in 13 ms. (steps per millisecond=144 )
Knowledge obtained : [(AND p1 p0 p2 p3), (X (AND p1 p3)), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p0) p2))), (X p1), (X p0), (X (NOT (AND (NOT p0) p3))), (X (X (AND p1 p3))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND p3 (NOT p0))), (F (NOT (AND p1 p3))), (F (AND (NOT p1) p3 p2)), (F (AND (NOT p1) p3)), (F (NOT p1)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (NOT p2))]
Knowledge based reduction with 22 factoid took 1140 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 467/467 transitions.
Applied a total of 0 rules in 10 ms. Remains 535 /535 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2023-03-09 12:20:46] [INFO ] Invariant cache hit.
[2023-03-09 12:20:46] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-09 12:20:46] [INFO ] Invariant cache hit.
[2023-03-09 12:20:47] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2023-03-09 12:20:47] [INFO ] Invariant cache hit.
[2023-03-09 12:20:47] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1019 ms. Remains : 535/535 places, 467/467 transitions.
Computed a total of 480 stabilizing places and 422 stable transitions
Graph (complete) has 1205 edges and 535 vertex of which 534 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 480 stabilizing places and 422 stable transitions
Detected a total of 480/535 stabilizing places and 422/467 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X (AND p1 p3)), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (AND (NOT p0) p2))), (X p1), (X p0), (X (X (AND p1 p3))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 971 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Finished random walk after 3479 steps, including 18 resets, run visited all 9 properties in 22 ms. (steps per millisecond=158 )
Knowledge obtained : [(AND p1 p0 p2 p3), (X (AND p1 p3)), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (AND (NOT p0) p2))), (X p1), (X p0), (X (X (AND p1 p3))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND p3 (NOT p0))), (F (NOT (AND p1 p3))), (F (AND (NOT p1) p3 p2)), (F (AND (NOT p1) p3)), (F (NOT p1)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (NOT p2))]
Knowledge based reduction with 22 factoid took 1170 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 629 reset in 210 ms.
Product exploration explored 100000 steps with 628 reset in 344 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 467/467 transitions.
Graph (trivial) has 250 edges and 535 vertex of which 6 / 535 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 1198 edges and 530 vertex of which 529 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
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 529 transition count 460
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 79 Pre rules applied. Total rules applied 61 place count 529 transition count 524
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 140 place count 529 transition count 524
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 162 place count 507 transition count 483
Deduced a syphon composed of 116 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 184 place count 507 transition count 483
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 293 places in 0 ms
Iterating global reduction 1 with 177 rules applied. Total rules applied 361 place count 507 transition count 483
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 402 place count 466 transition count 442
Deduced a syphon composed of 252 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 443 place count 466 transition count 442
Deduced a syphon composed of 252 places in 0 ms
Applied a total of 443 rules in 158 ms. Remains 466 /535 variables (removed 69) and now considering 442/467 (removed 25) transitions.
[2023-03-09 12:20:51] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 442 rows 466 cols
[2023-03-09 12:20:51] [INFO ] Computed 106 place invariants in 13 ms
[2023-03-09 12:20:52] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 466/535 places, 442/467 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 667 ms. Remains : 466/535 places, 442/467 transitions.
Built C files in :
/tmp/ltsmin349830038901648219
[2023-03-09 12:20:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin349830038901648219
Running compilation step : cd /tmp/ltsmin349830038901648219;'/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 686 ms.
Running link step : cd /tmp/ltsmin349830038901648219;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin349830038901648219;'/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/stateBased16330197546927617163.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 467/467 transitions.
Applied a total of 0 rules in 22 ms. Remains 535 /535 variables (removed 0) and now considering 467/467 (removed 0) transitions.
// Phase 1: matrix 467 rows 535 cols
[2023-03-09 12:21:07] [INFO ] Computed 106 place invariants in 11 ms
[2023-03-09 12:21:07] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-09 12:21:07] [INFO ] Invariant cache hit.
[2023-03-09 12:21:07] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2023-03-09 12:21:07] [INFO ] Invariant cache hit.
[2023-03-09 12:21:08] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 976 ms. Remains : 535/535 places, 467/467 transitions.
Built C files in :
/tmp/ltsmin1851666227547661225
[2023-03-09 12:21:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1851666227547661225
Running compilation step : cd /tmp/ltsmin1851666227547661225;'/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 790 ms.
Running link step : cd /tmp/ltsmin1851666227547661225;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin1851666227547661225;'/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/stateBased109352754536842444.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 12:21:23] [INFO ] Flatten gal took : 21 ms
[2023-03-09 12:21:23] [INFO ] Flatten gal took : 20 ms
[2023-03-09 12:21:23] [INFO ] Time to serialize gal into /tmp/LTL6683475396140852843.gal : 5 ms
[2023-03-09 12:21:23] [INFO ] Time to serialize properties into /tmp/LTL4241450843144389464.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/LTL6683475396140852843.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12437252109491501272.hoa' '-atoms' '/tmp/LTL4241450843144389464.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/LTL4241450843144389464.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12437252109491501272.hoa
Detected timeout of ITS tools.
[2023-03-09 12:21:38] [INFO ] Flatten gal took : 37 ms
[2023-03-09 12:21:38] [INFO ] Flatten gal took : 29 ms
[2023-03-09 12:21:38] [INFO ] Time to serialize gal into /tmp/LTL15653607504487287991.gal : 18 ms
[2023-03-09 12:21:38] [INFO ] Time to serialize properties into /tmp/LTL4572160865238675089.ltl : 19 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/LTL15653607504487287991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4572160865238675089.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...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(p345!=1)")))||((("((p368!=0)&&(p633!=1))")&&((F("(p345!=1)"))&&(F("((p288!=0)&&(p33!=1))"))))&&(X("(((p345!=1)&&(p368!=0))...174
Formula 0 simplified : G(FG!"(p345!=1)" & (!"((p368!=0)&&(p633!=1))" | G!"(p345!=1)" | G!"((p288!=0)&&(p33!=1))" | X!"(((p345!=1)&&(p368!=0))&&(p633!=1))")...156
Detected timeout of ITS tools.
[2023-03-09 12:21:53] [INFO ] Flatten gal took : 19 ms
[2023-03-09 12:21:53] [INFO ] Applying decomposition
[2023-03-09 12:21:53] [INFO ] Flatten gal took : 19 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/graph7730932713107221868.txt' '-o' '/tmp/graph7730932713107221868.bin' '-w' '/tmp/graph7730932713107221868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7730932713107221868.bin' '-l' '-1' '-v' '-w' '/tmp/graph7730932713107221868.weights' '-q' '0' '-e' '0.001'
[2023-03-09 12:21:53] [INFO ] Decomposing Gal with order
[2023-03-09 12:21:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:21:54] [INFO ] Removed a total of 286 redundant transitions.
[2023-03-09 12:21:54] [INFO ] Flatten gal took : 95 ms
[2023-03-09 12:21:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 15 ms.
[2023-03-09 12:21:54] [INFO ] Time to serialize gal into /tmp/LTL6100892002370973506.gal : 10 ms
[2023-03-09 12:21:54] [INFO ] Time to serialize properties into /tmp/LTL9125894313816230276.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6100892002370973506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9125894313816230276.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(i17.i1.u112.p345!=1)")))||((("((i6.i1.u116.p368!=0)&&(i18.u147.p633!=1))")&&((F("(i17.i1.u112.p345!=1)"))&&(F("((i12.i1.u9...272
Formula 0 simplified : G(FG!"(i17.i1.u112.p345!=1)" & (!"((i6.i1.u116.p368!=0)&&(i18.u147.p633!=1))" | G!"(i17.i1.u112.p345!=1)" | G!"((i12.i1.u91.p288!=0)...254
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t285, t311, t315, t355, t372, t375, t448, t449, t453, t455, t457, t460, t463,...1451
Computing Next relation with stutter on 81792 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2341527135866577925
[2023-03-09 12:22:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2341527135866577925
Running compilation step : cd /tmp/ltsmin2341527135866577925;'/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 642 ms.
Running link step : cd /tmp/ltsmin2341527135866577925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2341527135866577925;'/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' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&<>((LTLAPp2==true))&&X((LTLAPp3==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-18-LTLCardinality-11 finished in 103205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Graph (trivial) has 256 edges and 540 vertex of which 6 / 540 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 1205 edges and 535 vertex of which 534 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 533 transition count 401
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 470 transition count 401
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 128 place count 470 transition count 288
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 379 place count 332 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 382 place count 329 transition count 285
Iterating global reduction 2 with 3 rules applied. Total rules applied 385 place count 329 transition count 285
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 680 place count 180 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 682 place count 179 transition count 142
Applied a total of 682 rules in 61 ms. Remains 179 /540 variables (removed 361) and now considering 142/472 (removed 330) transitions.
// Phase 1: matrix 142 rows 179 cols
[2023-03-09 12:22:24] [INFO ] Computed 78 place invariants in 1 ms
[2023-03-09 12:22:24] [INFO ] Implicit Places using invariants in 456 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 13, 14, 15, 16, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 460 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/540 places, 142/472 transitions.
Applied a total of 0 rules in 10 ms. Remains 151 /151 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 531 ms. Remains : 151/540 places, 142/472 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-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:(OR (EQ s2 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13541 reset in 238 ms.
Product exploration explored 100000 steps with 13769 reset in 208 ms.
Computed a total of 128 stabilizing places and 124 stable transitions
Computed a total of 128 stabilizing places and 124 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1684 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 629 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1237 steps, run visited all 1 properties in 17 ms. (steps per millisecond=72 )
Probabilistic random walk after 1237 steps, saw 480 distinct states, run finished after 18 ms. (steps per millisecond=68 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 142/142 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 151 cols
[2023-03-09 12:22:25] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-09 12:22:26] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-09 12:22:26] [INFO ] Invariant cache hit.
[2023-03-09 12:22:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 12:22:26] [INFO ] Implicit Places using invariants and state equation in 368 ms returned [5, 28, 29, 31, 33, 35, 36, 52, 54, 58, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 532 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/151 places, 142/142 transitions.
Graph (complete) has 403 edges and 123 vertex of which 114 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 114 transition count 125
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 101 transition count 125
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 39 place count 89 transition count 86
Iterating global reduction 2 with 12 rules applied. Total rules applied 51 place count 89 transition count 86
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 89 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 57 place count 86 transition count 83
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 83 transition count 80
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 83 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 66 place count 83 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 82 transition count 77
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 77 place count 77 transition count 72
Applied a total of 77 rules in 16 ms. Remains 77 /123 variables (removed 46) and now considering 72/142 (removed 70) transitions.
// Phase 1: matrix 72 rows 77 cols
[2023-03-09 12:22:26] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-09 12:22:26] [INFO ] Implicit Places using invariants in 48 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/151 places, 72/142 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 608 ms. Remains : 74/151 places, 72/142 transitions.
Computed a total of 51 stabilizing places and 54 stable transitions
Computed a total of 51 stabilizing places and 54 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1771 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 592 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3760 steps, run visited all 1 properties in 9 ms. (steps per millisecond=417 )
Probabilistic random walk after 3760 steps, saw 1331 distinct states, run finished after 9 ms. (steps per millisecond=417 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14481 reset in 97 ms.
Product exploration explored 100000 steps with 14296 reset in 104 ms.
Built C files in :
/tmp/ltsmin13615836349714249202
[2023-03-09 12:22:27] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2023-03-09 12:22:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:22:27] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2023-03-09 12:22:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:22:27] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2023-03-09 12:22:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:22:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13615836349714249202
Running compilation step : cd /tmp/ltsmin13615836349714249202;'/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 146 ms.
Running link step : cd /tmp/ltsmin13615836349714249202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin13615836349714249202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9537518392559030985.hoa' '--buchi-type=spotba'
LTSmin run took 280 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-18-LTLCardinality-12 finished in 3332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Graph (trivial) has 255 edges and 540 vertex of which 6 / 540 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 1205 edges and 535 vertex of which 534 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 533 transition count 402
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 471 transition count 402
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 126 place count 471 transition count 290
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 375 place count 334 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 379 place count 330 transition count 286
Iterating global reduction 2 with 4 rules applied. Total rules applied 383 place count 330 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 383 place count 330 transition count 285
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 385 place count 329 transition count 285
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 678 place count 181 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 680 place count 180 transition count 143
Applied a total of 680 rules in 28 ms. Remains 180 /540 variables (removed 360) and now considering 143/472 (removed 329) transitions.
// Phase 1: matrix 143 rows 180 cols
[2023-03-09 12:22:27] [INFO ] Computed 78 place invariants in 1 ms
[2023-03-09 12:22:28] [INFO ] Implicit Places using invariants in 475 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 477 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/540 places, 143/472 transitions.
Applied a total of 0 rules in 4 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 509 ms. Remains : 152/540 places, 143/472 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s70 0) (EQ s38 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 56 steps with 5 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-14 finished in 577 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(F(p0))||(!p1&&F(p0)&&F(!p2)&&X(!p3)))))'
Found a Shortening insensitive property : BusinessProcesses-PT-18-LTLCardinality-11
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Support contains 5 out of 540 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Graph (trivial) has 255 edges and 540 vertex of which 6 / 540 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 1205 edges and 535 vertex of which 534 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 533 transition count 402
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 471 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 470 transition count 401
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 128 place count 470 transition count 287
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 381 place count 331 transition count 287
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 384 place count 328 transition count 284
Iterating global reduction 3 with 3 rules applied. Total rules applied 387 place count 328 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 387 place count 328 transition count 283
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 389 place count 327 transition count 283
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 281 rules applied. Total rules applied 670 place count 185 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 672 place count 184 transition count 147
Applied a total of 672 rules in 36 ms. Remains 184 /540 variables (removed 356) and now considering 147/472 (removed 325) transitions.
// Phase 1: matrix 147 rows 184 cols
[2023-03-09 12:22:28] [INFO ] Computed 78 place invariants in 1 ms
[2023-03-09 12:22:28] [INFO ] Implicit Places using invariants in 110 ms returned [7, 8, 9, 10, 13, 14, 15, 16, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 124 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 161/540 places, 147/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 164 ms. Remains : 161/540 places, 147/472 transitions.
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s48 0) (EQ s131 1)), p0:(NEQ s40 1), p2:(OR (EQ s32 0) (EQ s2 1)), p3:(OR (EQ s40 1) (EQ s48 0) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
Treatment of property BusinessProcesses-PT-18-LTLCardinality-11 finished in 475 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-09 12:22:28] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4910160247911183269
[2023-03-09 12:22:28] [INFO ] Computing symmetric may disable matrix : 472 transitions.
[2023-03-09 12:22:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:22:28] [INFO ] Computing symmetric may enable matrix : 472 transitions.
[2023-03-09 12:22:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:22:28] [INFO ] Applying decomposition
[2023-03-09 12:22:28] [INFO ] Flatten gal took : 40 ms
[2023-03-09 12:22:28] [INFO ] Computing Do-Not-Accords matrix : 472 transitions.
[2023-03-09 12:22:28] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:22:28] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4910160247911183269
Running compilation step : cd /tmp/ltsmin4910160247911183269;'/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/graph14608398322629992632.txt' '-o' '/tmp/graph14608398322629992632.bin' '-w' '/tmp/graph14608398322629992632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14608398322629992632.bin' '-l' '-1' '-v' '-w' '/tmp/graph14608398322629992632.weights' '-q' '0' '-e' '0.001'
[2023-03-09 12:22:28] [INFO ] Decomposing Gal with order
[2023-03-09 12:22:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:22:29] [INFO ] Removed a total of 286 redundant transitions.
[2023-03-09 12:22:29] [INFO ] Flatten gal took : 44 ms
[2023-03-09 12:22:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 11 ms.
[2023-03-09 12:22:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality15974444991516039003.gal : 8 ms
[2023-03-09 12:22:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality2240558903762953382.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/LTLCardinality15974444991516039003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2240558903762953382.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(i11.i0.u114.p345!=1)")))||(((!("((i13.i2.u118.p368==0)||(i17.u151.p633==1))"))&&(F("(i11.i0.u114.p345!=1)")))&&((F(!("((i0...279
Formula 0 simplified : G(FG!"(i11.i0.u114.p345!=1)" & ("((i13.i2.u118.p368==0)||(i17.u151.p633==1))" | G!"(i11.i0.u114.p345!=1)" | G"((i0.i2.u92.p288==0)||...249
Compilation finished in 1219 ms.
Running link step : cd /tmp/ltsmin4910160247911183269;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin4910160247911183269;'/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' '<>(([](<>((LTLAPp0==true)))||(!(LTLAPp1==true)&&<>((LTLAPp0==true))&&<>(!(LTLAPp2==true))&&X(!(LTLAPp3==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t285, t303, t307, t315, t355, t372, t375, t448, t453, t455, t457, t460, t462,...1516
Computing Next relation with stutter on 81792 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: LTL layer: formula: <>(([](<>((LTLAPp0==true)))||(!(LTLAPp1==true)&&<>((LTLAPp0==true))&&<>(!(LTLAPp2==true))&&X(!(LTLAPp3==true)))))
pins2lts-mc-linux64( 4/ 8), 0.038: "<>(([](<>((LTLAPp0==true)))||(!(LTLAPp1==true)&&<>((LTLAPp0==true))&&<>(!(LTLAPp2==true))&&X(!(LTLAPp3==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.038: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.047: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.047: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.096: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.322: DFS-FIFO for weak LTL, using special progress label 477
pins2lts-mc-linux64( 0/ 8), 0.322: There are 478 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.322: State length is 541, there are 484 groups
pins2lts-mc-linux64( 0/ 8), 0.322: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.322: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.322: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.322: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.616: ~1 levels ~960 states ~4576 transitions
pins2lts-mc-linux64( 4/ 8), 0.694: ~1 levels ~1920 states ~12824 transitions
pins2lts-mc-linux64( 4/ 8), 0.810: ~1 levels ~3840 states ~26296 transitions
pins2lts-mc-linux64( 4/ 8), 1.026: ~1 levels ~7680 states ~54272 transitions
pins2lts-mc-linux64( 4/ 8), 1.596: ~1 levels ~15360 states ~112208 transitions
pins2lts-mc-linux64( 4/ 8), 2.849: ~1 levels ~30720 states ~244808 transitions
pins2lts-mc-linux64( 4/ 8), 5.059: ~1 levels ~61440 states ~527320 transitions
pins2lts-mc-linux64( 4/ 8), 9.830: ~1 levels ~122880 states ~1132392 transitions
pins2lts-mc-linux64( 4/ 8), 18.015: ~1 levels ~245760 states ~2364808 transitions
pins2lts-mc-linux64( 4/ 8), 33.748: ~1 levels ~491520 states ~4907704 transitions
pins2lts-mc-linux64( 4/ 8), 56.491: ~1 levels ~983040 states ~10426856 transitions
pins2lts-mc-linux64( 1/ 8), 82.839: ~1 levels ~1966080 states ~22328024 transitions
pins2lts-mc-linux64( 1/ 8), 133.599: ~1 levels ~3932160 states ~46914704 transitions
pins2lts-mc-linux64( 1/ 8), 222.637: ~1 levels ~7864320 states ~98961104 transitions
pins2lts-mc-linux64( 1/ 8), 388.938: ~1 levels ~15728640 states ~205423680 transitions
pins2lts-mc-linux64( 5/ 8), 461.184: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 461.230:
pins2lts-mc-linux64( 0/ 8), 461.230: mean standard work distribution: 14.3% (states) 13.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 461.230:
pins2lts-mc-linux64( 0/ 8), 461.230: Explored 15485638 states 207964310 transitions, fanout: 13.429
pins2lts-mc-linux64( 0/ 8), 461.230: Total exploration time 460.890 sec (460.830 sec minimum, 460.859 sec on average)
pins2lts-mc-linux64( 0/ 8), 461.230: States per second: 33599, Transitions per second: 451223
pins2lts-mc-linux64( 0/ 8), 461.230:
pins2lts-mc-linux64( 0/ 8), 461.230: Progress states detected: 29786457
pins2lts-mc-linux64( 0/ 8), 461.230: Redundant explorations: -48.0112
pins2lts-mc-linux64( 0/ 8), 461.230:
pins2lts-mc-linux64( 0/ 8), 461.230: Queue width: 8B, total height: 25268901, memory: 192.79MB
pins2lts-mc-linux64( 0/ 8), 461.230: Tree memory: 483.3MB, 17.0 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 461.230: Tree fill ratio (roots/leafs): 22.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 461.230: Stored 476 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 461.230: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 461.230: Est. total memory use: 676.0MB (~1216.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4910160247911183269;'/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' '<>(([](<>((LTLAPp0==true)))||(!(LTLAPp1==true)&&<>((LTLAPp0==true))&&<>(!(LTLAPp2==true))&&X(!(LTLAPp3==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4910160247911183269;'/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' '<>(([](<>((LTLAPp0==true)))||(!(LTLAPp1==true)&&<>((LTLAPp0==true))&&<>(!(LTLAPp2==true))&&X(!(LTLAPp3==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
75486 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,754.972,11829588,1,0,1.77989e+07,814,3683,1.49268e+07,156,2690,29349
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-18-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1147312 ms.

BK_STOP 1678365561576

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -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-18"
export BK_EXAMINATION="LTLCardinality"
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-18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690600587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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