MCC'2022- Execution of r132-tall-165271820800387

About the Execution of ITS-Tools for LamportFastMutEx-COL-8

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
560.827	41940.00	64086.00	2263.70	FFFFFFTFTTTFFFTF	normal

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.r132-tall-165271820800387.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 LamportFastMutEx-COL-8, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820800387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 8.8K Apr 29 19:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 29 19:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 19:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 19:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 44K May 10 09:34 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 LamportFastMutEx-COL-8-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652782104459

Running Version 202205111006
[2022-05-17 10:08:25] [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-17 10:08:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 10:08:25] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 10:08:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 10:08:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 623 ms
[2022-05-17 10:08:26] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-8-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 10:08:26] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 10 ms.
[2022-05-17 10:08:26] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 245 steps, including 0 resets, run visited all 19 properties in 19 ms. (steps per millisecond=12 )
[2022-05-17 10:08:26] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-17 10:08:26] [INFO ] Flatten gal took : 15 ms
FORMULA LamportFastMutEx-COL-8-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 10:08:26] [INFO ] Flatten gal took : 3 ms
Domain [pid(9), pid(9)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 10:08:26] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 30 ms.
[2022-05-17 10:08:26] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Support contains 224 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 16 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2022-05-17 10:08:26] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2022-05-17 10:08:26] [INFO ] Computed 82 place invariants in 27 ms
[2022-05-17 10:08:27] [INFO ] Implicit Places using invariants in 264 ms returned []
[2022-05-17 10:08:27] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2022-05-17 10:08:27] [INFO ] Computed 82 place invariants in 6 ms
[2022-05-17 10:08:27] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-17 10:08:27] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2022-05-17 10:08:27] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2022-05-17 10:08:27] [INFO ] Computed 82 place invariants in 4 ms
[2022-05-17 10:08:27] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Support contains 224 out of 266 places after structural reductions.
[2022-05-17 10:08:27] [INFO ] Flatten gal took : 48 ms
[2022-05-17 10:08:27] [INFO ] Flatten gal took : 41 ms
[2022-05-17 10:08:27] [INFO ] Input system was already deterministic with 584 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-17 10:08:28] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2022-05-17 10:08:28] [INFO ] Computed 82 place invariants in 8 ms
[2022-05-17 10:08:28] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2022-05-17 10:08:28] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 10:08:28] [INFO ] [Nat]Absence check using 82 positive place invariants in 22 ms returned sat
[2022-05-17 10:08:28] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 10:08:28] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-17 10:08:28] [INFO ] After 65ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 10:08:28] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 4 ms to minimize.
[2022-05-17 10:08:28] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2022-05-17 10:08:29] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2022-05-17 10:08:29] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2022-05-17 10:08:29] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2022-05-17 10:08:29] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2022-05-17 10:08:29] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2022-05-17 10:08:29] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2022-05-17 10:08:29] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2022-05-17 10:08:29] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:08:29] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:08:30] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2022-05-17 10:08:30] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2022-05-17 10:08:30] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:08:30] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2022-05-17 10:08:30] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:08:30] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2022-05-17 10:08:30] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:08:30] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:08:30] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2022-05-17 10:08:31] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:08:31] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:08:31] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:08:31] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:08:31] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:08:31] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:08:31] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2022-05-17 10:08:31] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:08:31] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3220 ms
[2022-05-17 10:08:32] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:08:32] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:08:32] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2022-05-17 10:08:32] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:08:32] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2022-05-17 10:08:32] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:08:32] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2022-05-17 10:08:32] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:08:32] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:08:33] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2022-05-17 10:08:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1136 ms
[2022-05-17 10:08:33] [INFO ] After 4483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-05-17 10:08:33] [INFO ] After 4747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 8 out of 266 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 258 transition count 568
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 250 transition count 568
Applied a total of 32 rules in 76 ms. Remains 250 /266 variables (removed 16) and now considering 568/584 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/266 places, 568/584 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 407481 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407481 steps, saw 214944 distinct states, run finished after 3002 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-17 10:08:36] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2022-05-17 10:08:36] [INFO ] Computed 82 place invariants in 6 ms
[2022-05-17 10:08:36] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2022-05-17 10:08:36] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 10:08:36] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2022-05-17 10:08:36] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 10:08:36] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-17 10:08:36] [INFO ] After 68ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 10:08:36] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2022-05-17 10:08:37] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2022-05-17 10:08:37] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2022-05-17 10:08:37] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-05-17 10:08:37] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 1 ms to minimize.
[2022-05-17 10:08:37] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2022-05-17 10:08:37] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:08:37] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 0 ms to minimize.
[2022-05-17 10:08:38] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2022-05-17 10:08:38] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2022-05-17 10:08:38] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:08:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1490 ms
[2022-05-17 10:08:38] [INFO ] After 1622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2022-05-17 10:08:38] [INFO ] After 1867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 18 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 568/568 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2022-05-17 10:08:38] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2022-05-17 10:08:38] [INFO ] Computed 82 place invariants in 5 ms
[2022-05-17 10:08:38] [INFO ] Implicit Places using invariants in 245 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 247 ms to find 8 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 242/250 places, 568/568 transitions.
Applied a total of 0 rules in 16 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 242/250 places, 568/568 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 454888 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 454888 steps, saw 238607 distinct states, run finished after 3002 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-17 10:08:41] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2022-05-17 10:08:41] [INFO ] Computed 74 place invariants in 7 ms
[2022-05-17 10:08:41] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2022-05-17 10:08:42] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 10:08:42] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2022-05-17 10:08:42] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 10:08:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-17 10:08:42] [INFO ] After 43ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 10:08:42] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2022-05-17 10:08:42] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 0 ms to minimize.
[2022-05-17 10:08:42] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2022-05-17 10:08:42] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2022-05-17 10:08:42] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 13 ms to minimize.
[2022-05-17 10:08:43] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2022-05-17 10:08:43] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2022-05-17 10:08:43] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:08:43] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:08:43] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:08:43] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:08:43] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2022-05-17 10:08:43] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2022-05-17 10:08:43] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2022-05-17 10:08:44] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2022-05-17 10:08:44] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2022-05-17 10:08:44] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 4 ms to minimize.
[2022-05-17 10:08:44] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:08:44] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:08:44] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:08:44] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:08:44] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:08:44] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:08:45] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:08:45] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:08:45] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2022-05-17 10:08:45] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:08:45] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:08:45] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:08:45] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:08:45] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2022-05-17 10:08:45] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2022-05-17 10:08:46] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2022-05-17 10:08:46] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:08:46] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:08:46] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:08:46] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:08:46] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2022-05-17 10:08:46] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:08:46] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:08:46] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:08:47] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:08:47] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2022-05-17 10:08:47] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 4844 ms
[2022-05-17 10:08:47] [INFO ] After 4936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-17 10:08:47] [INFO ] After 5167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2022-05-17 10:08:47] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2022-05-17 10:08:47] [INFO ] Computed 74 place invariants in 4 ms
[2022-05-17 10:08:47] [INFO ] Implicit Places using invariants in 191 ms returned []
[2022-05-17 10:08:47] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2022-05-17 10:08:47] [INFO ] Computed 74 place invariants in 2 ms
[2022-05-17 10:08:47] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-17 10:08:47] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2022-05-17 10:08:47] [INFO ] Redundant transitions in 59 ms returned []
[2022-05-17 10:08:47] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2022-05-17 10:08:47] [INFO ] Computed 74 place invariants in 4 ms
[2022-05-17 10:08:48] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 242/242 places, 568/568 transitions.
Graph (trivial) has 248 edges and 242 vertex of which 40 / 242 are part of one of the 8 SCC in 3 ms
Free SCC test removed 32 places
Drop transitions removed 96 transitions
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 208 transitions.
Graph (complete) has 712 edges and 210 vertex of which 201 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 201 transition count 296
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 66 place count 201 transition count 232
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 250 place count 81 transition count 232
Graph (trivial) has 48 edges and 81 vertex of which 40 / 81 are part of one of the 8 SCC in 0 ms
Free SCC test removed 32 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 251 place count 49 transition count 232
Drop transitions removed 40 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 307 place count 49 transition count 176
Applied a total of 307 rules in 33 ms. Remains 49 /242 variables (removed 193) and now considering 176/568 (removed 392) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 176 rows 49 cols
[2022-05-17 10:08:48] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:08:48] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2022-05-17 10:08:48] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 10:08:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2022-05-17 10:08:48] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 10:08:48] [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 17 ms.
[2022-05-17 10:08:48] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-17 10:08:48] [INFO ] Flatten gal took : 10 ms
[2022-05-17 10:08:48] [INFO ] Flatten gal took : 10 ms
[2022-05-17 10:08:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16386470473715792470.gal : 9 ms
[2022-05-17 10:08:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18119414522167960569.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14935436739425662468;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16386470473715792470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18119414522167960569.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality18119414522167960569.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
Reachability property AtomicPropp18 is true.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :8 after 72
Reachability property AtomicPropp17 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 5 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,216,0.035404,5028,2,62,9,506,6,0,375,269,0
Total reachable state count : 216

Verifying 2 reachability properties.
Reachability property AtomicPropp17 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp17,8,0.035972,5028,2,53,9,506,7,0,387,269,0
Reachability property AtomicPropp18 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp18,8,0.036343,5028,2,53,9,506,8,0,396,269,0
FORMULA LamportFastMutEx-COL-8-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 8 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((X(!(p0 U p1))||G(p2)))))'
Support contains 88 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 8 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2022-05-17 10:08:48] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2022-05-17 10:08:48] [INFO ] Computed 82 place invariants in 1 ms
[2022-05-17 10:08:48] [INFO ] Implicit Places using invariants in 162 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 163 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(GT 2 (ADD s234 s235 s236 s237 s238 s239 s240 s241)), p0:(GT 3 (ADD s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s17...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 417 reset in 585 ms.
Stack based approach found an accepted trace after 5363 steps with 19 reset with depth 554 and stack size 554 in 27 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-01 finished in 1050 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(G((F(p1)||p0))) U p1) U p2)))'
Support contains 88 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 26 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2022-05-17 10:08:49] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2022-05-17 10:08:49] [INFO ] Computed 82 place invariants in 3 ms
[2022-05-17 10:08:49] [INFO ] Implicit Places using invariants in 160 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 162 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 2 (ADD s58 s59 s60 s61 s62 s63 s64 s65)), p1:(LEQ 2 (ADD s226 s227 s228 s229 s230 s231 s232 s233)), p0:(OR (LEQ (ADD s98 s99 s100 s101 s102 s103 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 491 reset in 474 ms.
Stack based approach found an accepted trace after 578 steps with 3 reset with depth 266 and stack size 266 in 3 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-02 finished in 897 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(((G(X(X(F(p1))))&&p2)||p3))))'
Support contains 40 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 21 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2022-05-17 10:08:50] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2022-05-17 10:08:50] [INFO ] Computed 82 place invariants in 1 ms
[2022-05-17 10:08:50] [INFO ] Implicit Places using invariants in 164 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 167 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/266 places, 576/584 transitions.
Applied a total of 0 rules in 16 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 250/266 places, 576/584 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 (ADD s50 s51 s52 s53 s54 s55 s56 s57)), p3:(LEQ (ADD s58 s59 s60 s61 s62 s63 s64 s65) (ADD s50 s51 s52 s53 s54 s55 s56 s57)), p2:(GT (ADD s218 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3691 reset in 329 ms.
Product exploration explored 100000 steps with 3697 reset in 303 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))))]
Knowledge based reduction with 11 factoid took 1706 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 4 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 755 steps, including 0 resets, run visited all 6 properties in 18 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2))))), (F p0), (F (AND p2 (NOT p0) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p3)))), (F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p2) (NOT p0) (NOT p3)))]
Knowledge based reduction with 11 factoid took 632 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 4 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 40 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 16 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2022-05-17 10:08:54] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2022-05-17 10:08:54] [INFO ] Computed 74 place invariants in 4 ms
[2022-05-17 10:08:54] [INFO ] Implicit Places using invariants in 155 ms returned []
[2022-05-17 10:08:54] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2022-05-17 10:08:54] [INFO ] Computed 74 place invariants in 2 ms
[2022-05-17 10:08:54] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-17 10:08:54] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2022-05-17 10:08:54] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 10:08:54] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2022-05-17 10:08:54] [INFO ] Computed 74 place invariants in 5 ms
[2022-05-17 10:08:55] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 576/576 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (OR (AND p2 (NOT p0)) (AND (NOT p0) p3))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p3)))))]
Knowledge based reduction with 11 factoid took 552 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 4 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1133 steps, including 0 resets, run visited all 6 properties in 15 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (OR (AND p2 (NOT p0)) (AND (NOT p0) p3))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p3))))), (F p0), (F (AND p2 (NOT p3) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (AND p2 (NOT p0)) (AND p3 (NOT p0))))), (F (AND p2 (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p0)))]
Knowledge based reduction with 11 factoid took 1702 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 4 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3723 reset in 281 ms.
Product exploration explored 100000 steps with 3568 reset in 300 ms.
Built C files in :
/tmp/ltsmin12149063720472114860
[2022-05-17 10:08:58] [INFO ] Computing symmetric may disable matrix : 576 transitions.
[2022-05-17 10:08:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:08:58] [INFO ] Computing symmetric may enable matrix : 576 transitions.
[2022-05-17 10:08:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:08:58] [INFO ] Computing Do-Not-Accords matrix : 576 transitions.
[2022-05-17 10:08:58] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:08:58] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12149063720472114860
Running compilation step : cd /tmp/ltsmin12149063720472114860;'/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 1347 ms.
Running link step : cd /tmp/ltsmin12149063720472114860;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin12149063720472114860;'/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/stateBased5780498423626020814.hoa' '--buchi-type=spotba'
LTSmin run took 882 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-05 finished in 11075 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(X(G(p1))&&F(G(!p0))))))'
Support contains 16 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 6 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2022-05-17 10:09:03] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2022-05-17 10:09:03] [INFO ] Computed 82 place invariants in 5 ms
[2022-05-17 10:09:03] [INFO ] Implicit Places using invariants in 184 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 185 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), true, p0]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (ADD s58 s59 s60 s61 s62 s63 s64 s65)), p1:(GT 3 (ADD s74 s75 s76 s77 s78 s79 s80 s81))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 240 ms.
Stack based approach found an accepted trace after 227 steps with 0 reset with depth 228 and stack size 228 in 1 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-07 finished in 1947 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(p2)))'
Support contains 24 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 12 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2022-05-17 10:09:03] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2022-05-17 10:09:03] [INFO ] Computed 82 place invariants in 4 ms
[2022-05-17 10:09:03] [INFO ] Implicit Places using invariants in 179 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 180 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/266 places, 576/584 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 250 transition count 568
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 242 transition count 568
Applied a total of 16 rules in 18 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
[2022-05-17 10:09:03] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2022-05-17 10:09:03] [INFO ] Computed 74 place invariants in 3 ms
[2022-05-17 10:09:04] [INFO ] Implicit Places using invariants in 175 ms returned []
[2022-05-17 10:09:04] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2022-05-17 10:09:04] [INFO ] Computed 74 place invariants in 5 ms
[2022-05-17 10:09:04] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-17 10:09:04] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/266 places, 568/584 transitions.
Finished structural reductions, in 2 iterations. Remains : 242/266 places, 568/584 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(LEQ 2 (ADD s234 s235 s236 s237 s238 s239 s240 s241)), p0:(LEQ 1 (ADD s42 s43 s44 s45 s46 s47 s48 s49)), p2:(GT 1 (ADD s82 s83 s84 s85 s86 s87 s88 s89)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-11 finished in 946 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((p0 U p1))))))'
Support contains 16 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 22 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2022-05-17 10:09:04] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2022-05-17 10:09:04] [INFO ] Computed 82 place invariants in 4 ms
[2022-05-17 10:09:04] [INFO ] Implicit Places using invariants in 183 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 185 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/266 places, 576/584 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 250 transition count 568
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 242 transition count 568
Applied a total of 16 rules in 9 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
[2022-05-17 10:09:04] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2022-05-17 10:09:04] [INFO ] Computed 74 place invariants in 3 ms
[2022-05-17 10:09:04] [INFO ] Implicit Places using invariants in 176 ms returned []
[2022-05-17 10:09:04] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2022-05-17 10:09:04] [INFO ] Computed 74 place invariants in 2 ms
[2022-05-17 10:09:05] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-17 10:09:05] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/266 places, 568/584 transitions.
Finished structural reductions, in 2 iterations. Remains : 242/266 places, 568/584 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 (ADD s226 s227 s228 s229 s230 s231 s232 s233)), p0:(LEQ 2 (ADD s50 s51 s52 s53 s54 s55 s56 s57))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 355 ms.
Stack based approach found an accepted trace after 1095 steps with 0 reset with depth 1096 and stack size 1096 in 5 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-13 finished in 1255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(X(p0))))))'
Support contains 8 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2022-05-17 10:09:05] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2022-05-17 10:09:05] [INFO ] Computed 82 place invariants in 2 ms
[2022-05-17 10:09:06] [INFO ] Implicit Places using invariants in 167 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 168 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 1 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s242 s243 s244 s245 s246 s247 s248 s249))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-15 finished in 462 ms.
All properties solved by simple procedures.
Total runtime 40664 ms.

BK_STOP 1652782146399

--------------------
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="LamportFastMutEx-COL-8"
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 LamportFastMutEx-COL-8, 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 r132-tall-165271820800387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 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 ;