Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628300158.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is LamportFastMutEx-COL-8, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628300158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.1K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 07:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 07:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 44K May 18 16:42 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-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-8-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716557290537

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-24 13:28:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:28:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:28:12] [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.
[2024-05-24 13:28:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 13:28:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 485 ms
[2024-05-24 13:28:12] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 13:28:13] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 6 ms.
[2024-05-24 13:28:13] [INFO ] Skeletonized 14 HLPN properties in 2 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-COL-8-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 13 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
Incomplete random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :10
Finished Best-First random walk after 5279 steps, including 1 resets, run visited all 2 properties in 13 ms. (steps per millisecond=406 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-24 13:28:13] [INFO ] Flatten gal took : 13 ms
[2024-05-24 13:28:13] [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.
[2024-05-24 13:28:13] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 28 ms.
[2024-05-24 13:28:13] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Support contains 250 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 12 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:13] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 13:28:13] [INFO ] Computed 82 invariants in 9 ms
[2024-05-24 13:28:13] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-24 13:28:13] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:13] [INFO ] Invariant cache hit.
[2024-05-24 13:28:13] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:28:13] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-05-24 13:28:13] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:13] [INFO ] Invariant cache hit.
[2024-05-24 13:28:14] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 830 ms. Remains : 266/266 places, 584/584 transitions.
Support contains 250 out of 266 places after structural reductions.
[2024-05-24 13:28:14] [INFO ] Flatten gal took : 61 ms
[2024-05-24 13:28:14] [INFO ] Flatten gal took : 64 ms
[2024-05-24 13:28:14] [INFO ] Input system was already deterministic with 584 transitions.
Support contains 242 out of 266 places (down from 250) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:28:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:14] [INFO ] Invariant cache hit.
[2024-05-24 13:28:15] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 13:28:15] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:28:15] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2024-05-24 13:28:15] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:28:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:28:15] [INFO ] After 95ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:28:16] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-24 13:28:16] [INFO ] After 622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 25 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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
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 97 ms. Remains 250 /266 variables (removed 16) and now considering 568/584 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 250/266 places, 568/584 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1001811 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 1001811 steps, saw 494671 distinct states, run finished after 3009 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:28:19] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2024-05-24 13:28:19] [INFO ] Computed 82 invariants in 11 ms
[2024-05-24 13:28:19] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:28:19] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:28:19] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:28:20] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:28:20] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:28:20] [INFO ] After 82ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:28:20] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-24 13:28:20] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 25 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 21 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 250/250 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 23 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-24 13:28:20] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 13:28:20] [INFO ] Invariant cache hit.
[2024-05-24 13:28:20] [INFO ] Implicit Places using invariants in 345 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 348 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 568/568 transitions.
Applied a total of 0 rules in 14 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 387 ms. Remains : 242/250 places, 568/568 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1018517 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1018517 steps, saw 502526 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:28:23] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 13:28:23] [INFO ] Computed 74 invariants in 18 ms
[2024-05-24 13:28:23] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2024-05-24 13:28:23] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:28:23] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2024-05-24 13:28:24] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:28:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:28:24] [INFO ] After 102ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:28:24] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-24 13:28:24] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-24 13:28:24] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 13:28:24] [INFO ] Invariant cache hit.
[2024-05-24 13:28:24] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-24 13:28:24] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 13:28:24] [INFO ] Invariant cache hit.
[2024-05-24 13:28:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:28:25] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-05-24 13:28:25] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-24 13:28:25] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 13:28:25] [INFO ] Invariant cache hit.
[2024-05-24 13:28:25] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 933 ms. Remains : 242/242 places, 568/568 transitions.
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 242 transition count 400
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 168 place count 242 transition count 336
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 352 place count 122 transition count 336
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 1 with 16 rules applied. Total rules applied 368 place count 114 transition count 328
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 376 place count 106 transition count 312
Iterating global reduction 1 with 8 rules applied. Total rules applied 384 place count 106 transition count 312
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 400 place count 98 transition count 312
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 408 place count 98 transition count 304
Applied a total of 408 rules in 28 ms. Remains 98 /242 variables (removed 144) and now considering 304/568 (removed 264) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 98 cols
[2024-05-24 13:28:25] [INFO ] Computed 18 invariants in 2 ms
[2024-05-24 13:28:25] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-05-24 13:28:25] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:28:25] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2024-05-24 13:28:25] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:28:25] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-24 13:28:25] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 1 stabilizing places and 8 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(X(F(p2))&&p1))))'
Support contains 41 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 18 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:26] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 13:28:26] [INFO ] Computed 82 invariants in 2 ms
[2024-05-24 13:28:26] [INFO ] Implicit Places using invariants in 175 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
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 : 258/266 places, 584/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 258 transition count 576
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 250 transition count 576
Applied a total of 16 rules in 37 ms. Remains 250 /258 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2024-05-24 13:28:26] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:28:26] [INFO ] Computed 74 invariants in 3 ms
[2024-05-24 13:28:27] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-05-24 13:28:27] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 13:28:27] [INFO ] Invariant cache hit.
[2024-05-24 13:28:27] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:28:27] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/266 places, 576/584 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1278 ms. Remains : 250/266 places, 576/584 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s15 1) (LT s80 1)) (OR (LT s16 1) (LT s81 1)) (OR (LT s9 1) (LT s74 1)) (OR (LT s10 1) (LT s75 1)) (OR (LT s11 1) (LT s76 1)) (OR (LT s12 ...], 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]]
Entered a terminal (fully accepting) state of product in 3481 steps with 1179 reset in 116 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-00 finished in 1738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(!p1)||p0))||G(p2)||F(G(!p1))))'
Support contains 49 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 31 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:27] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 13:28:27] [INFO ] Computed 82 invariants in 2 ms
[2024-05-24 13:28:28] [INFO ] Implicit Places using invariants in 292 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 293 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/266 places, 584/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 258 transition count 576
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 250 transition count 576
Applied a total of 16 rules in 16 ms. Remains 250 /258 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2024-05-24 13:28:28] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:28:28] [INFO ] Computed 74 invariants in 2 ms
[2024-05-24 13:28:28] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-24 13:28:28] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 13:28:28] [INFO ] Invariant cache hit.
[2024-05-24 13:28:28] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:28:28] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/266 places, 576/584 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 837 ms. Remains : 250/266 places, 576/584 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2) p1), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s25 1) (GEQ s238 1)) (AND (GEQ s20 1) (GEQ s235 1)) (AND (GEQ s25 1) (GEQ s240 1)) (AND (GEQ s20 1) (GEQ s237 1)) (AND (GEQ s20 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 375 ms.
Stack based approach found an accepted trace after 537 steps with 0 reset with depth 538 and stack size 538 in 3 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-01 finished in 1418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 17 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 19 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2024-05-24 13:28:29] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2024-05-24 13:28:29] [INFO ] Computed 82 invariants in 5 ms
[2024-05-24 13:28:29] [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 181 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 12 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
[2024-05-24 13:28:29] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 13:28:29] [INFO ] Computed 74 invariants in 2 ms
[2024-05-24 13:28:29] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-24 13:28:29] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 13:28:29] [INFO ] Invariant cache hit.
[2024-05-24 13:28:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:28:30] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 691 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 SI_LTL mode , in 2 iterations and 903 ms. Remains : 242/266 places, 568/584 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s47 1)) (AND (GEQ s16 1) (GEQ s48 1)) (AND (GEQ s11 1) (GEQ s45 1)) (AND (GEQ s11 1) (GEQ s43 1)) (AND (GEQ s16 1) (GEQ s44 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 584 ms.
Stack based approach found an accepted trace after 1138 steps with 0 reset with depth 1139 and stack size 1139 in 8 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-02 finished in 1576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(!p2)&&F(p3)&&p1))||p0)))'
Support contains 49 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 15 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:30] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 13:28:30] [INFO ] Computed 82 invariants in 2 ms
[2024-05-24 13:28:31] [INFO ] Implicit Places using invariants in 286 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 298 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/266 places, 584/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 258 transition count 576
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 250 transition count 576
Applied a total of 16 rules in 10 ms. Remains 250 /258 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2024-05-24 13:28:31] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:28:31] [INFO ] Computed 74 invariants in 9 ms
[2024-05-24 13:28:31] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-24 13:28:31] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 13:28:31] [INFO ] Invariant cache hit.
[2024-05-24 13:28:31] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:28:31] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/266 places, 576/584 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 881 ms. Remains : 250/266 places, 576/584 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (NOT p1) (NOT p3) p2), p2, (NOT p3)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s80 1)) (AND (GEQ s14 1) (GEQ s81 1)) (AND (GEQ s9 1) (GEQ s78 1)) (AND (GEQ s8 1) (GEQ s76 1)) (AND (GEQ s8 1) (GEQ s78 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 42 reset in 381 ms.
Stack based approach found an accepted trace after 820 steps with 0 reset with depth 821 and stack size 821 in 4 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-03 finished in 1500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X((F(!p2)||G(p0))))))'
Support contains 34 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.
[2024-05-24 13:28:32] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 13:28:32] [INFO ] Computed 82 invariants in 4 ms
[2024-05-24 13:28:32] [INFO ] Implicit Places using invariants in 194 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 196 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 LTL mode , in 2 iterations and 201 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (OR (LT s9 1) (LT s80 1)) (OR (LT s14 1) (LT s81 1)) (OR (LT s9 1) (LT s78 1)) (OR (LT s8 1) (LT s76 1)) (OR (LT s8 1) (LT s78 1)) (OR (LT s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1212 ms.
Product exploration explored 100000 steps with 50000 reset in 1215 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 p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p1), (X (NOT (AND p0 p2))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND p0 p2)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 142 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-8-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-8-LTLFireability-04 finished in 2996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0))&&(G(p1) U p2)))'
Support contains 34 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.
[2024-05-24 13:28:35] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:35] [INFO ] Invariant cache hit.
[2024-05-24 13:28:35] [INFO ] Implicit Places using invariants in 173 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 175 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 LTL mode , in 2 iterations and 179 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (OR (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), p0, (OR (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(OR (AND (GEQ s17 1) (GEQ s59 1)) (AND (GEQ s17 1) (GEQ s58 1)) (AND (GEQ s17 1) (GEQ s63 1)) (AND (GEQ s17 1) (GEQ s62 1)) (AND (GEQ s17 1) (GEQ s61 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-05 finished in 379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((F(p1)||G(p2)))))'
Support contains 105 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 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:35] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:35] [INFO ] Invariant cache hit.
[2024-05-24 13:28:35] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-24 13:28:35] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:35] [INFO ] Invariant cache hit.
[2024-05-24 13:28:35] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:28:36] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-05-24 13:28:36] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:36] [INFO ] Invariant cache hit.
[2024-05-24 13:28:36] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 266/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (AND (GEQ s17 1) (GEQ s59 1)) (AND (GEQ s17 1) (GEQ s58 1)) (AND (GEQ s17 1) (GEQ s63 1)) (AND (GEQ s17 1) (GEQ s62 1)) (AND (GEQ s17 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 391 ms.
Product exploration explored 100000 steps with 50000 reset in 393 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) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-8-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-8-LTLFireability-06 finished in 1626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&(p1 U G(!p1))) U p2)))'
Support contains 42 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 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:37] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:37] [INFO ] Invariant cache hit.
[2024-05-24 13:28:37] [INFO ] Implicit Places using invariants in 145 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 155 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 LTL mode , in 2 iterations and 162 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p2), (NOT p0), p1, p1, true]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s25 1) (GEQ s246 1)) (AND (GEQ s20 1) (GEQ s243 1)) (AND (GEQ s25 1) (GEQ s248 1)) (AND (GEQ s20 1) (GEQ s245 1)) (AND (GEQ s20 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 1 reset in 1 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-07 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(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 7 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:37] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:37] [INFO ] Invariant cache hit.
[2024-05-24 13:28:37] [INFO ] Implicit Places using invariants in 179 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 182 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 LTL mode , in 2 iterations and 192 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LT s91 1) (LT s90 1) (LT s93 1) (LT s92 1) (LT s96 1) (LT s94 1) (LT s97 1) (LT s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 259 ms.
Product exploration explored 100000 steps with 33333 reset in 279 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-8-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-8-LTLFireability-08 finished in 866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(((!p2 U (G(!p2)||(!p2&&(X(!p3) U ((p4&&X(!p3))||G(X(!p3)))))))||p1))||p0)))'
Support contains 65 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 4 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:38] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:38] [INFO ] Invariant cache hit.
[2024-05-24 13:28:38] [INFO ] Implicit Places using invariants in 153 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 154 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 LTL mode , in 2 iterations and 160 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), true, (AND p2 p3), (AND p2 p3), p3, p3]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p4) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p4) (NOT p2) p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p4) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}, { cond=(AND (NOT p4) p2), acceptance={} source=4 dest: 6}], [{ cond=p3, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p4) p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s29 1) (GEQ s51 1)) (AND (GEQ s39 1) (GEQ s56 1)) (AND (GEQ s41 1) (GEQ s57 1)) (AND (GEQ s27 1) (GEQ s50 1)) (AND (GEQ s35 1) (GEQ s54 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20190 reset in 593 ms.
Product exploration explored 100000 steps with 20250 reset in 588 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) (NOT p1) (NOT p2) (NOT p4) (NOT p3)), (X (AND (NOT p1) (NOT p4) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p4) (NOT p2) p3)))), (X (X (NOT (AND (NOT p4) p2)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p4) (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 123 ms. Reduced automaton from 7 states, 17 edges and 5 AP (stutter sensitive) to 7 states, 17 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), true, (AND p2 p3), (AND p2 p3), p3, p3]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:28:40] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2024-05-24 13:28:40] [INFO ] Computed 74 invariants in 5 ms
[2024-05-24 13:28:40] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p4) (NOT p3)), (X (AND (NOT p1) (NOT p4) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p4) (NOT p2) p3)))), (X (X (NOT (AND (NOT p4) p2)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p4) (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p2), (F (AND p2 p3)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p4)))), (F (AND p3 (NOT p4))), (F (AND (NOT p2) p3 (NOT p4))), (F (NOT (AND (NOT p3) (NOT p4)))), (F (AND (NOT p2) p3)), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F p3), (F (AND p2 (NOT p4)))]
Knowledge based reduction with 13 factoid took 507 ms. Reduced automaton from 7 states, 17 edges and 5 AP (stutter sensitive) to 7 states, 16 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Support contains 65 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:41] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:41] [INFO ] Invariant cache hit.
[2024-05-24 13:28:41] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-24 13:28:41] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:41] [INFO ] Invariant cache hit.
[2024-05-24 13:28:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:28:42] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-05-24 13:28:42] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:42] [INFO ] Invariant cache hit.
[2024-05-24 13:28:42] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 652 ms. Remains : 258/258 places, 584/584 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 p0) (NOT p1) (NOT p4) (NOT p2) (NOT p3)), (X (AND (NOT p1) (NOT p4))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3) (NOT p4)))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 120 ms. Reduced automaton from 7 states, 16 edges and 5 AP (stutter sensitive) to 7 states, 16 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Finished random walk after 4474 steps, including 1 resets, run visited all 13 properties in 20 ms. (steps per millisecond=223 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p4) (NOT p2) (NOT p3)), (X (AND (NOT p1) (NOT p4))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3) (NOT p4)))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (F (AND p2 (NOT p4))), (F (AND (NOT p2) p3)), (F (AND p2 p3)), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND p3 (NOT p4))), (F (AND (NOT p2) p3 (NOT p4))), (F p0), (F (NOT (AND (NOT p4) (NOT p1)))), (F p1), (F (NOT (AND (NOT p3) (NOT p4)))), (F p3)]
Knowledge based reduction with 10 factoid took 470 ms. Reduced automaton from 7 states, 16 edges and 5 AP (stutter sensitive) to 7 states, 16 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Product exploration explored 100000 steps with 20246 reset in 469 ms.
Product exploration explored 100000 steps with 20095 reset in 472 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p1) p2 p3), true, (AND p2 p3), (AND p2 p3), p3, p3]
Support contains 65 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:45] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-24 13:28:45] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:45] [INFO ] Invariant cache hit.
[2024-05-24 13:28:46] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 248 ms. Remains : 258/258 places, 584/584 transitions.
Built C files in :
/tmp/ltsmin13449996102462370819
[2024-05-24 13:28:46] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13449996102462370819
Running compilation step : cd /tmp/ltsmin13449996102462370819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 977 ms.
Running link step : cd /tmp/ltsmin13449996102462370819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13449996102462370819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9615504194001591285.hoa' '--buchi-type=spotba'
LTSmin run took 240 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-8-LTLFireability-09 finished in 8786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&F(!p1)) U ((p0 U p1)&&X(F(!p1)))))'
Support contains 80 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 4 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:47] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 13:28:47] [INFO ] Computed 82 invariants in 4 ms
[2024-05-24 13:28:47] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-24 13:28:47] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:47] [INFO ] Invariant cache hit.
[2024-05-24 13:28:47] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:28:47] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-24 13:28:47] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:47] [INFO ] Invariant cache hit.
[2024-05-24 13:28:48] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 266/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, p1, (NOT p1), true]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s91 1) (LT s90 1) (LT s93 1) (LT s92 1) (LT s96 1) (LT s94 1) (LT s97 1) (LT s95 1)), p0:(OR (AND (GEQ s164 1) (GEQ s186 1) (GEQ s187 1) (GEQ ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3786 reset in 314 ms.
Product exploration explored 100000 steps with 3771 reset in 262 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 86 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p1]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p1]
Stuttering acceptance computed with spot in 30 ms :[p1]
[2024-05-24 13:28:49] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:49] [INFO ] Invariant cache hit.
[2024-05-24 13:28:49] [INFO ] [Real]Absence check using 82 positive place invariants in 44 ms returned sat
[2024-05-24 13:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:28:49] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-24 13:28:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:28:49] [INFO ] [Nat]Absence check using 82 positive place invariants in 27 ms returned sat
[2024-05-24 13:28:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:28:49] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2024-05-24 13:28:49] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:28:49] [INFO ] [Nat]Added 112 Read/Feed constraints in 31 ms returned sat
[2024-05-24 13:28:50] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-05-24 13:28:50] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2024-05-24 13:28:50] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 0 ms to minimize.
[2024-05-24 13:28:50] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-24 13:28:50] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-24 13:28:50] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 13:28:50] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-24 13:28:50] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2024-05-24 13:28:50] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-24 13:28:50] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-24 13:28:51] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2024-05-24 13:28:51] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-24 13:28:51] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2024-05-24 13:28:51] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2024-05-24 13:28:51] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1386 ms
[2024-05-24 13:28:51] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 32 ms.
[2024-05-24 13:28:52] [INFO ] Added : 139 causal constraints over 28 iterations in 952 ms. Result :sat
Could not prove EG p1
Support contains 8 out of 266 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 10 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:28:52] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:52] [INFO ] Invariant cache hit.
[2024-05-24 13:28:52] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-24 13:28:52] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:52] [INFO ] Invariant cache hit.
[2024-05-24 13:28:52] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:28:52] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2024-05-24 13:28:52] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-24 13:28:52] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:52] [INFO ] Invariant cache hit.
[2024-05-24 13:28:53] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 752 ms. Remains : 266/266 places, 584/584 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[p1]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p1]
Stuttering acceptance computed with spot in 25 ms :[p1]
[2024-05-24 13:28:53] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:28:53] [INFO ] Invariant cache hit.
[2024-05-24 13:28:53] [INFO ] [Real]Absence check using 82 positive place invariants in 22 ms returned sat
[2024-05-24 13:28:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:28:53] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-24 13:28:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:28:53] [INFO ] [Nat]Absence check using 82 positive place invariants in 28 ms returned sat
[2024-05-24 13:28:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:28:54] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2024-05-24 13:28:54] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:28:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 31 ms returned sat
[2024-05-24 13:28:54] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-24 13:28:54] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-05-24 13:28:54] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-24 13:28:54] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-24 13:28:54] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-24 13:28:54] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-24 13:28:54] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-24 13:28:54] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-24 13:28:55] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-24 13:28:55] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 13:28:55] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2024-05-24 13:28:55] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2024-05-24 13:28:55] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-24 13:28:55] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-24 13:28:55] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1384 ms
[2024-05-24 13:28:55] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 28 ms.
[2024-05-24 13:28:56] [INFO ] Added : 139 causal constraints over 28 iterations in 924 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 133 ms :[p1]
Product exploration explored 100000 steps with 3766 reset in 260 ms.
Product exploration explored 100000 steps with 3766 reset in 269 ms.
Built C files in :
/tmp/ltsmin822710076538066763
[2024-05-24 13:28:57] [INFO ] Computing symmetric may disable matrix : 584 transitions.
[2024-05-24 13:28:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:28:57] [INFO ] Computing symmetric may enable matrix : 584 transitions.
[2024-05-24 13:28:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:28:57] [INFO ] Computing Do-Not-Accords matrix : 584 transitions.
[2024-05-24 13:28:57] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:28:57] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin822710076538066763
Running compilation step : cd /tmp/ltsmin822710076538066763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1358 ms.
Running link step : cd /tmp/ltsmin822710076538066763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin822710076538066763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8307848945102979103.hoa' '--buchi-type=spotba'
LTSmin run took 2757 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-8-LTLFireability-10 finished in 14135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 24 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 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:29:01] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:29:01] [INFO ] Invariant cache hit.
[2024-05-24 13:29:01] [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 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 LTL mode , in 2 iterations and 167 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, p0, p0]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s36 1) (GEQ s255 1)) (AND (GEQ s26 1) (GEQ s250 1)) (AND (GEQ s41 1) (GEQ s257 1)) (AND (GEQ s29 1) (GEQ s251 1)) (AND (GEQ s39 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-11 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 72 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 9 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:29:01] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:29:01] [INFO ] Invariant cache hit.
[2024-05-24 13:29:01] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-24 13:29:01] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:29:01] [INFO ] Invariant cache hit.
[2024-05-24 13:29:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:29:02] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-24 13:29:02] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 13:29:02] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:29:02] [INFO ] Invariant cache hit.
[2024-05-24 13:29:02] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 746 ms. Remains : 266/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s164 1) (GEQ s186 1) (GEQ s187 1) (GEQ s188 1) (GEQ s189 1) (GEQ s190 1) (GEQ s191 1) (GEQ s192 1) (GEQ s193 1)) (AND (GEQ s168 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1845 reset in 278 ms.
Product exploration explored 100000 steps with 1851 reset in 294 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-05-24 13:29:03] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:29:03] [INFO ] Invariant cache hit.
[2024-05-24 13:29:03] [INFO ] [Real]Absence check using 82 positive place invariants in 45 ms returned sat
[2024-05-24 13:29:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:29:04] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2024-05-24 13:29:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:29:04] [INFO ] [Nat]Absence check using 82 positive place invariants in 39 ms returned sat
[2024-05-24 13:29:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:29:04] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-24 13:29:04] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:29:04] [INFO ] [Nat]Added 112 Read/Feed constraints in 38 ms returned sat
[2024-05-24 13:29:04] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-24 13:29:04] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-24 13:29:05] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-24 13:29:05] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2024-05-24 13:29:05] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-24 13:29:05] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 13:29:05] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2024-05-24 13:29:05] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2024-05-24 13:29:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 817 ms
[2024-05-24 13:29:05] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 30 ms.
[2024-05-24 13:29:06] [INFO ] Added : 154 causal constraints over 31 iterations in 958 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 72 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 8 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:29:06] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:29:06] [INFO ] Invariant cache hit.
[2024-05-24 13:29:06] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-24 13:29:06] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:29:06] [INFO ] Invariant cache hit.
[2024-05-24 13:29:06] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:29:07] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-24 13:29:07] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-24 13:29:07] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:29:07] [INFO ] Invariant cache hit.
[2024-05-24 13:29:07] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 778 ms. Remains : 266/266 places, 584/584 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 58 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
[2024-05-24 13:29:07] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:29:07] [INFO ] Invariant cache hit.
[2024-05-24 13:29:08] [INFO ] [Real]Absence check using 82 positive place invariants in 41 ms returned sat
[2024-05-24 13:29:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:29:08] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2024-05-24 13:29:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:29:08] [INFO ] [Nat]Absence check using 82 positive place invariants in 29 ms returned sat
[2024-05-24 13:29:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:29:08] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-24 13:29:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:29:08] [INFO ] [Nat]Added 112 Read/Feed constraints in 34 ms returned sat
[2024-05-24 13:29:08] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-24 13:29:09] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-24 13:29:09] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2024-05-24 13:29:09] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-24 13:29:09] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-24 13:29:09] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-24 13:29:09] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-24 13:29:09] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2024-05-24 13:29:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 786 ms
[2024-05-24 13:29:09] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 33 ms.
[2024-05-24 13:29:10] [INFO ] Added : 154 causal constraints over 31 iterations in 949 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1844 reset in 290 ms.
Product exploration explored 100000 steps with 1848 reset in 301 ms.
Built C files in :
/tmp/ltsmin503279619905828755
[2024-05-24 13:29:11] [INFO ] Computing symmetric may disable matrix : 584 transitions.
[2024-05-24 13:29:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:29:11] [INFO ] Computing symmetric may enable matrix : 584 transitions.
[2024-05-24 13:29:11] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:29:11] [INFO ] Computing Do-Not-Accords matrix : 584 transitions.
[2024-05-24 13:29:11] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:29:11] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin503279619905828755
Running compilation step : cd /tmp/ltsmin503279619905828755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1333 ms.
Running link step : cd /tmp/ltsmin503279619905828755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin503279619905828755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2770136928691664970.hoa' '--buchi-type=spotba'
LTSmin run took 4213 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-8-LTLFireability-13 finished in 15164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(!p0))))'
Support contains 17 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 5 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:29:16] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:29:16] [INFO ] Invariant cache hit.
[2024-05-24 13:29:17] [INFO ] Implicit Places using invariants in 173 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 175 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 LTL mode , in 2 iterations and 183 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, p0, true]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s18 1) (GEQ s73 1)) (AND (GEQ s18 1) (GEQ s71 1)) (AND (GEQ s17 1) (GEQ s67 1)) (AND (GEQ s23 1) (GEQ s66 1)) (AND (GEQ s17 1) (GEQ s69 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-14 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 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 13 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 13:29:17] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 13:29:17] [INFO ] Invariant cache hit.
[2024-05-24 13:29:17] [INFO ] Implicit Places using invariants in 183 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 184 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/266 places, 584/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 258 transition count 576
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 250 transition count 576
Applied a total of 16 rules in 9 ms. Remains 250 /258 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2024-05-24 13:29:17] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:29:17] [INFO ] Computed 74 invariants in 2 ms
[2024-05-24 13:29:17] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-24 13:29:17] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 13:29:17] [INFO ] Invariant cache hit.
[2024-05-24 13:29:17] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:29:18] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/266 places, 576/584 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 819 ms. Remains : 250/266 places, 576/584 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s91 1) (LT s90 1) (LT s93 1) (LT s92 1) (LT s96 1) (LT s94 1) (LT s97 1) (LT s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 255 ms.
Stack based approach found an accepted trace after 263 steps with 0 reset with depth 264 and stack size 264 in 1 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-15 finished in 1133 ms.
All properties solved by simple procedures.
Total runtime 66046 ms.

BK_STOP 1716557359512

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-8"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is LamportFastMutEx-COL-8, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r241-tall-171649628300158"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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