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.r444-smll-171701110600027.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 UtilityControlRoom-COL-Z2T3N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701110600027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 9.9K Apr 13 05:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 13 05:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 05:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 05:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 05:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 05:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 05:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 05:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 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 UtilityControlRoom-COL-Z2T3N08-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717071781143

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z2T3N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-30 12:23:03] [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-30 12:23:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:23:04] [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-30 12:23:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 12:23:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1279 ms
[2024-05-30 12:23:05] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 140 PT places and 216.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 12:23:05] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 8 ms.
[2024-05-30 12:23:05] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (8 resets) in 2132 ms. (18 steps per ms) remains 2/33 properties
BEST_FIRST walk for 40003 steps (8 resets) in 487 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 2/2 properties
// Phase 1: matrix 11 rows 13 cols
[2024-05-30 12:23:06] [INFO ] Computed 5 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 13/24 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 297ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-30 12:23:07] [INFO ] Flatten gal took : 24 ms
[2024-05-30 12:23:07] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 12:23:07] [INFO ] Unfolded HLPN to a Petri net with 140 places and 216 transitions 680 arcs in 26 ms.
[2024-05-30 12:23:07] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Support contains 132 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-30 12:23:07] [INFO ] Computed 19 invariants in 11 ms
[2024-05-30 12:23:07] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-30 12:23:07] [INFO ] Invariant cache hit.
[2024-05-30 12:23:07] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-30 12:23:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/140 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/324 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 159 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7598 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/140 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/324 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 176/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 176 unsolved in 10215 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 18106ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 18118ms
Finished structural reductions in LTL mode , in 1 iterations and 18457 ms. Remains : 140/140 places, 184/184 transitions.
Support contains 132 out of 140 places after structural reductions.
[2024-05-30 12:23:25] [INFO ] Flatten gal took : 51 ms
[2024-05-30 12:23:25] [INFO ] Flatten gal took : 41 ms
[2024-05-30 12:23:26] [INFO ] Input system was already deterministic with 184 transitions.
RANDOM walk for 40000 steps (8 resets) in 1763 ms. (22 steps per ms) remains 4/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
[2024-05-30 12:23:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 140/324 variables, and 19 constraints, problems are : Problem set: 2 solved, 0 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 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' '!(X((F(p0)&&(X(p1) U (X(G(p1))||(p2&&X(p1)))))))'
Support contains 35 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 43 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 12:23:27] [INFO ] Computed 19 invariants in 6 ms
[2024-05-30 12:23:27] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-30 12:23:27] [INFO ] Invariant cache hit.
[2024-05-30 12:23:27] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 12:23:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 143 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6989 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 160/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 303 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6554 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 13759ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 13766ms
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14167 ms. Remains : 124/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 505 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 3293 steps with 812 reset in 133 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-00 finished in 14943 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((F(p0)&&(p1||X(!p1)))))'
Support contains 17 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 17 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-30 12:23:42] [INFO ] Invariant cache hit.
[2024-05-30 12:23:42] [INFO ] Implicit Places using invariants in 123 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 12 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 168 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 465 ms.
Product exploration explored 100000 steps with 50000 reset in 442 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 31 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-01 finished in 1296 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' '!((G((F(p0)&&F(G(p1)))) U (p1&&X((p0&&X(p2))))))'
Support contains 18 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 10 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-30 12:23:43] [INFO ] Invariant cache hit.
[2024-05-30 12:23:43] [INFO ] Implicit Places using invariants in 126 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-02
Product exploration explored 100000 steps with 6 reset in 213 ms.
Stack based approach found an accepted trace after 4260 steps with 6 reset with depth 4226 and stack size 4226 in 26 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-02 finished in 787 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)||(p0&&G(F(p1))))))'
Support contains 64 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-30 12:23:44] [INFO ] Computed 19 invariants in 4 ms
[2024-05-30 12:23:44] [INFO ] Implicit Places using invariants in 169 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 139/140 places, 184/184 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-03 finished in 455 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 26 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 108 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 108 transition count 120
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 92 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 128 place count 84 transition count 112
Applied a total of 128 rules in 50 ms. Remains 84 /140 variables (removed 56) and now considering 112/184 (removed 72) transitions.
// Phase 1: matrix 112 rows 84 cols
[2024-05-30 12:23:44] [INFO ] Computed 19 invariants in 2 ms
[2024-05-30 12:23:45] [INFO ] Implicit Places using invariants in 152 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 154 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/140 places, 112/184 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 213 ms. Remains : 83/140 places, 112/184 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 563 ms.
Stack based approach found an accepted trace after 2743 steps with 0 reset with depth 2744 and stack size 2744 in 23 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-04 finished in 870 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||X(p1)))))'
Support contains 48 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 6 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 12:23:45] [INFO ] Computed 19 invariants in 3 ms
[2024-05-30 12:23:45] [INFO ] Implicit Places using invariants in 120 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-05 finished in 304 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 (!p0&&G(p1))))'
Support contains 34 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 108 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 108 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 92 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 128 place count 84 transition count 112
Applied a total of 128 rules in 23 ms. Remains 84 /140 variables (removed 56) and now considering 112/184 (removed 72) transitions.
// Phase 1: matrix 112 rows 84 cols
[2024-05-30 12:23:46] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 12:23:46] [INFO ] Implicit Places using invariants in 95 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/140 places, 112/184 transitions.
Applied a total of 0 rules in 12 ms. Remains 83 /83 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 83/140 places, 112/184 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 5185 steps with 0 reset in 30 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-06 finished in 276 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) U G((!p1||((p2 U p3) U p0)))))'
Support contains 51 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 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 168
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 168
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 116 transition count 160
Applied a total of 48 rules in 17 ms. Remains 116 /140 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 116 cols
[2024-05-30 12:23:46] [INFO ] Computed 19 invariants in 2 ms
[2024-05-30 12:23:46] [INFO ] Implicit Places using invariants in 99 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/140 places, 160/184 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 130 ms. Remains : 115/140 places, 160/184 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 932 ms.
Product exploration explored 100000 steps with 0 reset in 709 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 p1 p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2)))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0 p3 p2)), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))))), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0 p3 p2))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2)))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 25 factoid took 531 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter insensitive) to 5 states, 21 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (8 resets) in 531 ms. (75 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 4/4 properties
// Phase 1: matrix 160 rows 115 cols
[2024-05-30 12:23:49] [INFO ] Computed 18 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 115/275 variables, and 18 constraints, problems are : Problem set: 4 solved, 0 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/115 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2)))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0 p3 p2)), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))))), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0 p3 p2))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2))))), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 (NOT p1))), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (AND (OR p0 (NOT p1) (NOT p2)) (OR p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (AND (OR p0 p1 (NOT p2)) (OR p0 p1 (NOT p3))))), (F (NOT p1)), (F (NOT (OR p0 p1 p2 p3))), (F (NOT p0)), (F (NOT (OR p0 p2 p3))), (F (NOT (AND (OR (NOT p0) p2 p3) (OR p1 p2 p3)))), (F p2), (F (NOT p3)), (F (NOT (AND (OR (NOT p0) (NOT p2) p3) (OR p1 (NOT p2) p3))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 30 factoid took 145 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-07 finished in 3866 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||X((X(X(X(G(!p1)))) U (p0&&X(X(X(G(!p1)))))))))'
Support contains 24 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 7 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 12:23:50] [INFO ] Computed 19 invariants in 2 ms
[2024-05-30 12:23:50] [INFO ] Implicit Places using invariants in 137 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (OR (NOT p0) p1), p1, p1, p1, true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-09 finished in 416 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 40 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-30 12:23:50] [INFO ] Computed 19 invariants in 2 ms
[2024-05-30 12:23:50] [INFO ] Implicit Places using invariants in 136 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 139/140 places, 184/184 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-10
Product exploration explored 100000 steps with 7338 reset in 488 ms.
Product exploration explored 100000 steps with 7413 reset in 398 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 37 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 184 rows 139 cols
[2024-05-30 12:23:52] [INFO ] Computed 18 invariants in 2 ms
[2024-05-30 12:23:52] [INFO ] [Real]Absence check using 18 positive place invariants in 21 ms returned sat
[2024-05-30 12:23:52] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-30 12:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:23:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-30 12:23:53] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-30 12:23:53] [INFO ] Computed and/alt/rep : 176/264/176 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-30 12:23:53] [INFO ] Added : 136 causal constraints over 28 iterations in 666 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 40 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2024-05-30 12:23:53] [INFO ] Invariant cache hit.
[2024-05-30 12:23:53] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-30 12:23:53] [INFO ] Invariant cache hit.
[2024-05-30 12:23:54] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-30 12:23:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 157 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6684 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 176/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 333 constraints, problems are : Problem set: 0 solved, 176 unsolved in 10682 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 17533ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 17547ms
Finished structural reductions in LTL mode , in 1 iterations and 17945 ms. Remains : 139/139 places, 184/184 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 39 steps (0 resets) in 7 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 12:24:12] [INFO ] Invariant cache hit.
[2024-05-30 12:24:12] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-05-30 12:24:12] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-30 12:24:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:24:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-05-30 12:24:13] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-30 12:24:13] [INFO ] Computed and/alt/rep : 176/264/176 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-30 12:24:13] [INFO ] Added : 56 causal constraints over 12 iterations in 301 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7307 reset in 228 ms.
Product exploration explored 100000 steps with 7316 reset in 259 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 40 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 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 139 transition count 200
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 139 transition count 200
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 139 transition count 208
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 24 rules in 24 ms. Remains 139 /139 variables (removed 0) and now considering 208/184 (removed -24) transitions.
[2024-05-30 12:24:14] [INFO ] Redundant transitions in 16 ms returned []
Running 192 sub problems to find dead transitions.
// Phase 1: matrix 208 rows 139 cols
[2024-05-30 12:24:14] [INFO ] Computed 18 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-30 12:24:16] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 25 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 8/139 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-30 12:24:19] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-05-30 12:24:19] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 12:24:19] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-30 12:24:19] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-30 12:24:19] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-30 12:24:19] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-30 12:24:19] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-30 12:24:19] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 8/27 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/27 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 208/347 variables, 139/166 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/166 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/166 constraints. Problems are: Problem set: 48 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 166 constraints, problems are : Problem set: 48 solved, 144 unsolved in 9435 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 48 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 32/139 variables, 18/19 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 8/27 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/27 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 208/347 variables, 139/166 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 144/310 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/310 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/310 constraints. Problems are: Problem set: 48 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 310 constraints, problems are : Problem set: 48 solved, 144 unsolved in 6192 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 144/192 constraints, Known Traps: 9/9 constraints]
After SMT, in 15786ms problems are : Problem set: 48 solved, 144 unsolved
Search for dead transitions found 48 dead transitions in 15791ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 139/139 places, 160/184 transitions.
Graph (complete) has 304 edges and 139 vertex of which 115 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 115 /139 variables (removed 24) and now considering 160/160 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/139 places, 160/184 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15853 ms. Remains : 115/139 places, 160/184 transitions.
Built C files in :
/tmp/ltsmin16749636001645898285
[2024-05-30 12:24:30] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16749636001645898285
Running compilation step : cd /tmp/ltsmin16749636001645898285;'/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 838 ms.
Running link step : cd /tmp/ltsmin16749636001645898285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin16749636001645898285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4386708043208038949.hoa' '--buchi-type=spotba'
LTSmin run took 1208 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-10 finished in 42103 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(p1))))'
Support contains 26 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 5 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 12:24:32] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 12:24:32] [INFO ] Implicit Places using invariants in 96 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-11 finished in 335 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((F(G(p0)) U G((p0||X(p1))))))'
Support contains 64 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-30 12:24:33] [INFO ] Computed 19 invariants in 3 ms
[2024-05-30 12:24:33] [INFO ] Implicit Places using invariants in 217 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 219 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 139/140 places, 184/184 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 350 ms.
Stack based approach found an accepted trace after 3901 steps with 0 reset with depth 3902 and stack size 3259 in 18 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-13 finished in 821 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' '!(G((X(F(p0)) U (p1 U (F(p2) U p0)))))'
Support contains 1 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 108 transition count 136
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 96 place count 100 transition count 128
Applied a total of 96 rules in 21 ms. Remains 100 /140 variables (removed 40) and now considering 128/184 (removed 56) transitions.
// Phase 1: matrix 128 rows 100 cols
[2024-05-30 12:24:33] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 12:24:34] [INFO ] Implicit Places using invariants in 235 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 237 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/140 places, 128/184 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 265 ms. Remains : 99/140 places, 128/184 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-14
Product exploration explored 100000 steps with 36 reset in 274 ms.
Stack based approach found an accepted trace after 1187 steps with 0 reset with depth 1188 and stack size 1188 in 4 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-14 finished in 680 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(F(p1)))))'
Support contains 42 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 4 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 12:24:34] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 12:24:34] [INFO ] Implicit Places using invariants in 130 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-15
Product exploration explored 100000 steps with 8742 reset in 332 ms.
Product exploration explored 100000 steps with 8837 reset in 459 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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 128 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 211 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 392 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 168 rows 123 cols
[2024-05-30 12:24:36] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 12:24:36] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-30 12:24:37] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-05-30 12:24:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:24:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-30 12:24:37] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-30 12:24:37] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-30 12:24:37] [INFO ] Added : 17 causal constraints over 4 iterations in 109 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 42 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 115 transition count 160
Applied a total of 16 rules in 13 ms. Remains 115 /123 variables (removed 8) and now considering 160/168 (removed 8) transitions.
// Phase 1: matrix 160 rows 115 cols
[2024-05-30 12:24:37] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 12:24:37] [INFO ] Implicit Places using invariants in 124 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/123 places, 160/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 114 /114 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 114/123 places, 160/168 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 p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 133 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 189 steps (0 resets) in 6 ms. (27 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 348 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 160 rows 114 cols
[2024-05-30 12:24:38] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 12:24:38] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-30 12:24:39] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-30 12:24:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:24:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-30 12:24:39] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-30 12:24:39] [INFO ] Computed and/alt/rep : 152/232/152 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-30 12:24:39] [INFO ] Added : 17 causal constraints over 4 iterations in 88 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8793 reset in 444 ms.
Product exploration explored 100000 steps with 8756 reset in 394 ms.
Built C files in :
/tmp/ltsmin10486772302167928834
[2024-05-30 12:24:40] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2024-05-30 12:24:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:24:40] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2024-05-30 12:24:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:24:40] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2024-05-30 12:24:40] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:24:40] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10486772302167928834
Running compilation step : cd /tmp/ltsmin10486772302167928834;'/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 580 ms.
Running link step : cd /tmp/ltsmin10486772302167928834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10486772302167928834;'/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/stateBased12895977123880390.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 42 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 160/160 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-30 12:24:55] [INFO ] Invariant cache hit.
[2024-05-30 12:24:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 12:24:55] [INFO ] Invariant cache hit.
[2024-05-30 12:24:55] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-30 12:24:55] [INFO ] Redundant transitions in 5 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-30 12:24:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/114 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 160/274 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/274 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 131 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4773 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/114 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 160/274 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 152/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 283 constraints, problems are : Problem set: 0 solved, 152 unsolved in 7078 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 11924ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 11928ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12142 ms. Remains : 114/114 places, 160/160 transitions.
Built C files in :
/tmp/ltsmin9173469174400460708
[2024-05-30 12:25:07] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2024-05-30 12:25:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:25:07] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2024-05-30 12:25:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:25:07] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2024-05-30 12:25:07] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:25:07] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9173469174400460708
Running compilation step : cd /tmp/ltsmin9173469174400460708;'/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 788 ms.
Running link step : cd /tmp/ltsmin9173469174400460708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9173469174400460708;'/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/stateBased487526508074947563.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 12:25:22] [INFO ] Flatten gal took : 14 ms
[2024-05-30 12:25:22] [INFO ] Flatten gal took : 14 ms
[2024-05-30 12:25:22] [INFO ] Time to serialize gal into /tmp/LTL2255755089896745286.gal : 6 ms
[2024-05-30 12:25:22] [INFO ] Time to serialize properties into /tmp/LTL18205240837818234280.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/LTL2255755089896745286.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18020606242524744063.hoa' '-atoms' '/tmp/LTL18205240837818234280.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...319
Loading property file /tmp/LTL18205240837818234280.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18020606242524744063.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
151 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.54878,50876,1,0,127,220158,33,26,3022,140502,264
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-15 finished in 50268 ms.
All properties solved by simple procedures.
Total runtime 140999 ms.

BK_STOP 1717071924794

--------------------
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="UtilityControlRoom-COL-Z2T3N08"
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 UtilityControlRoom-COL-Z2T3N08, 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 r444-smll-171701110600027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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