Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500411.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500411
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 146K May 10 09:33 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-12-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652630155416

Running Version 202205111006
[2022-05-15 15:55:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 15:55:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:55:56] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2022-05-15 15:55:56] [INFO ] Transformed 586 places.
[2022-05-15 15:55:56] [INFO ] Transformed 525 transitions.
[2022-05-15 15:55:56] [INFO ] Found NUPN structural information;
[2022-05-15 15:55:56] [INFO ] Parsed PT model containing 586 places and 525 transitions in 211 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 5 formulas.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-12-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 82 place count 500 transition count 442
Iterating global reduction 1 with 79 rules applied. Total rules applied 161 place count 500 transition count 442
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 198 place count 463 transition count 405
Iterating global reduction 1 with 37 rules applied. Total rules applied 235 place count 463 transition count 405
Applied a total of 235 rules in 108 ms. Remains 463 /582 variables (removed 119) and now considering 405/521 (removed 116) transitions.
// Phase 1: matrix 405 rows 463 cols
[2022-05-15 15:55:57] [INFO ] Computed 95 place invariants in 29 ms
[2022-05-15 15:55:57] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 405 rows 463 cols
[2022-05-15 15:55:57] [INFO ] Computed 95 place invariants in 10 ms
[2022-05-15 15:55:57] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
// Phase 1: matrix 405 rows 463 cols
[2022-05-15 15:55:57] [INFO ] Computed 95 place invariants in 11 ms
[2022-05-15 15:55:58] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/582 places, 405/521 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/582 places, 405/521 transitions.
Support contains 35 out of 463 places after structural reductions.
[2022-05-15 15:55:58] [INFO ] Flatten gal took : 59 ms
[2022-05-15 15:55:58] [INFO ] Flatten gal took : 29 ms
[2022-05-15 15:55:58] [INFO ] Input system was already deterministic with 405 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 405 rows 463 cols
[2022-05-15 15:56:00] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 15:56:00] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 15:56:00] [INFO ] [Nat]Absence check using 52 positive place invariants in 28 ms returned sat
[2022-05-15 15:56:00] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 13 ms returned sat
[2022-05-15 15:56:01] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2022-05-15 15:56:01] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 5 ms to minimize.
[2022-05-15 15:56:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-15 15:56:01] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2022-05-15 15:56:01] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2022-05-15 15:56:01] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 1 ms to minimize.
[2022-05-15 15:56:02] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 1 ms to minimize.
[2022-05-15 15:56:02] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2022-05-15 15:56:02] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2022-05-15 15:56:02] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 1 ms to minimize.
[2022-05-15 15:56:02] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 0 ms to minimize.
[2022-05-15 15:56:02] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2022-05-15 15:56:02] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2022-05-15 15:56:02] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2022-05-15 15:56:02] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2022-05-15 15:56:02] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2022-05-15 15:56:03] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2022-05-15 15:56:03] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2022-05-15 15:56:03] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2022-05-15 15:56:03] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2022-05-15 15:56:03] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2022-05-15 15:56:03] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2022-05-15 15:56:03] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2022-05-15 15:56:03] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2022-05-15 15:56:03] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1962 ms
[2022-05-15 15:56:03] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 1 ms to minimize.
[2022-05-15 15:56:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-15 15:56:03] [INFO ] After 2783ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 163 ms.
[2022-05-15 15:56:03] [INFO ] After 3184ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 2 properties in 91 ms.
Support contains 11 out of 463 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 463/463 places, 405/405 transitions.
Graph (trivial) has 204 edges and 463 vertex of which 7 / 463 are part of one of the 1 SCC in 636 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1037 edges and 457 vertex of which 456 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 456 transition count 352
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 412 transition count 352
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 90 place count 412 transition count 256
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 299 place count 299 transition count 256
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 301 place count 297 transition count 254
Iterating global reduction 2 with 2 rules applied. Total rules applied 303 place count 297 transition count 254
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 541 place count 176 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 543 place count 175 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 545 place count 175 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 547 place count 173 transition count 139
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 551 place count 173 transition count 139
Applied a total of 551 rules in 718 ms. Remains 173 /463 variables (removed 290) and now considering 139/405 (removed 266) transitions.
Finished structural reductions, in 1 iterations. Remains : 173/463 places, 139/405 transitions.
Incomplete random walk after 10000 steps, including 326 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 139 rows 173 cols
[2022-05-15 15:56:04] [INFO ] Computed 74 place invariants in 3 ms
[2022-05-15 15:56:04] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:56:04] [INFO ] [Nat]Absence check using 53 positive place invariants in 6 ms returned sat
[2022-05-15 15:56:04] [INFO ] [Nat]Absence check using 53 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-15 15:56:04] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 15:56:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 15:56:04] [INFO ] After 9ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 15:56:05] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 15:56:05] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 447 stabilizing places and 389 stable transitions
Graph (complete) has 1045 edges and 463 vertex of which 462 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p0)))'
Support contains 2 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 455 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 455 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 454 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 454 transition count 396
Applied a total of 18 rules in 21 ms. Remains 454 /463 variables (removed 9) and now considering 396/405 (removed 9) transitions.
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:56:05] [INFO ] Computed 95 place invariants in 7 ms
[2022-05-15 15:56:05] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:56:05] [INFO ] Computed 95 place invariants in 5 ms
[2022-05-15 15:56:05] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:56:05] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 15:56:06] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/463 places, 396/405 transitions.
Finished structural reductions, in 1 iterations. Remains : 454/463 places, 396/405 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s194 0) (EQ s185 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 447 ms.
Product exploration explored 100000 steps with 50000 reset in 349 ms.
Computed a total of 439 stabilizing places and 381 stable transitions
Graph (complete) has 1032 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 439 stabilizing places and 381 stable transitions
Detected a total of 439/454 stabilizing places and 381/396 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-12-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLCardinality-01 finished in 1957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(F(p0)&&p1) U p2)))'
Support contains 10 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 405/405 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 459 transition count 401
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 459 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 458 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 458 transition count 400
Applied a total of 10 rules in 29 ms. Remains 458 /463 variables (removed 5) and now considering 400/405 (removed 5) transitions.
// Phase 1: matrix 400 rows 458 cols
[2022-05-15 15:56:07] [INFO ] Computed 95 place invariants in 7 ms
[2022-05-15 15:56:07] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 400 rows 458 cols
[2022-05-15 15:56:07] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 15:56:07] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 458 cols
[2022-05-15 15:56:07] [INFO ] Computed 95 place invariants in 12 ms
[2022-05-15 15:56:08] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 458/463 places, 400/405 transitions.
Finished structural reductions, in 1 iterations. Remains : 458/463 places, 400/405 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), true, p0]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (OR (EQ s210 0) (EQ s298 1)) (OR (EQ s56 0) (EQ s364 1))), p1:(OR (NOT (OR (EQ s62 0) (EQ s392 1))) (EQ s374 0) (EQ s127 1)), p0:(OR (EQ s381 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Product exploration explored 100000 steps with 50000 reset in 369 ms.
Computed a total of 443 stabilizing places and 385 stable transitions
Graph (complete) has 1040 edges and 458 vertex of which 457 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 443 stabilizing places and 385 stable transitions
Detected a total of 443/458 stabilizing places and 385/400 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0)))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 p1 p0)
Knowledge based reduction with 12 factoid took 2034 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-12-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLCardinality-03 finished in 3803 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 405/405 transitions.
Graph (trivial) has 213 edges and 463 vertex of which 7 / 463 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1038 edges and 457 vertex of which 456 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 455 transition count 348
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 407 transition count 348
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 98 place count 407 transition count 251
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 310 place count 292 transition count 251
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 315 place count 287 transition count 246
Iterating global reduction 2 with 5 rules applied. Total rules applied 320 place count 287 transition count 246
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 564 place count 163 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 566 place count 162 transition count 130
Applied a total of 566 rules in 54 ms. Remains 162 /463 variables (removed 301) and now considering 130/405 (removed 275) transitions.
// Phase 1: matrix 130 rows 162 cols
[2022-05-15 15:56:11] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 15:56:11] [INFO ] Implicit Places using invariants in 108 ms returned [1, 2, 5, 6, 30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 109 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/463 places, 130/405 transitions.
Applied a total of 0 rules in 7 ms. Remains 143 /143 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 143/463 places, 130/405 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21741 reset in 264 ms.
Product exploration explored 100000 steps with 21734 reset in 256 ms.
Computed a total of 134 stabilizing places and 122 stable transitions
Computed a total of 134 stabilizing places and 122 stable transitions
Detected a total of 134/143 stabilizing places and 122/130 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2431 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 729 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 492 steps, run visited all 1 properties in 10 ms. (steps per millisecond=49 )
Probabilistic random walk after 492 steps, saw 224 distinct states, run finished after 10 ms. (steps per millisecond=49 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 130/130 transitions.
Applied a total of 0 rules in 12 ms. Remains 143 /143 variables (removed 0) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 143 cols
[2022-05-15 15:56:12] [INFO ] Computed 54 place invariants in 3 ms
[2022-05-15 15:56:12] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 130 rows 143 cols
[2022-05-15 15:56:12] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-15 15:56:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 15:56:12] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [3, 26, 28, 30, 32, 37, 44, 46, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 295 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/143 places, 130/130 transitions.
Graph (complete) has 380 edges and 114 vertex of which 102 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.12 ms
Discarding 12 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 102 transition count 113
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 90 transition count 113
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 35 place count 80 transition count 78
Iterating global reduction 2 with 10 rules applied. Total rules applied 45 place count 80 transition count 78
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 80 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 79 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 49 place count 77 transition count 75
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 77 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 65 place count 69 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 68 transition count 68
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 68 transition count 67
Applied a total of 68 rules in 26 ms. Remains 68 /114 variables (removed 46) and now considering 67/130 (removed 63) transitions.
// Phase 1: matrix 67 rows 68 cols
[2022-05-15 15:56:12] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-15 15:56:12] [INFO ] Implicit Places using invariants in 45 ms returned [3, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/143 places, 67/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 66/143 places, 67/130 transitions.
Computed a total of 57 stabilizing places and 59 stable transitions
Graph (complete) has 220 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 57 stabilizing places and 59 stable transitions
Detected a total of 57/66 stabilizing places and 59/67 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2554 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 778 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 264 steps, run visited all 1 properties in 5 ms. (steps per millisecond=52 )
Probabilistic random walk after 264 steps, saw 136 distinct states, run finished after 5 ms. (steps per millisecond=52 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22296 reset in 133 ms.
Product exploration explored 100000 steps with 22198 reset in 88 ms.
Built C files in :
/tmp/ltsmin2067195840798185217
[2022-05-15 15:56:13] [INFO ] Computing symmetric may disable matrix : 67 transitions.
[2022-05-15 15:56:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:56:13] [INFO ] Computing symmetric may enable matrix : 67 transitions.
[2022-05-15 15:56:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:56:13] [INFO ] Computing Do-Not-Accords matrix : 67 transitions.
[2022-05-15 15:56:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:56:13] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2067195840798185217
Running compilation step : cd /tmp/ltsmin2067195840798185217;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1812 ms.
Running link step : cd /tmp/ltsmin2067195840798185217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2067195840798185217;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12692552809954185216.hoa' '--buchi-type=spotba'
LTSmin run took 72 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-12-LTLCardinality-04 finished in 4655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(p1))))'
Support contains 4 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 455 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 455 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 454 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 454 transition count 396
Applied a total of 18 rules in 27 ms. Remains 454 /463 variables (removed 9) and now considering 396/405 (removed 9) transitions.
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:56:15] [INFO ] Computed 95 place invariants in 6 ms
[2022-05-15 15:56:15] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:56:15] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 15:56:16] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:56:16] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 15:56:16] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/463 places, 396/405 transitions.
Finished structural reductions, in 1 iterations. Remains : 454/463 places, 396/405 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s241 0) (EQ s29 1)), p1:(OR (EQ s167 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 259 ms.
Product exploration explored 100000 steps with 33333 reset in 257 ms.
Computed a total of 439 stabilizing places and 381 stable transitions
Graph (complete) has 1032 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 439 stabilizing places and 381 stable transitions
Detected a total of 439/454 stabilizing places and 381/396 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 7 factoid took 143 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-12-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLCardinality-06 finished in 1888 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(!(X(p0) U p1))))))'
Support contains 4 out of 463 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 405/405 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 456 transition count 398
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 456 transition count 398
Applied a total of 14 rules in 22 ms. Remains 456 /463 variables (removed 7) and now considering 398/405 (removed 7) transitions.
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:56:17] [INFO ] Computed 95 place invariants in 31 ms
[2022-05-15 15:56:17] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:56:17] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 15:56:18] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:56:18] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 15:56:18] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 456/463 places, 398/405 transitions.
Finished structural reductions, in 1 iterations. Remains : 456/463 places, 398/405 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, p1, p1, p1]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (EQ s345 0) (EQ s247 1)) (NOT (OR (EQ s35 0) (EQ s133 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 52837 steps with 383 reset in 163 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-10 finished in 1225 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((p0 U p1))||X(p2)))))'
Support contains 5 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 405/405 transitions.
Graph (trivial) has 211 edges and 463 vertex of which 7 / 463 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1038 edges and 457 vertex of which 456 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 455 transition count 350
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 409 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 408 transition count 349
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 96 place count 408 transition count 252
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 308 place count 293 transition count 252
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 313 place count 288 transition count 247
Iterating global reduction 3 with 5 rules applied. Total rules applied 318 place count 288 transition count 247
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 554 place count 168 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 556 place count 167 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 557 place count 166 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 558 place count 165 transition count 134
Applied a total of 558 rules in 44 ms. Remains 165 /463 variables (removed 298) and now considering 134/405 (removed 271) transitions.
// Phase 1: matrix 134 rows 165 cols
[2022-05-15 15:56:18] [INFO ] Computed 72 place invariants in 1 ms
[2022-05-15 15:56:18] [INFO ] Implicit Places using invariants in 109 ms returned [49, 50, 51, 52, 53, 54]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 109 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/463 places, 134/405 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 159/463 places, 134/405 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s48 0) (EQ s1 1)), p1:(OR (EQ s82 0) (EQ s137 1)), p0:(EQ s96 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12575 reset in 302 ms.
Product exploration explored 100000 steps with 12600 reset in 277 ms.
Computed a total of 159 stabilizing places and 133 stable transitions
Computed a total of 159 stabilizing places and 133 stable transitions
Detected a total of 159/159 stabilizing places and 133/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND p2 p1) (AND p2 p0))), (X (NOT (OR (AND p2 p1) (AND p2 p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (NOT (OR (AND p2 p1) (AND p2 p0))))), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
Knowledge based reduction with 12 factoid took 573 ms. Reduced automaton from 2 states, 10 edges and 3 AP to 2 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1351 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 359 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 361 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 134 rows 159 cols
[2022-05-15 15:56:20] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-15 15:56:20] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 15:56:20] [INFO ] [Nat]Absence check using 46 positive place invariants in 6 ms returned sat
[2022-05-15 15:56:20] [INFO ] [Nat]Absence check using 46 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-15 15:56:20] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 15:56:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 15:56:20] [INFO ] After 12ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-15 15:56:20] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 15:56:20] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (OR (AND p2 p1) (AND p2 p0))), (X (NOT (OR (AND p2 p1) (AND p2 p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (NOT (OR (AND p2 p1) (AND p2 p0))))), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (OR (AND p2 p0) (AND p2 p1)))), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (F (AND p2 (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 704 ms. Reduced automaton from 2 states, 10 edges and 3 AP to 2 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 134/134 transitions.
Applied a total of 0 rules in 10 ms. Remains 159 /159 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 159 cols
[2022-05-15 15:56:21] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-15 15:56:21] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 134 rows 159 cols
[2022-05-15 15:56:21] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-15 15:56:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 15:56:22] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [50, 57, 59, 65, 67, 69, 71, 73, 75, 77, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 313 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/159 places, 134/134 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 136 transition count 125
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 127 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 126 transition count 123
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 126 transition count 123
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 114 transition count 115
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 112 transition count 113
Applied a total of 44 rules in 13 ms. Remains 112 /136 variables (removed 24) and now considering 113/134 (removed 21) transitions.
// Phase 1: matrix 113 rows 112 cols
[2022-05-15 15:56:22] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-15 15:56:22] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 113 rows 112 cols
[2022-05-15 15:56:22] [INFO ] Computed 39 place invariants in 0 ms
[2022-05-15 15:56:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-15 15:56:22] [INFO ] Implicit Places using invariants and state equation in 159 ms returned [6, 7, 8, 30, 31, 32, 33, 34, 36, 38, 40, 41, 42]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 233 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/159 places, 113/134 transitions.
Graph (complete) has 373 edges and 99 vertex of which 90 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
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 81 transition count 73
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 81 transition count 73
Applied a total of 19 rules in 6 ms. Remains 81 /99 variables (removed 18) and now considering 73/113 (removed 40) transitions.
// Phase 1: matrix 73 rows 81 cols
[2022-05-15 15:56:22] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-15 15:56:22] [INFO ] Implicit Places using invariants in 55 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 78/159 places, 73/134 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions, in 4 iterations. Remains : 78/159 places, 73/134 transitions.
Computed a total of 78 stabilizing places and 72 stable transitions
Computed a total of 78 stabilizing places and 72 stable transitions
Detected a total of 78/78 stabilizing places and 72/73 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2)))))]
Knowledge based reduction with 10 factoid took 519 ms. Reduced automaton from 2 states, 8 edges and 3 AP to 2 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1390 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 459 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 378 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 73 rows 78 cols
[2022-05-15 15:56:23] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-15 15:56:23] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 15:56:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-15 15:56:23] [INFO ] [Nat]Absence check using 13 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 15:56:23] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 15:56:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 15:56:23] [INFO ] After 9ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 15:56:23] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2022-05-15 15:56:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-15 15:56:23] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 15:56:23] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 22 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 10 factoid took 608 ms. Reduced automaton from 2 states, 8 edges and 3 AP to 2 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 595 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering criterion allowed to conclude after 54227 steps with 6941 reset in 83 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-13 finished in 6026 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p1)||p2)&&p0))))'
Support contains 6 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 455 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 455 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 454 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 454 transition count 396
Applied a total of 18 rules in 30 ms. Remains 454 /463 variables (removed 9) and now considering 396/405 (removed 9) transitions.
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:56:24] [INFO ] Computed 95 place invariants in 9 ms
[2022-05-15 15:56:24] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:56:24] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 15:56:25] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:56:25] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 15:56:25] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/463 places, 396/405 transitions.
Finished structural reductions, in 1 iterations. Remains : 454/463 places, 396/405 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s247 0) (NEQ s238 1)), p2:(AND (NEQ s258 0) (NEQ s369 1)), p1:(AND (NEQ s193 0) (NEQ s394 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-14 finished in 1110 ms.
All properties solved by simple procedures.
Total runtime 29356 ms.

BK_STOP 1652630185939

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-12"
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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-12, 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 r024-tall-165251918500411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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