MCC'2024- Execution of r544-smll-171701111100236

About the Execution of LTSMin+red for UtilityControlRoom-PT-Z4T3N10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2411.535	1674291.00	1845829.00	5759.10	?F?FF??FFFTTFFTF	normal

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.r544-smll-171701111100236.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 ltsminxred
Input is UtilityControlRoom-PT-Z4T3N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111100236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 38K Apr 13 05:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K Apr 13 05:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 13 05:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 13 05:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 129K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 110K Apr 13 05:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 507K Apr 13 05:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121K Apr 13 05:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 475K Apr 13 05:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 319K 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-PT-Z4T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717275541003

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T3N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:59:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:59:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:59:03] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-06-01 20:59:03] [INFO ] Transformed 376 places.
[2024-06-01 20:59:03] [INFO ] Transformed 750 transitions.
[2024-06-01 20:59:03] [INFO ] Parsed PT model containing 376 places and 750 transitions and 2410 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-06-01 20:59:03] [INFO ] Reduced 30 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 335 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 94 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2024-06-01 20:59:03] [INFO ] Computed 23 invariants in 50 ms
[2024-06-01 20:59:04] [INFO ] Implicit Places using invariants in 584 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 639 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 375/376 places, 590/590 transitions.
Applied a total of 0 rules in 9 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 772 ms. Remains : 375/376 places, 590/590 transitions.
Support contains 335 out of 375 places after structural reductions.
[2024-06-01 20:59:05] [INFO ] Flatten gal took : 162 ms
[2024-06-01 20:59:05] [INFO ] Flatten gal took : 134 ms
[2024-06-01 20:59:05] [INFO ] Input system was already deterministic with 590 transitions.
Reduction of identical properties reduced properties to check from 21 to 19
RANDOM walk for 5104 steps (0 resets) in 517 ms. (9 steps per ms) remains 0/19 properties
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(X(F(((G(p0) U !p1)||G(!p0)))))||F(p2)))'
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 42 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 20:59:06] [INFO ] Computed 22 invariants in 8 ms
[2024-06-01 20:59:06] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 20:59:06] [INFO ] Invariant cache hit.
[2024-06-01 20:59:06] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 20:59:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 28942 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 60508ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61159 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-00
Product exploration explored 100000 steps with 11032 reset in 1891 ms.
Product exploration explored 100000 steps with 11109 reset in 1594 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 298 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 36 steps (0 resets) in 10 ms. (3 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 4 factoid took 517 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 122 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 10 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 21:00:12] [INFO ] Invariant cache hit.
[2024-06-01 21:00:12] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 21:00:12] [INFO ] Invariant cache hit.
[2024-06-01 21:00:13] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 21:00:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 28612 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 59844ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 59855ms
Finished structural reductions in LTL mode , in 1 iterations and 60373 ms. Remains : 255/255 places, 470/470 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 p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 67 steps (0 resets) in 11 ms. (5 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 3 factoid took 373 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 129 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 138 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 11126 reset in 1527 ms.
Product exploration explored 100000 steps with 11043 reset in 1547 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 140 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 31 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 21:01:17] [INFO ] Redundant transitions in 35 ms returned []
Running 460 sub problems to find dead transitions.
[2024-06-01 21:01:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 27631 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 1)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 58781ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 58789ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58866 ms. Remains : 255/255 places, 470/470 transitions.
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 21:02:16] [INFO ] Invariant cache hit.
[2024-06-01 21:02:16] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 21:02:16] [INFO ] Invariant cache hit.
[2024-06-01 21:02:17] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 21:02:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 27846 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 58880ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 58887ms
Finished structural reductions in LTL mode , in 1 iterations and 59341 ms. Remains : 255/255 places, 470/470 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 finished in 249918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 14 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-06-01 21:03:16] [INFO ] Invariant cache hit.
[2024-06-01 21:03:16] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 21:03:16] [INFO ] Invariant cache hit.
[2024-06-01 21:03:16] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 21:03:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 28378 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 59435ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 59443ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60049 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 finished in 60209 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(X(X(X(F(!p1))))))||G(F(!p1)))))'
Support contains 210 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 6 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2024-06-01 21:04:16] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 21:04:16] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 21:04:16] [INFO ] Invariant cache hit.
[2024-06-01 21:04:16] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-01 21:04:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 61100ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61109ms
Finished structural reductions in LTL mode , in 1 iterations and 61721 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 210 ms :[p1, p1, p1, p1, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-02
Product exploration explored 100000 steps with 20000 reset in 460 ms.
Product exploration explored 100000 steps with 20000 reset in 474 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 (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[p1, p1, p1, p1, p1]
RANDOM walk for 89 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 168 ms :[p1, p1, p1, p1, p1]
Support contains 50 out of 375 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 4 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-06-01 21:05:20] [INFO ] Invariant cache hit.
[2024-06-01 21:05:20] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 21:05:20] [INFO ] Invariant cache hit.
[2024-06-01 21:05:20] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-01 21:05:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 60957ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60965ms
Finished structural reductions in LTL mode , in 1 iterations and 61556 ms. Remains : 375/375 places, 590/590 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 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[p1, p1, p1, p1, p1]
RANDOM walk for 107 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 172 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 172 ms :[p1, p1, p1, p1, p1]
Product exploration explored 100000 steps with 20000 reset in 269 ms.
Product exploration explored 100000 steps with 20000 reset in 296 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 173 ms :[p1, p1, p1, p1, p1]
Support contains 50 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 590
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 200 place count 375 transition count 550
Discarding 123 places :
Symmetric choice reduction at 2 with 123 rule applications. Total rules 323 place count 252 transition count 310
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 123 rules applied. Total rules applied 446 place count 252 transition count 310
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 222 transition count 280
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 222 transition count 280
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 536 place count 222 transition count 310
Deduced a syphon composed of 70 places in 2 ms
Applied a total of 536 rules in 109 ms. Remains 222 /375 variables (removed 153) and now considering 310/590 (removed 280) transitions.
[2024-06-01 21:06:23] [INFO ] Redundant transitions in 4 ms returned []
Running 270 sub problems to find dead transitions.
// Phase 1: matrix 310 rows 222 cols
[2024-06-01 21:06:23] [INFO ] Computed 22 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-01 21:06:25] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 21 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 10/222 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-01 21:06:29] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
[2024-06-01 21:06:29] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-06-01 21:06:29] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:06:29] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-01 21:06:29] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-01 21:06:29] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-06-01 21:06:29] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-06-01 21:06:29] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-01 21:06:29] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-01 21:06:29] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 10/33 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/33 constraints. Problems are: Problem set: 90 solved, 180 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 6 (OVERLAPS) 310/532 variables, 222/255 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/255 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/255 constraints. Problems are: Problem set: 100 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 255 constraints, problems are : Problem set: 100 solved, 170 unsolved in 12298 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 100 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 80/222 variables, 22/23 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 10/33 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/33 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 310/532 variables, 222/255 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 170/425 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/425 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/425 constraints. Problems are: Problem set: 100 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 425 constraints, problems are : Problem set: 100 solved, 170 unsolved in 9623 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 170/270 constraints, Known Traps: 11/11 constraints]
After SMT, in 22074ms problems are : Problem set: 100 solved, 170 unsolved
Search for dead transitions found 100 dead transitions in 22077ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 222/375 places, 210/590 transitions.
Graph (complete) has 400 edges and 222 vertex of which 152 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.2 ms
Discarding 70 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 22 ms. Remains 151 /222 variables (removed 71) and now considering 210/210 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 151/375 places, 210/590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22222 ms. Remains : 151/375 places, 210/590 transitions.
Support contains 50 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 11 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 21:06:45] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 21:06:45] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 21:06:45] [INFO ] Invariant cache hit.
[2024-06-01 21:06:46] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 21:06:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25325 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56249ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56256ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56765 ms. Remains : 255/375 places, 470/590 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 finished in 206001 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)||G(!p0))))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 82 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 72 transition count 70
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 696 place count 62 transition count 60
Applied a total of 696 rules in 51 ms. Remains 62 /375 variables (removed 313) and now considering 60/590 (removed 530) transitions.
// Phase 1: matrix 60 rows 62 cols
[2024-06-01 21:07:42] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 21:07:42] [INFO ] Implicit Places using invariants in 108 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/375 places, 60/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 61/375 places, 60/590 transitions.
Stuttering acceptance computed with spot in 50 ms :[false]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 226 ms.
Stack based approach found an accepted trace after 392 steps with 0 reset with depth 393 and stack size 393 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 finished in 460 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(X(G((X(p0) U !p1)))) U G(p2))))'
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 4 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2024-06-01 21:07:42] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 21:07:43] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 21:07:43] [INFO ] Invariant cache hit.
[2024-06-01 21:07:43] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-01 21:07:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 61038ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61047ms
Finished structural reductions in LTL mode , in 1 iterations and 61597 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p2), p1, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-05
Product exploration explored 100000 steps with 1703 reset in 706 ms.
Product exploration explored 100000 steps with 1724 reset in 740 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 165 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 284 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-06-01 21:08:47] [INFO ] Invariant cache hit.
[2024-06-01 21:08:49] [INFO ] [Real]Absence check using 22 positive place invariants in 27 ms returned sat
[2024-06-01 21:08:49] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2024-06-01 21:08:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:08:51] [INFO ] [Nat]Absence check using 22 positive place invariants in 25 ms returned sat
[2024-06-01 21:08:52] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2024-06-01 21:08:52] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 86 ms.
[2024-06-01 21:08:55] [INFO ] Added : 300 causal constraints over 60 iterations in 2655 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-06-01 21:08:55] [INFO ] Invariant cache hit.
[2024-06-01 21:08:55] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 21:08:55] [INFO ] Invariant cache hit.
[2024-06-01 21:08:55] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-01 21:08:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 61057ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61065ms
Finished structural reductions in LTL mode , in 1 iterations and 61607 ms. Remains : 375/375 places, 590/590 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 177 steps (0 resets) in 8 ms. (19 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-06-01 21:09:57] [INFO ] Invariant cache hit.
[2024-06-01 21:09:59] [INFO ] [Real]Absence check using 22 positive place invariants in 27 ms returned sat
[2024-06-01 21:10:00] [INFO ] [Real]Absence check using state equation in 828 ms returned sat
[2024-06-01 21:10:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:10:02] [INFO ] [Nat]Absence check using 22 positive place invariants in 25 ms returned sat
[2024-06-01 21:10:02] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2024-06-01 21:10:02] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 48 ms.
[2024-06-01 21:10:05] [INFO ] Added : 300 causal constraints over 60 iterations in 2523 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), p1, p1]
Product exploration explored 100000 steps with 1715 reset in 698 ms.
Product exploration explored 100000 steps with 1677 reset in 728 ms.
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-06-01 21:10:06] [INFO ] Invariant cache hit.
[2024-06-01 21:10:07] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 21:10:07] [INFO ] Invariant cache hit.
[2024-06-01 21:10:07] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-01 21:10:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 60918ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60926ms
Finished structural reductions in LTL mode , in 1 iterations and 61473 ms. Remains : 375/375 places, 590/590 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 finished in 205648 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(F((G(!p1)||p0))) U p1)))'
Support contains 55 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 7 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 21:11:08] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 21:11:08] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 21:11:08] [INFO ] Invariant cache hit.
[2024-06-01 21:11:08] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 21:11:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25292 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56197ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56203ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56652 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-06
Product exploration explored 100000 steps with 2380 reset in 484 ms.
Product exploration explored 100000 steps with 2364 reset in 495 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 p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
RANDOM walk for 197 steps (0 resets) in 10 ms. (17 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
[2024-06-01 21:12:07] [INFO ] Invariant cache hit.
[2024-06-01 21:12:09] [INFO ] [Real]Absence check using 22 positive place invariants in 23 ms returned sat
[2024-06-01 21:12:09] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2024-06-01 21:12:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:12:11] [INFO ] [Nat]Absence check using 22 positive place invariants in 21 ms returned sat
[2024-06-01 21:12:11] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2024-06-01 21:12:11] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 39 ms.
[2024-06-01 21:12:13] [INFO ] Added : 240 causal constraints over 48 iterations in 1545 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 21:12:13] [INFO ] Invariant cache hit.
[2024-06-01 21:12:13] [INFO ] [Real]Absence check using 22 positive place invariants in 20 ms returned sat
[2024-06-01 21:12:13] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2024-06-01 21:12:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:12:14] [INFO ] [Nat]Absence check using 22 positive place invariants in 21 ms returned sat
[2024-06-01 21:12:14] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2024-06-01 21:12:14] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 38 ms.
[2024-06-01 21:12:16] [INFO ] Added : 284 causal constraints over 57 iterations in 1869 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 55 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 430
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 215 transition count 430
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 175 transition count 390
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 200 place count 175 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 220 place count 165 transition count 340
Applied a total of 220 rules in 24 ms. Remains 165 /255 variables (removed 90) and now considering 340/470 (removed 130) transitions.
// Phase 1: matrix 340 rows 165 cols
[2024-06-01 21:12:16] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 21:12:16] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 21:12:16] [INFO ] Invariant cache hit.
[2024-06-01 21:12:16] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-01 21:12:16] [INFO ] Redundant transitions in 2 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-01 21:12:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 187 constraints, problems are : Problem set: 0 solved, 290 unsolved in 11611 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 290/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 19576 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 31768ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 31772ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/255 places, 340/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32140 ms. Remains : 165/255 places, 340/470 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 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 326 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
RANDOM walk for 115 steps (0 resets) in 12 ms. (8 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 469 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
[2024-06-01 21:12:50] [INFO ] Invariant cache hit.
[2024-06-01 21:12:51] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-06-01 21:12:51] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-06-01 21:12:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:12:53] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-06-01 21:12:53] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-06-01 21:12:53] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 21:12:54] [INFO ] Added : 138 causal constraints over 28 iterations in 688 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 21:12:54] [INFO ] Invariant cache hit.
[2024-06-01 21:12:54] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-06-01 21:12:54] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-06-01 21:12:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:12:54] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-06-01 21:12:55] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-06-01 21:12:55] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 21:12:55] [INFO ] Added : 144 causal constraints over 29 iterations in 691 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Product exploration explored 100000 steps with 3603 reset in 1319 ms.
Product exploration explored 100000 steps with 3610 reset in 1334 ms.
Support contains 55 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Applied a total of 0 rules in 12 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2024-06-01 21:12:58] [INFO ] Invariant cache hit.
[2024-06-01 21:12:58] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 21:12:58] [INFO ] Invariant cache hit.
[2024-06-01 21:12:59] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-01 21:12:59] [INFO ] Redundant transitions in 1 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-01 21:12:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 187 constraints, problems are : Problem set: 0 solved, 290 unsolved in 11469 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 290/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 19261 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 31342ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 31346ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31691 ms. Remains : 165/165 places, 340/340 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 finished in 141911 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(p0)&&X(G(p1)))))'
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 6 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 21:13:30] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 21:13:30] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 21:13:30] [INFO ] Invariant cache hit.
[2024-06-01 21:13:30] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 21:13:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 24727 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 55592ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 55598ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55975 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-07 finished in 56168 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)))'
Support contains 1 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 82 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 72 transition count 70
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 714 place count 53 transition count 51
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 732 place count 44 transition count 42
Applied a total of 732 rules in 31 ms. Remains 44 /375 variables (removed 331) and now considering 42/590 (removed 548) transitions.
// Phase 1: matrix 42 rows 44 cols
[2024-06-01 21:14:26] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 21:14:26] [INFO ] Implicit Places using invariants in 68 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/375 places, 42/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 43/375 places, 42/590 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-08
Product exploration explored 100000 steps with 1977 reset in 228 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 finished in 419 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)))'
Support contains 1 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 656 place count 82 transition count 71
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 674 place count 73 transition count 71
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 715 place count 52 transition count 51
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 733 place count 43 transition count 42
Applied a total of 733 rules in 29 ms. Remains 43 /375 variables (removed 332) and now considering 42/590 (removed 548) transitions.
// Phase 1: matrix 42 rows 43 cols
[2024-06-01 21:14:27] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 21:14:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 21:14:27] [INFO ] Invariant cache hit.
[2024-06-01 21:14:27] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-06-01 21:14:27] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-06-01 21:14:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 10/43 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 64 constraints, problems are : Problem set: 0 solved, 23 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 10/43 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 23/87 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 87 constraints, problems are : Problem set: 0 solved, 23 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 759ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 761ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/375 places, 42/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 931 ms. Remains : 43/375 places, 42/590 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-09
Product exploration explored 100000 steps with 6303 reset in 216 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 finished in 1229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 656 place count 82 transition count 71
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 674 place count 73 transition count 71
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 715 place count 52 transition count 51
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 733 place count 43 transition count 42
Applied a total of 733 rules in 28 ms. Remains 43 /375 variables (removed 332) and now considering 42/590 (removed 548) transitions.
// Phase 1: matrix 42 rows 43 cols
[2024-06-01 21:14:28] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 21:14:28] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 21:14:28] [INFO ] Invariant cache hit.
[2024-06-01 21:14:28] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-06-01 21:14:28] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-06-01 21:14:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 10/43 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 64 constraints, problems are : Problem set: 0 solved, 23 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 10/43 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 23/87 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 87 constraints, problems are : Problem set: 0 solved, 23 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 769ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 770ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/375 places, 42/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 934 ms. Remains : 43/375 places, 42/590 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-12
Product exploration explored 100000 steps with 7419 reset in 218 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 finished in 1201 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) U p1)&&G(p2))))'
Support contains 6 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 9 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 21:14:29] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 21:14:29] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 21:14:29] [INFO ] Invariant cache hit.
[2024-06-01 21:14:29] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 21:14:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25069 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56058ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56065ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56625 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 finished in 56843 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((((!p1&&G(p2)) U ((!p1&&G(p2)&&X(G(p3)))||G((!p1&&G(p2)))))||p0))))'
Support contains 5 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 119 place count 256 transition count 471
Iterating global reduction 0 with 119 rules applied. Total rules applied 238 place count 256 transition count 471
Applied a total of 238 rules in 8 ms. Remains 256 /375 variables (removed 119) and now considering 471/590 (removed 119) transitions.
// Phase 1: matrix 471 rows 256 cols
[2024-06-01 21:15:26] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 21:15:26] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-01 21:15:26] [INFO ] Invariant cache hit.
[2024-06-01 21:15:26] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-01 21:15:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/727 variables, 256/278 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/727 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (OVERLAPS) 0/727 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 727/727 variables, and 278 constraints, problems are : Problem set: 0 solved, 461 unsolved in 24383 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/727 variables, 256/278 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/727 variables, 461/739 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/727 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 727/727 variables, and 739 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints]
After SMT, in 55248ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 55255ms
Starting structural reductions in LTL mode, iteration 1 : 256/375 places, 471/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55832 ms. Remains : 256/375 places, 471/590 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1) (AND p1 (NOT p3))), (OR (NOT p2) (NOT p3) (AND (NOT p0) p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 170 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 finished in 56056 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(((G(p0) U !p1)||G(!p0)))))||F(p2)))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-00
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0)]
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 12 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 21:16:22] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 21:16:22] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 21:16:22] [INFO ] Invariant cache hit.
[2024-06-01 21:16:22] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 21:16:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 24634 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 55500ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 55507ms
Starting structural reductions in LI_LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 55930 ms. Remains : 255/375 places, 470/590 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-00
Product exploration explored 100000 steps with 11282 reset in 1353 ms.
Product exploration explored 100000 steps with 11101 reset in 1373 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 63 steps (0 resets) in 8 ms. (7 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 4 factoid took 346 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 111 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 1 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 21:17:22] [INFO ] Invariant cache hit.
[2024-06-01 21:17:22] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 21:17:22] [INFO ] Invariant cache hit.
[2024-06-01 21:17:22] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 21:17:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25254 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56113ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56120ms
Finished structural reductions in LTL mode , in 1 iterations and 56510 ms. Remains : 255/255 places, 470/470 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 p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 58 steps (0 resets) in 7 ms. (7 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 3 factoid took 344 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 114 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 11054 reset in 1385 ms.
Product exploration explored 100000 steps with 10980 reset in 1405 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 117 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 21:18:22] [INFO ] Redundant transitions in 2 ms returned []
Running 460 sub problems to find dead transitions.
[2024-06-01 21:18:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25278 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56142ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56148ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56166 ms. Remains : 255/255 places, 470/470 transitions.
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 21:19:18] [INFO ] Invariant cache hit.
[2024-06-01 21:19:19] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 21:19:19] [INFO ] Invariant cache hit.
[2024-06-01 21:19:19] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 21:19:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 24918 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 55784ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 55791ms
Finished structural reductions in LTL mode , in 1 iterations and 56258 ms. Remains : 255/255 places, 470/470 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 finished in 232952 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(X(X(X(F(!p1))))))||G(F(!p1)))))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-02
Stuttering acceptance computed with spot in 175 ms :[p1, p1, p1, p1, p1]
Support contains 210 out of 375 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 120 place count 315 transition count 530
Applied a total of 120 rules in 13 ms. Remains 315 /375 variables (removed 60) and now considering 530/590 (removed 60) transitions.
// Phase 1: matrix 530 rows 315 cols
[2024-06-01 21:20:15] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 21:20:15] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 21:20:15] [INFO ] Invariant cache hit.
[2024-06-01 21:20:16] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 490 sub problems to find dead transitions.
[2024-06-01 21:20:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/315 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 530/845 variables, 315/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (OVERLAPS) 0/845 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
No progress, stopping.
After SMT solving in domain Real declared 845/845 variables, and 337 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/315 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 530/845 variables, 315/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 490/827 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/845 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/845 variables, and 827 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
After SMT, in 61122ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 61129ms
Starting structural reductions in LI_LTL mode, iteration 1 : 315/375 places, 530/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61637 ms. Remains : 315/375 places, 530/590 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-02
Product exploration explored 100000 steps with 20000 reset in 590 ms.
Product exploration explored 100000 steps with 19993 reset in 612 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 (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[p1, p1, p1, p1, p1]
RANDOM walk for 94 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 171 ms :[p1, p1, p1, p1, p1]
Support contains 50 out of 315 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 530/530 transitions.
Applied a total of 0 rules in 2 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
[2024-06-01 21:21:19] [INFO ] Invariant cache hit.
[2024-06-01 21:21:19] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 21:21:19] [INFO ] Invariant cache hit.
[2024-06-01 21:21:19] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 490 sub problems to find dead transitions.
[2024-06-01 21:21:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/315 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 530/845 variables, 315/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/845 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
No progress, stopping.
After SMT solving in domain Real declared 845/845 variables, and 337 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/315 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 530/845 variables, 315/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 490/827 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/845 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/845 variables, and 827 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
After SMT, in 61162ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 61168ms
Finished structural reductions in LTL mode , in 1 iterations and 61669 ms. Remains : 315/315 places, 530/530 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 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[p1, p1, p1, p1, p1]
RANDOM walk for 82 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 171 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 169 ms :[p1, p1, p1, p1, p1]
Product exploration explored 100000 steps with 19996 reset in 406 ms.
Product exploration explored 100000 steps with 20000 reset in 429 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[p1, p1, p1, p1, p1]
Support contains 50 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 530/530 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 315 transition count 530
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 200 place count 315 transition count 490
Discarding 123 places :
Symmetric choice reduction at 2 with 123 rule applications. Total rules 323 place count 192 transition count 250
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 1 places
Iterating global reduction 2 with 124 rules applied. Total rules applied 447 place count 191 transition count 250
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 447 rules in 19 ms. Remains 191 /315 variables (removed 124) and now considering 250/530 (removed 280) transitions.
[2024-06-01 21:22:22] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
// Phase 1: matrix 250 rows 191 cols
[2024-06-01 21:22:22] [INFO ] Computed 21 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 21:22:24] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 10/191 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 3 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 10/32 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/32 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 250/441 variables, 191/223 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/223 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/223 constraints. Problems are: Problem set: 40 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 223 constraints, problems are : Problem set: 40 solved, 170 unsolved in 9588 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 40 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 50/191 variables, 21/22 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 10/32 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/32 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 250/441 variables, 191/223 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 170/393 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/393 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/393 constraints. Problems are: Problem set: 40 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 393 constraints, problems are : Problem set: 40 solved, 170 unsolved in 7635 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 170/210 constraints, Known Traps: 11/11 constraints]
After SMT, in 17341ms problems are : Problem set: 40 solved, 170 unsolved
Search for dead transitions found 40 dead transitions in 17345ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 191/315 places, 210/530 transitions.
Graph (complete) has 300 edges and 191 vertex of which 151 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 151 /191 variables (removed 40) and now considering 210/210 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 151/315 places, 210/530 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17378 ms. Remains : 151/315 places, 210/530 transitions.
Support contains 50 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 530/530 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 195 transition count 410
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 195 transition count 410
Applied a total of 240 rules in 4 ms. Remains 195 /315 variables (removed 120) and now considering 410/530 (removed 120) transitions.
// Phase 1: matrix 410 rows 195 cols
[2024-06-01 21:22:40] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 21:22:40] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 21:22:40] [INFO ] Invariant cache hit.
[2024-06-01 21:22:40] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-01 21:22:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 10/195 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 410/605 variables, 195/217 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/605 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 217 constraints, problems are : Problem set: 0 solved, 370 unsolved in 16182 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 10/195 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 410/605 variables, 195/217 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 370/587 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/605 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 587 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 47355ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 47360ms
Starting structural reductions in LTL mode, iteration 1 : 195/315 places, 410/530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47763 ms. Remains : 195/315 places, 410/530 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 finished in 192869 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(X(G((X(p0) U !p1)))) U G(p2))))'
Found a Lengthening insensitive property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-05
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), p1, p1]
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 375 transition count 550
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 335 transition count 550
Applied a total of 80 rules in 10 ms. Remains 335 /375 variables (removed 40) and now considering 550/590 (removed 40) transitions.
// Phase 1: matrix 550 rows 335 cols
[2024-06-01 21:23:28] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 21:23:28] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 21:23:28] [INFO ] Invariant cache hit.
[2024-06-01 21:23:28] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-06-01 21:23:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 885/885 variables, and 357 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 540/897 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 885/885 variables, and 897 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 61022ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 61028ms
Starting structural reductions in LI_LTL mode, iteration 1 : 335/375 places, 550/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61540 ms. Remains : 335/375 places, 550/590 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-05
Product exploration explored 100000 steps with 1702 reset in 723 ms.
Product exploration explored 100000 steps with 1696 reset in 760 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 210 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 179 steps (0 resets) in 7 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 287 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-06-01 21:24:32] [INFO ] Invariant cache hit.
[2024-06-01 21:24:34] [INFO ] [Real]Absence check using 22 positive place invariants in 25 ms returned sat
[2024-06-01 21:24:35] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2024-06-01 21:24:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:24:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 21 ms returned sat
[2024-06-01 21:24:37] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2024-06-01 21:24:37] [INFO ] Computed and/alt/rep : 540/1010/540 causal constraints (skipped 0 transitions) in 46 ms.
[2024-06-01 21:24:39] [INFO ] Added : 254 causal constraints over 52 iterations in 1933 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 215 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 550/550 transitions.
Applied a total of 0 rules in 2 ms. Remains 335 /335 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-06-01 21:24:39] [INFO ] Invariant cache hit.
[2024-06-01 21:24:39] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 21:24:39] [INFO ] Invariant cache hit.
[2024-06-01 21:24:39] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-06-01 21:24:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 6 (OVERLAPS) 0/885 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
No progress, stopping.
After SMT solving in domain Real declared 885/885 variables, and 357 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 540/897 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 885/885 variables, and 897 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60899ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60906ms
Finished structural reductions in LTL mode , in 1 iterations and 61414 ms. Remains : 335/335 places, 550/550 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 154 steps (0 resets) in 7 ms. (19 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-06-01 21:25:41] [INFO ] Invariant cache hit.
[2024-06-01 21:25:43] [INFO ] [Real]Absence check using 22 positive place invariants in 24 ms returned sat
[2024-06-01 21:25:44] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2024-06-01 21:25:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:25:45] [INFO ] [Nat]Absence check using 22 positive place invariants in 21 ms returned sat
[2024-06-01 21:25:46] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2024-06-01 21:25:46] [INFO ] Computed and/alt/rep : 540/1010/540 causal constraints (skipped 0 transitions) in 41 ms.
[2024-06-01 21:25:48] [INFO ] Added : 254 causal constraints over 52 iterations in 1935 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), p1, p1]
Product exploration explored 100000 steps with 1729 reset in 711 ms.
Product exploration explored 100000 steps with 1697 reset in 846 ms.
Support contains 215 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 550/550 transitions.
Applied a total of 0 rules in 2 ms. Remains 335 /335 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-06-01 21:25:50] [INFO ] Invariant cache hit.
[2024-06-01 21:25:50] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 21:25:50] [INFO ] Invariant cache hit.
[2024-06-01 21:25:50] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-06-01 21:25:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 885/885 variables, and 357 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 540/897 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 885/885 variables, and 897 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60966ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60973ms
Finished structural reductions in LTL mode , in 1 iterations and 61475 ms. Remains : 335/335 places, 550/550 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 finished in 203550 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(F((G(!p1)||p0))) U p1)))'
[2024-06-01 21:26:51] [INFO ] Flatten gal took : 66 ms
[2024-06-01 21:26:51] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 21 ms.
[2024-06-01 21:26:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 375 places, 590 transitions and 1720 arcs took 10 ms.
Total runtime 1669164 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : UtilityControlRoom-PT-Z4T3N10-LTLFireability-00
Could not compute solution for formula : UtilityControlRoom-PT-Z4T3N10-LTLFireability-02
Could not compute solution for formula : UtilityControlRoom-PT-Z4T3N10-LTLFireability-05
Could not compute solution for formula : UtilityControlRoom-PT-Z4T3N10-LTLFireability-06

BK_STOP 1717277215294

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name UtilityControlRoom-PT-Z4T3N10-LTLFireability-00
ltl formula formula --ltl=/tmp/2833/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2833/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2833/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2833/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.020 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2833/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name UtilityControlRoom-PT-Z4T3N10-LTLFireability-02
ltl formula formula --ltl=/tmp/2833/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.040 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2833/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2833/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2833/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2833/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name UtilityControlRoom-PT-Z4T3N10-LTLFireability-05
ltl formula formula --ltl=/tmp/2833/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2833/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2833/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2833/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2833/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name UtilityControlRoom-PT-Z4T3N10-LTLFireability-06
ltl formula formula --ltl=/tmp/2833/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.040 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2833/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2833/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2833/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2833/ltl_3_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins

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-PT-Z4T3N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is UtilityControlRoom-PT-Z4T3N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r544-smll-171701111100236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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