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.r136-tall-171631131700011.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 itstools
Input is DatabaseWithMutex-COL-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631131700011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 9.9K Apr 11 18:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 18:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 21K 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 DatabaseWithMutex-COL-04-LTLCardinality-00
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-01
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-02
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-03
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-04
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-05
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-06
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-07
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-08
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-09
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-10
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-11
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-12
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-13
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-14
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716325425244

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-21 21:03:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:03:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:03:46] [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-21 21:03:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 21:03:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 520 ms
[2024-05-21 21:03:47] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 140 PT places and 128.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 21:03:47] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 4 ms.
[2024-05-21 21:03:47] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40013 steps (8 resets) in 448 ms. (89 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
// Phase 1: matrix 8 rows 11 cols
[2024-05-21 21:03:47] [INFO ] Computed 4 invariants in 3 ms
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 2/19 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-05-21 21:03:47] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:03:47] [INFO ] Flatten gal took : 2 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2024-05-21 21:03:47] [INFO ] Unfolded HLPN to a Petri net with 140 places and 128 transitions 416 arcs in 14 ms.
[2024-05-21 21:03:47] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 140 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-21 21:03:47] [INFO ] Computed 28 invariants in 5 ms
[2024-05-21 21:03:47] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 21:03:47] [INFO ] Invariant cache hit.
[2024-05-21 21:03:48] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 21:03:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2994 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3003 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 6035ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 6040ms
Finished structural reductions in LTL mode , in 1 iterations and 6262 ms. Remains : 140/140 places, 128/128 transitions.
Support contains 140 out of 140 places after structural reductions.
[2024-05-21 21:03:54] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:03:54] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:03:54] [INFO ] Input system was already deterministic with 128 transitions.
RANDOM walk for 40000 steps (8 resets) in 438 ms. (91 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
[2024-05-21 21:03:54] [INFO ] Invariant cache hit.
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 32/268 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, Generalized P Invariants (flows): 0/17 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Support contains 48 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 21:03:54] [INFO ] Invariant cache hit.
[2024-05-21 21:03:54] [INFO ] Implicit Places using invariants in 76 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 80 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 78 steps with 0 reset in 13 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-02 finished in 505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 16 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 52 rules applied. Total rules applied 68 place count 120 transition count 80
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 100 place count 88 transition count 64
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Applied a total of 132 rules in 30 ms. Remains 72 /140 variables (removed 68) and now considering 64/128 (removed 64) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-21 21:03:55] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 21:03:55] [INFO ] Implicit Places using invariants in 70 ms returned [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
[2024-05-21 21:03:55] [INFO ] Actually due to overlaps returned [24, 25, 26, 27, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 72 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/140 places, 64/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 64/140 places, 64/128 transitions.
Stuttering acceptance computed with spot in 27 ms :[p0]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-03
Product exploration explored 100000 steps with 10700 reset in 240 ms.
Stack based approach found an accepted trace after 191 steps with 24 reset with depth 7 and stack size 7 in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-03 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 52 rules applied. Total rules applied 68 place count 120 transition count 80
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 100 place count 88 transition count 64
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Applied a total of 132 rules in 12 ms. Remains 72 /140 variables (removed 68) and now considering 64/128 (removed 64) transitions.
[2024-05-21 21:03:55] [INFO ] Invariant cache hit.
[2024-05-21 21:03:55] [INFO ] Implicit Places using invariants in 75 ms returned [24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
[2024-05-21 21:03:55] [INFO ] Actually due to overlaps returned [24, 25, 26, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 78 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/140 places, 64/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 68/140 places, 64/128 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 191 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-04 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-21 21:03:56] [INFO ] Computed 28 invariants in 6 ms
[2024-05-21 21:03:56] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 21:03:56] [INFO ] Invariant cache hit.
[2024-05-21 21:03:56] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 21:03:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2645 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2822 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 5490ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 5495ms
Finished structural reductions in LTL mode , in 1 iterations and 5674 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-06 finished in 5812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 21:04:01] [INFO ] Invariant cache hit.
[2024-05-21 21:04:01] [INFO ] Implicit Places using invariants in 73 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 75 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-07
Product exploration explored 100000 steps with 7023 reset in 160 ms.
Stack based approach found an accepted trace after 9339 steps with 656 reset with depth 35 and stack size 35 in 20 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-07 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p0) U p1)))))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 21:04:02] [INFO ] Invariant cache hit.
[2024-05-21 21:04:02] [INFO ] Implicit Places using invariants in 78 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 79 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-10
Product exploration explored 100000 steps with 153 reset in 146 ms.
Stack based approach found an accepted trace after 738 steps with 2 reset with depth 499 and stack size 499 in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-10 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p1) U X(G(p2)))))'
Support contains 40 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 21:04:02] [INFO ] Invariant cache hit.
[2024-05-21 21:04:02] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 21:04:02] [INFO ] Invariant cache hit.
[2024-05-21 21:04:02] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 21:04:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2621 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2678 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 5319ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 5321ms
Finished structural reductions in LTL mode , in 1 iterations and 5477 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND p2 (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-11 finished in 5693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(!p0) U p1) U (p2||F(p3))))))'
Support contains 80 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 21:04:08] [INFO ] Invariant cache hit.
[2024-05-21 21:04:08] [INFO ] Implicit Places using invariants in 62 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 65 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-12
Product exploration explored 100000 steps with 5509 reset in 378 ms.
Product exploration explored 100000 steps with 5529 reset in 369 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (AND (NOT p2) (NOT p3) p1 p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X p0), (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))), (X p1), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))))]
Knowledge based reduction with 20 factoid took 307 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
RANDOM walk for 170 steps (0 resets) in 9 ms. (17 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (AND (NOT p2) (NOT p3) p1 p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X p0), (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))), (X p1), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR (NOT p0) p2 p3 p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT p1)), (F (NOT (AND p0 (NOT p2) (NOT p3) p1))), (F (NOT p0))]
Knowledge based reduction with 20 factoid took 663 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
// Phase 1: matrix 128 rows 124 cols
[2024-05-21 21:04:11] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 21:04:11] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 21:04:11] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 11 ms returned sat
[2024-05-21 21:04:11] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-21 21:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:04:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 21:04:11] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 21:04:11] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-21 21:04:11] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 8 ms to minimize.
[2024-05-21 21:04:11] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:04:11] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:04:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 166 ms
[2024-05-21 21:04:11] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-21 21:04:12] [INFO ] Added : 81 causal constraints over 17 iterations in 223 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 80 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 21:04:12] [INFO ] Invariant cache hit.
[2024-05-21 21:04:12] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 21:04:12] [INFO ] Invariant cache hit.
[2024-05-21 21:04:12] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-21 21:04:12] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-21 21:04:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 4/124 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 160 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4376 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 112/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 272 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5785 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
After SMT, in 10184ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 10186ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10363 ms. Remains : 124/124 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p3) p1)), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1))))), (X (X (AND p0 (NOT p2) (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 20 factoid took 312 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
RANDOM walk for 405 steps (0 resets) in 10 ms. (36 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p3) p1)), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1))))), (X (X (AND p0 (NOT p2) (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR (NOT p0) p2 p3 p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT p1)), (F (NOT (AND p0 (NOT p2) (NOT p3) p1))), (F (NOT p0))]
Knowledge based reduction with 20 factoid took 614 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
[2024-05-21 21:04:24] [INFO ] Invariant cache hit.
[2024-05-21 21:04:24] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 21:04:24] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 21:04:24] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-21 21:04:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:04:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 21:04:24] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:04:24] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 7 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 493 ms
[2024-05-21 21:04:24] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-21 21:04:25] [INFO ] Added : 81 causal constraints over 17 iterations in 226 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 5476 reset in 333 ms.
Product exploration explored 100000 steps with 5527 reset in 316 ms.
Built C files in :
/tmp/ltsmin9431050741815640728
[2024-05-21 21:04:26] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2024-05-21 21:04:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:04:26] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2024-05-21 21:04:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:04:26] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2024-05-21 21:04:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:04:26] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9431050741815640728
Running compilation step : cd /tmp/ltsmin9431050741815640728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 432 ms.
Running link step : cd /tmp/ltsmin9431050741815640728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin9431050741815640728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9008703570329351755.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 80 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 21:04:41] [INFO ] Invariant cache hit.
[2024-05-21 21:04:41] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:04:41] [INFO ] Invariant cache hit.
[2024-05-21 21:04:41] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-21 21:04:41] [INFO ] Redundant transitions in 6 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-21 21:04:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 21:04:41] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:04:41] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-21 21:04:41] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:04:41] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:04:41] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 1 ms to minimize.
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 21:04:42] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 4/124 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 21:04:43] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:04:43] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:04:43] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 12 ms to minimize.
[2024-05-21 21:04:44] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:04:44] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:04:44] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 160 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4400 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 112/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 272 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5642 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
After SMT, in 10056ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 10058ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10256 ms. Remains : 124/124 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin3105481422996206576
[2024-05-21 21:04:51] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2024-05-21 21:04:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:04:51] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2024-05-21 21:04:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:04:51] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2024-05-21 21:04:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:04:51] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3105481422996206576
Running compilation step : cd /tmp/ltsmin3105481422996206576;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 298 ms.
Running link step : cd /tmp/ltsmin3105481422996206576;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3105481422996206576;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17013493314968703598.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:05:06] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:05:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:05:06] [INFO ] Time to serialize gal into /tmp/LTL12363155637593791952.gal : 3 ms
[2024-05-21 21:05:06] [INFO ] Time to serialize properties into /tmp/LTL74633952287184194.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12363155637593791952.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12471103079777145243.hoa' '-atoms' '/tmp/LTL74633952287184194.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL74633952287184194.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12471103079777145243.hoa
Detected timeout of ITS tools.
[2024-05-21 21:05:21] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:05:21] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:05:21] [INFO ] Time to serialize gal into /tmp/LTL2001646491186233042.gal : 10 ms
[2024-05-21 21:05:21] [INFO ] Time to serialize properties into /tmp/LTL16238443891056213559.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2001646491186233042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16238443891056213559.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("(((((WaitMutex_0+WaitMutex_1)+(WaitMutex_2+WaitMutex_3))+((WaitMutex_4+WaitMutex_5)+(WaitMutex_6+WaitMutex_7)))+(((WaitMut...1248
Formula 0 simplified : GF((G!"(((((WaitMutex_0+WaitMutex_1)+(WaitMutex_2+WaitMutex_3))+((WaitMutex_4+WaitMutex_5)+(WaitMutex_6+WaitMutex_7)))+(((WaitMutex_...1240
Detected timeout of ITS tools.
[2024-05-21 21:05:36] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:05:36] [INFO ] Applying decomposition
[2024-05-21 21:05:36] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6855173408591429388.txt' '-o' '/tmp/graph6855173408591429388.bin' '-w' '/tmp/graph6855173408591429388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6855173408591429388.bin' '-l' '-1' '-v' '-w' '/tmp/graph6855173408591429388.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:05:36] [INFO ] Decomposing Gal with order
[2024-05-21 21:05:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:05:37] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-21 21:05:37] [INFO ] Flatten gal took : 33 ms
[2024-05-21 21:05:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 3 ms.
[2024-05-21 21:05:37] [INFO ] Time to serialize gal into /tmp/LTL3300717847128471590.gal : 3 ms
[2024-05-21 21:05:37] [INFO ] Time to serialize properties into /tmp/LTL10103498823829403968.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3300717847128471590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10103498823829403968.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("(((((gu3.WaitMutex_0+gu3.WaitMutex_1)+(gu3.WaitMutex_2+gu3.WaitMutex_3))+((gu3.WaitMutex_4+gu3.WaitMutex_5)+(gu3.WaitMutex...1568
Formula 0 simplified : GF((G!"(((((gu3.WaitMutex_0+gu3.WaitMutex_1)+(gu3.WaitMutex_2+gu3.WaitMutex_3))+((gu3.WaitMutex_4+gu3.WaitMutex_5)+(gu3.WaitMutex_6+...1560
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-12 finished in 103731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((p1||G(p2)))))'
Support contains 44 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-21 21:05:52] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 21:05:52] [INFO ] Implicit Places using invariants in 74 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 75 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-13 finished in 598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||G(F(p1)))) U (p0 U G(p2)))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 21:05:52] [INFO ] Invariant cache hit.
[2024-05-21 21:05:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 21:05:52] [INFO ] Invariant cache hit.
[2024-05-21 21:05:52] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 21:05:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2644 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2880 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 5538ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 5539ms
Finished structural reductions in LTL mode , in 1 iterations and 5699 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-15
Product exploration explored 100000 steps with 24088 reset in 171 ms.
Product exploration explored 100000 steps with 24106 reset in 153 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 106 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/10 properties
BEST_FIRST walk for 10759 steps (1 resets) in 35 ms. (298 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F p1), (F (NOT (OR p0 p2))), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 439 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 140 transition count 112
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 124 transition count 112
Applied a total of 32 rules in 13 ms. Remains 124 /140 variables (removed 16) and now considering 112/128 (removed 16) transitions.
// Phase 1: matrix 112 rows 124 cols
[2024-05-21 21:06:00] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 21:06:00] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 21:06:00] [INFO ] Invariant cache hit.
[2024-05-21 21:06:00] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-21 21:06:00] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-21 21:06:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 152 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2060 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 96/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2346 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4425ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4427ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/140 places, 112/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4590 ms. Remains : 124/140 places, 112/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (OR p0 p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR p0 p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 133 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 26639 steps (5 resets) in 79 ms. (332 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (OR p0 p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR p0 p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F p1), (F (NOT (OR p0 p2))), (F (NOT p0))]
Knowledge based reduction with 23 factoid took 511 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 7063 reset in 250 ms.
Stack based approach found an accepted trace after 76865 steps with 5437 reset with depth 16 and stack size 16 in 199 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-15 finished in 14137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(!p0) U p1) U (p2||F(p3))))))'
[2024-05-21 21:06:07] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4048093938595052983
[2024-05-21 21:06:07] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2024-05-21 21:06:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:06:07] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2024-05-21 21:06:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:06:07] [INFO ] Applying decomposition
[2024-05-21 21:06:07] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2024-05-21 21:06:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:06:07] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4048093938595052983
Running compilation step : cd /tmp/ltsmin4048093938595052983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 21:06:07] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7818447714847699326.txt' '-o' '/tmp/graph7818447714847699326.bin' '-w' '/tmp/graph7818447714847699326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7818447714847699326.bin' '-l' '-1' '-v' '-w' '/tmp/graph7818447714847699326.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:06:07] [INFO ] Decomposing Gal with order
[2024-05-21 21:06:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:06:07] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 21:06:07] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:06:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 21:06:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality9772842180526186886.gal : 2 ms
[2024-05-21 21:06:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality8635228418734471374.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9772842180526186886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8635228418734471374.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("(((((gi3.gu7.WaitMutex_0+gi3.gu7.WaitMutex_1)+(gi3.gu7.WaitMutex_2+gi3.gu7.WaitMutex_3))+((gi3.gu7.WaitMutex_4+gi3.gu7.Wai...1632
Formula 0 simplified : GF((G!"(((((gi3.gu7.WaitMutex_0+gi3.gu7.WaitMutex_1)+(gi3.gu7.WaitMutex_2+gi3.gu7.WaitMutex_3))+((gi3.gu7.WaitMutex_4+gi3.gu7.WaitMu...1624
Compilation finished in 294 ms.
Running link step : cd /tmp/ltsmin4048093938595052983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4048093938595052983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((<>(!(LTLAPp0==true)) U (LTLAPp1==true)) U ((LTLAPp2==true)||<>((LTLAPp3==true))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Initializing POR dependencies: labels 132, guards 128
pins2lts-mc-linux64( 4/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.056: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.056: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.068: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.068: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.075: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.075: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.079: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.079: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.091: LTL layer: formula: <>([](((<>(!(LTLAPp0==true)) U (LTLAPp1==true)) U ((LTLAPp2==true)||<>((LTLAPp3==true))))))
pins2lts-mc-linux64( 0/ 8), 0.092: "<>([](((<>(!(LTLAPp0==true)) U (LTLAPp1==true)) U ((LTLAPp2==true)||<>((LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.092: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.132: buchi has 7 states
pins2lts-mc-linux64( 0/ 8), 0.413: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.430: There are 133 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.430: State length is 141, there are 151 groups
pins2lts-mc-linux64( 0/ 8), 0.430: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.430: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.430: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.430: Visible groups: 0 / 151, labels: 4 / 133
pins2lts-mc-linux64( 0/ 8), 0.430: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.430: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.473: [Blue] ~20 levels ~960 states ~1984 transitions
pins2lts-mc-linux64( 3/ 8), 0.484: [Blue] ~24 levels ~1920 states ~3776 transitions
pins2lts-mc-linux64( 3/ 8), 0.509: [Blue] ~24 levels ~3840 states ~7264 transitions
pins2lts-mc-linux64( 3/ 8), 0.557: [Blue] ~24 levels ~7680 states ~15376 transitions
pins2lts-mc-linux64( 3/ 8), 0.649: [Blue] ~24 levels ~15360 states ~34168 transitions
pins2lts-mc-linux64( 3/ 8), 0.816: [Blue] ~24 levels ~30720 states ~79728 transitions
pins2lts-mc-linux64( 3/ 8), 1.221: [Blue] ~24 levels ~61440 states ~170904 transitions
pins2lts-mc-linux64( 3/ 8), 1.947: [Blue] ~24 levels ~122880 states ~356392 transitions
pins2lts-mc-linux64( 3/ 8), 3.120: [Blue] ~24 levels ~245760 states ~747632 transitions
pins2lts-mc-linux64( 5/ 8), 5.380: [Blue] ~40 levels ~491520 states ~1636896 transitions
pins2lts-mc-linux64( 3/ 8), 9.384: [Blue] ~40 levels ~983040 states ~4778672 transitions
pins2lts-mc-linux64( 0/ 8), 16.609: [Blue] ~40 levels ~1966080 states ~9726888 transitions
pins2lts-mc-linux64( 0/ 8), 31.791: [Blue] ~40 levels ~3932160 states ~21792360 transitions
pins2lts-mc-linux64( 5/ 8), 65.431: [Blue] ~40 levels ~7864320 states ~49709816 transitions
pins2lts-mc-linux64( 3/ 8), 129.552: [Blue] ~40 levels ~15728640 states ~104779728 transitions
pins2lts-mc-linux64( 3/ 8), 267.195: [Blue] ~40 levels ~31457280 states ~210120008 transitions
pins2lts-mc-linux64( 3/ 8), 518.225: [Blue] ~40 levels ~62914560 states ~423529184 transitions
pins2lts-mc-linux64( 2/ 8), 1057.038: [Blue] ~40 levels ~125829120 states ~841237632 transitions
pins2lts-mc-linux64( 5/ 8), 1203.884: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1203.916:
pins2lts-mc-linux64( 0/ 8), 1203.916: Explored 134223144 states 865811759 transitions, fanout: 6.451
pins2lts-mc-linux64( 0/ 8), 1203.917: Total exploration time 1203.470 sec (1203.440 sec minimum, 1203.448 sec on average)
pins2lts-mc-linux64( 0/ 8), 1203.917: States per second: 111530, Transitions per second: 719430
pins2lts-mc-linux64( 0/ 8), 1203.917:
pins2lts-mc-linux64( 0/ 8), 1203.917: State space has 134214795 states, 26641972 are accepting
pins2lts-mc-linux64( 0/ 8), 1203.917: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1203.917: blue states: 134223144 (100.01%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1203.917: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1203.917: all-red states: 134207877 (99.99%), bogus 9632 (0.01%)
pins2lts-mc-linux64( 0/ 8), 1203.917:
pins2lts-mc-linux64( 0/ 8), 1203.917: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1203.917:
pins2lts-mc-linux64( 0/ 8), 1203.917: Queue width: 8B, total height: 375, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1203.917: Tree memory: 1152.3MB, 9.0 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 1203.917: Tree fill ratio (roots/leafs): 99.0%/50.0%
pins2lts-mc-linux64( 0/ 8), 1203.917: Stored 128 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1203.917: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1203.917: Est. total memory use: 1152.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4048093938595052983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((<>(!(LTLAPp0==true)) U (LTLAPp1==true)) U ((LTLAPp2==true)||<>((LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4048093938595052983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((<>(!(LTLAPp0==true)) U (LTLAPp1==true)) U ((LTLAPp2==true)||<>((LTLAPp3==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-21 21:26:53] [INFO ] Applying decomposition
[2024-05-21 21:26:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:26:53] [INFO ] Decomposing Gal with order
[2024-05-21 21:26:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:26:53] [INFO ] Removed a total of 136 redundant transitions.
[2024-05-21 21:26:53] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:26:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 21:26:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality4662099509717481667.gal : 1 ms
[2024-05-21 21:26:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality9692892406788173813.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4662099509717481667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9692892406788173813.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("(((((gsitefile0.WaitMutex_0+gsitefile1.WaitMutex_1)+(gsitefile2.WaitMutex_2+gsitefile3.WaitMutex_3))+((gsitefile4.WaitMute...2158
Formula 0 simplified : GF((G!"(((((gsitefile0.WaitMutex_0+gsitefile1.WaitMutex_1)+(gsitefile2.WaitMutex_2+gsitefile3.WaitMutex_3))+((gsitefile4.WaitMutex_4...2150
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 21:47:40] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:47:40] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-21 21:47:40] [INFO ] Transformed 140 places.
[2024-05-21 21:47:40] [INFO ] Transformed 128 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 21:48:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality10114239006607551275.gal : 3 ms
[2024-05-21 21:48:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality11999561156486978281.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10114239006607551275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11999561156486978281.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(((F("(((((WaitMutex_0+WaitMutex_1)+(WaitMutex_2+WaitMutex_3))+((WaitMutex_4+WaitMutex_5)+(WaitMutex_6+WaitMutex_7)))+(((WaitMut...1248
Formula 0 simplified : GF((G!"(((((WaitMutex_0+WaitMutex_1)+(WaitMutex_2+WaitMutex_3))+((WaitMutex_4+WaitMutex_5)+(WaitMutex_6+WaitMutex_7)))+(((WaitMutex_...1240
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-COL-04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DatabaseWithMutex-COL-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631131700011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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