About the Execution of ITS-Tools for UtilityControlRoom-PT-Z4T3N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4053.560 | 1713505.00 | 2858176.00 | 4879.70 | TFTFFFTFFFTTFFTF | 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.r444-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 itstools
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 r444-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 1717121435331
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T3N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-31 02:10:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 02:10:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 02:10:37] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-31 02:10:37] [INFO ] Transformed 376 places.
[2024-05-31 02:10:37] [INFO ] Transformed 750 transitions.
[2024-05-31 02:10:37] [INFO ] Parsed PT model containing 376 places and 750 transitions and 2410 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-05-31 02:10:37] [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 25 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2024-05-31 02:10:37] [INFO ] Computed 23 invariants in 51 ms
[2024-05-31 02:10:38] [INFO ] Implicit Places using invariants in 633 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 682 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 7 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 740 ms. Remains : 375/376 places, 590/590 transitions.
Support contains 335 out of 375 places after structural reductions.
[2024-05-31 02:10:39] [INFO ] Flatten gal took : 180 ms
[2024-05-31 02:10:39] [INFO ] Flatten gal took : 108 ms
[2024-05-31 02:10:39] [INFO ] Input system was already deterministic with 590 transitions.
Reduction of identical properties reduced properties to check from 21 to 19
RANDOM walk for 11955 steps (2 resets) in 707 ms. (16 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 58 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-31 02:10:40] [INFO ] Computed 22 invariants in 14 ms
[2024-05-31 02:10:40] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-31 02:10:40] [INFO ] Invariant cache hit.
[2024-05-31 02:10:41] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-31 02:10:41] [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 30046 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
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 30027 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 61774ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61818ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62696 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 386 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 11086 reset in 2035 ms.
Product exploration explored 100000 steps with 11162 reset in 1661 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 246 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 171 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 60 steps (0 resets) in 16 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 561 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 166 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 165 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 17 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-31 02:11:48] [INFO ] Invariant cache hit.
[2024-05-31 02:11:48] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-31 02:11:48] [INFO ] Invariant cache hit.
[2024-05-31 02:11:49] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-31 02:11:49] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 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 30035 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 61600ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61615ms
Finished structural reductions in LTL mode , in 1 iterations and 62306 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 286 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 50 steps (0 resets) in 5 ms. (8 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 542 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 153 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 151 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 143 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 11198 reset in 1766 ms.
Product exploration explored 100000 steps with 11140 reset in 1339 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 125 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 25 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-31 02:12:55] [INFO ] Redundant transitions in 50 ms returned []
Running 460 sub problems to find dead transitions.
[2024-05-31 02:12:55] [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
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 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30025 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 30023 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 61183ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61195ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61310 ms. Remains : 255/255 places, 470/470 transitions.
Built C files in :
/tmp/ltsmin16937090376856349142
[2024-05-31 02:13:57] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16937090376856349142
Running compilation step : cd /tmp/ltsmin16937090376856349142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1921 ms.
Running link step : cd /tmp/ltsmin16937090376856349142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin16937090376856349142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6431895279894844032.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 7 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-31 02:14:12] [INFO ] Invariant cache hit.
[2024-05-31 02:14:12] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-31 02:14:12] [INFO ] Invariant cache hit.
[2024-05-31 02:14:12] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-31 02:14:12] [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 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]
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 61050ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61058ms
Finished structural reductions in LTL mode , in 1 iterations and 61590 ms. Remains : 255/255 places, 470/470 transitions.
Built C files in :
/tmp/ltsmin17255640038552550676
[2024-05-31 02:15:13] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17255640038552550676
Running compilation step : cd /tmp/ltsmin17255640038552550676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1685 ms.
Running link step : cd /tmp/ltsmin17255640038552550676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17255640038552550676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2955719303917274984.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 02:15:29] [INFO ] Flatten gal took : 41 ms
[2024-05-31 02:15:29] [INFO ] Flatten gal took : 38 ms
[2024-05-31 02:15:29] [INFO ] Time to serialize gal into /tmp/LTL3225837043020855298.gal : 12 ms
[2024-05-31 02:15:29] [INFO ] Time to serialize properties into /tmp/LTL15001831831299810031.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3225837043020855298.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6975682995601009276.hoa' '-atoms' '/tmp/LTL15001831831299810031.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15001831831299810031.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6975682995601009276.hoa
Detected timeout of ITS tools.
[2024-05-31 02:15:44] [INFO ] Flatten gal took : 31 ms
[2024-05-31 02:15:44] [INFO ] Flatten gal took : 30 ms
[2024-05-31 02:15:44] [INFO ] Time to serialize gal into /tmp/LTL3631415097649279954.gal : 8 ms
[2024-05-31 02:15:44] [INFO ] Time to serialize properties into /tmp/LTL14150447087536134541.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3631415097649279954.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14150447087536134541.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(F(((G("(((((((((((IdleTechs_2>=1)&&(OpenRequests_6_2>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)...19596
Formula 0 simplified : XXG((F!"(((((((((((IdleTechs_2>=1)&&(OpenRequests_6_2>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(...19577
Detected timeout of ITS tools.
[2024-05-31 02:15:59] [INFO ] Flatten gal took : 29 ms
[2024-05-31 02:15:59] [INFO ] Applying decomposition
[2024-05-31 02:15:59] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7969727706243020101.txt' '-o' '/tmp/graph7969727706243020101.bin' '-w' '/tmp/graph7969727706243020101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7969727706243020101.bin' '-l' '-1' '-v' '-w' '/tmp/graph7969727706243020101.weights' '-q' '0' '-e' '0.001'
[2024-05-31 02:15:59] [INFO ] Decomposing Gal with order
[2024-05-31 02:15:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 02:15:59] [INFO ] Removed a total of 693 redundant transitions.
[2024-05-31 02:15:59] [INFO ] Flatten gal took : 135 ms
[2024-05-31 02:16:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 29 ms.
[2024-05-31 02:16:00] [INFO ] Time to serialize gal into /tmp/LTL14643489057676349705.gal : 10 ms
[2024-05-31 02:16:00] [INFO ] Time to serialize properties into /tmp/LTL14000246032983116535.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14643489057676349705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14000246032983116535.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(X(F(((G("(((((((((((i2.i0.u9.IdleTechs_2>=1)&&(i3.u40.OpenRequests_6_2>=1))&&(i0.i0.u8.Idles>=1))||(((i6.i1.u32.IdleTechs_0>=1)&...28261
Formula 0 simplified : XXG((F!"(((((((((((i2.i0.u9.IdleTechs_2>=1)&&(i3.u40.OpenRequests_6_2>=1))&&(i0.i0.u8.Idles>=1))||(((i6.i1.u32.IdleTechs_0>=1)&&(i5....28242
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 finished in 334853 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 17 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-05-31 02:16:15] [INFO ] Invariant cache hit.
[2024-05-31 02:16:15] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-31 02:16:15] [INFO ] Invariant cache hit.
[2024-05-31 02:16:15] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-31 02:16:15] [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 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]
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 30021 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 61122ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61129ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61749 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 149 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 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 finished in 61927 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 7 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2024-05-31 02:17:17] [INFO ] Computed 22 invariants in 11 ms
[2024-05-31 02:17:17] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-31 02:17:17] [INFO ] Invariant cache hit.
[2024-05-31 02:17:17] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-05-31 02:17: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 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]
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 30023 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 61030ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61039ms
Finished structural reductions in LTL mode , in 1 iterations and 61635 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 322 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 714 ms.
Product exploration explored 100000 steps with 20000 reset in 711 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 114 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 175 ms :[p1, p1, p1, p1, p1]
RANDOM walk for 101 steps (0 resets) in 5 ms. (16 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 118 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 254 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 280 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 7 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-05-31 02:18:21] [INFO ] Invariant cache hit.
[2024-05-31 02:18:21] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-31 02:18:21] [INFO ] Invariant cache hit.
[2024-05-31 02:18:22] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-05-31 02:18:22] [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
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 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30027 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 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]
After SMT, in 60967ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60976ms
Finished structural reductions in LTL mode , in 1 iterations and 62033 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 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 207 ms :[p1, p1, p1, p1, p1]
RANDOM walk for 118 steps (0 resets) in 6 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 108 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 208 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 219 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 194 ms :[p1, p1, p1, p1, p1]
Product exploration explored 100000 steps with 20000 reset in 264 ms.
Product exploration explored 100000 steps with 20000 reset in 287 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 210 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 0 ms
Applied a total of 536 rules in 93 ms. Remains 222 /375 variables (removed 153) and now considering 310/590 (removed 280) transitions.
[2024-05-31 02:19:25] [INFO ] Redundant transitions in 4 ms returned []
Running 270 sub problems to find dead transitions.
// Phase 1: matrix 310 rows 222 cols
[2024-05-31 02:19:25] [INFO ] Computed 22 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-31 02:19:27] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 22 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-05-31 02:19:32] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 3 ms to minimize.
[2024-05-31 02:19:32] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 3 ms to minimize.
[2024-05-31 02:19:32] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 02:19:32] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-31 02:19:32] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-31 02:19:33] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-31 02:19:33] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 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-05-31 02:19:33] [INFO ] Deduced a trap composed of 13 places in 34 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-05-31 02:19:33] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-31 02:19:33] [INFO ] Deduced a trap composed of 13 places in 35 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 14338 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 11048 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 25572ms problems are : Problem set: 100 solved, 170 unsolved
Search for dead transitions found 100 dead transitions in 25577ms
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.3 ms
Discarding 70 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 25 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 25712 ms. Remains : 151/375 places, 210/590 transitions.
Built C files in :
/tmp/ltsmin16733915250388322257
[2024-05-31 02:19:51] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16733915250388322257
Running compilation step : cd /tmp/ltsmin16733915250388322257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2183 ms.
Running link step : cd /tmp/ltsmin16733915250388322257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16733915250388322257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased558265672279761112.hoa' '--buchi-type=spotba'
LTSmin run took 750 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 finished in 157148 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 63 ms. Remains 62 /375 variables (removed 313) and now considering 60/590 (removed 530) transitions.
// Phase 1: matrix 60 rows 62 cols
[2024-05-31 02:19:54] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 02:19:54] [INFO ] Implicit Places using invariants in 76 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 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 4 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 147 ms. Remains : 61/375 places, 60/590 transitions.
Stuttering acceptance computed with spot in 41 ms :[false]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 373 ms.
Stack based approach found an accepted trace after 310 steps with 0 reset with depth 311 and stack size 311 in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 finished in 595 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 8 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2024-05-31 02:19:54] [INFO ] Computed 22 invariants in 10 ms
[2024-05-31 02:19:54] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-31 02:19:54] [INFO ] Invariant cache hit.
[2024-05-31 02:19:55] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-05-31 02:19: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
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 30029 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 61173ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61187ms
Finished structural reductions in LTL mode , in 1 iterations and 61726 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 193 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 1710 reset in 678 ms.
Product exploration explored 100000 steps with 1731 reset in 703 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 238 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 293 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 142 steps (0 resets) in 6 ms. (20 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 332 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 197 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-05-31 02:20:59] [INFO ] Invariant cache hit.
[2024-05-31 02:21:02] [INFO ] [Real]Absence check using 22 positive place invariants in 42 ms returned sat
[2024-05-31 02:21:03] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2024-05-31 02:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:21:05] [INFO ] [Nat]Absence check using 22 positive place invariants in 31 ms returned sat
[2024-05-31 02:21:05] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2024-05-31 02:21:06] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 47 ms.
[2024-05-31 02:21:09] [INFO ] Added : 300 causal constraints over 60 iterations in 3396 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 4 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-05-31 02:21:09] [INFO ] Invariant cache hit.
[2024-05-31 02:21:09] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-31 02:21:09] [INFO ] Invariant cache hit.
[2024-05-31 02:21:10] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-05-31 02:21:10] [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
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 30033 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 61500ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61514ms
Finished structural reductions in LTL mode , in 1 iterations and 62197 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 191 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 220 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 148 steps (0 resets) in 7 ms. (18 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 220 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 194 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-05-31 02:22:12] [INFO ] Invariant cache hit.
[2024-05-31 02:22:15] [INFO ] [Real]Absence check using 22 positive place invariants in 29 ms returned sat
[2024-05-31 02:22:16] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2024-05-31 02:22:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:22:18] [INFO ] [Nat]Absence check using 22 positive place invariants in 25 ms returned sat
[2024-05-31 02:22:19] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2024-05-31 02:22:19] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 77 ms.
[2024-05-31 02:22:23] [INFO ] Added : 300 causal constraints over 60 iterations in 4154 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (NOT p2), p1, p1]
Product exploration explored 100000 steps with 1683 reset in 998 ms.
Product exploration explored 100000 steps with 1691 reset in 710 ms.
Built C files in :
/tmp/ltsmin3776450061753128197
[2024-05-31 02:22:25] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3776450061753128197
Running compilation step : cd /tmp/ltsmin3776450061753128197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2161 ms.
Running link step : cd /tmp/ltsmin3776450061753128197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3776450061753128197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16220987198781669292.hoa' '--buchi-type=spotba'
LTSmin run took 414 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 finished in 153387 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 15 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-31 02:22:28] [INFO ] Computed 22 invariants in 8 ms
[2024-05-31 02:22:28] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-31 02:22:28] [INFO ] Invariant cache hit.
[2024-05-31 02:22:28] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-31 02:22:28] [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
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.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)
(s14timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30017 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
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 30031 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 61184ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61195ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61796 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 241 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 2368 reset in 767 ms.
Product exploration explored 100000 steps with 2355 reset in 579 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 203 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 498 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
RANDOM walk for 225 steps (0 resets) in 22 ms. (9 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 346 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 298 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
[2024-05-31 02:23:33] [INFO ] Invariant cache hit.
[2024-05-31 02:23:35] [INFO ] [Real]Absence check using 22 positive place invariants in 24 ms returned sat
[2024-05-31 02:23:36] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2024-05-31 02:23:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:23:39] [INFO ] [Nat]Absence check using 22 positive place invariants in 31 ms returned sat
[2024-05-31 02:23:39] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2024-05-31 02:23:39] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 59 ms.
[2024-05-31 02:23:41] [INFO ] Added : 240 causal constraints over 48 iterations in 2369 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-31 02:23:42] [INFO ] Invariant cache hit.
[2024-05-31 02:23:42] [INFO ] [Real]Absence check using 22 positive place invariants in 37 ms returned sat
[2024-05-31 02:23:42] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2024-05-31 02:23:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:23:43] [INFO ] [Nat]Absence check using 22 positive place invariants in 29 ms returned sat
[2024-05-31 02:23:43] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2024-05-31 02:23:43] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-31 02:23:46] [INFO ] Added : 284 causal constraints over 57 iterations in 2828 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 40 ms. Remains 165 /255 variables (removed 90) and now considering 340/470 (removed 130) transitions.
// Phase 1: matrix 340 rows 165 cols
[2024-05-31 02:23:46] [INFO ] Computed 22 invariants in 6 ms
[2024-05-31 02:23:46] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-31 02:23:46] [INFO ] Invariant cache hit.
[2024-05-31 02:23:47] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-05-31 02:23:47] [INFO ] Redundant transitions in 8 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-31 02:23:47] [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 15345 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 23627 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 39813ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 39821ms
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 40370 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 459 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 299 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
RANDOM walk for 122 steps (0 resets) in 17 ms. (6 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 616 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 259 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
[2024-05-31 02:24:29] [INFO ] Invariant cache hit.
[2024-05-31 02:24:30] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-05-31 02:24:31] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2024-05-31 02:24:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:24:32] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2024-05-31 02:24:32] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-31 02:24:32] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 31 ms.
[2024-05-31 02:24:33] [INFO ] Added : 138 causal constraints over 28 iterations in 955 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-31 02:24:33] [INFO ] Invariant cache hit.
[2024-05-31 02:24:33] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-05-31 02:24:34] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-31 02:24:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:24:34] [INFO ] [Nat]Absence check using 22 positive place invariants in 21 ms returned sat
[2024-05-31 02:24:34] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-05-31 02:24:34] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-31 02:24:35] [INFO ] Added : 144 causal constraints over 29 iterations in 996 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Product exploration explored 100000 steps with 3589 reset in 1629 ms.
Product exploration explored 100000 steps with 3601 reset in 1476 ms.
Built C files in :
/tmp/ltsmin17468320586860196764
[2024-05-31 02:24:39] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2024-05-31 02:24:39] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:24:39] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2024-05-31 02:24:39] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:24:39] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2024-05-31 02:24:39] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:24:39] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17468320586860196764
Running compilation step : cd /tmp/ltsmin17468320586860196764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1735 ms.
Running link step : cd /tmp/ltsmin17468320586860196764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin17468320586860196764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased778274002949384175.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 9 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2024-05-31 02:24:54] [INFO ] Invariant cache hit.
[2024-05-31 02:24:54] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-31 02:24:54] [INFO ] Invariant cache hit.
[2024-05-31 02:24:54] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-31 02:24:54] [INFO ] Redundant transitions in 6 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-31 02:24:54] [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 13819 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 22424 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 37103ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 37108ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37439 ms. Remains : 165/165 places, 340/340 transitions.
Built C files in :
/tmp/ltsmin18402103888135040178
[2024-05-31 02:25:31] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2024-05-31 02:25:31] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:25:31] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2024-05-31 02:25:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:25:31] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2024-05-31 02:25:31] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:25:31] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18402103888135040178
Running compilation step : cd /tmp/ltsmin18402103888135040178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1679 ms.
Running link step : cd /tmp/ltsmin18402103888135040178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin18402103888135040178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18417404265016118439.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 02:25:46] [INFO ] Flatten gal took : 18 ms
[2024-05-31 02:25:46] [INFO ] Flatten gal took : 17 ms
[2024-05-31 02:25:46] [INFO ] Time to serialize gal into /tmp/LTL8974691106839894573.gal : 3 ms
[2024-05-31 02:25:46] [INFO ] Time to serialize properties into /tmp/LTL1181100768998402770.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8974691106839894573.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17884173487113045374.hoa' '-atoms' '/tmp/LTL1181100768998402770.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1181100768998402770.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17884173487113045374.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-31 02:26:01] [INFO ] Flatten gal took : 15 ms
[2024-05-31 02:26:01] [INFO ] Flatten gal took : 15 ms
[2024-05-31 02:26:01] [INFO ] Time to serialize gal into /tmp/LTL9347821850792824276.gal : 3 ms
[2024-05-31 02:26:01] [INFO ] Time to serialize properties into /tmp/LTL6099157139721093421.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9347821850792824276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6099157139721093421.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G(F(((((((((G(!("(((((Finished_2>=1)||(Finished_3>=1))||((Finished_5>=1)||(Finished_4>=1)))||(((Finished_0>=1)||(Finished_1>=1))...9894
Formula 0 simplified : X(G(F"(((((Finished_2>=1)||(Finished_3>=1))||((Finished_5>=1)||(Finished_4>=1)))||(((Finished_0>=1)||(Finished_1>=1))||((Finished_7>...9870
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-31 02:26:16] [INFO ] Flatten gal took : 16 ms
[2024-05-31 02:26:16] [INFO ] Applying decomposition
[2024-05-31 02:26:16] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14739625521055462655.txt' '-o' '/tmp/graph14739625521055462655.bin' '-w' '/tmp/graph14739625521055462655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14739625521055462655.bin' '-l' '-1' '-v' '-w' '/tmp/graph14739625521055462655.weights' '-q' '0' '-e' '0.001'
[2024-05-31 02:26:16] [INFO ] Decomposing Gal with order
[2024-05-31 02:26:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 02:26:17] [INFO ] Removed a total of 528 redundant transitions.
[2024-05-31 02:26:17] [INFO ] Flatten gal took : 37 ms
[2024-05-31 02:26:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 8 ms.
[2024-05-31 02:26:17] [INFO ] Time to serialize gal into /tmp/LTL658570501008656181.gal : 4 ms
[2024-05-31 02:26:17] [INFO ] Time to serialize properties into /tmp/LTL13963369182312295646.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL658570501008656181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13963369182312295646.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G(F(((((((((G(!("(((((i7.u41.Finished_2>=1)||(i0.u42.Finished_3>=1))||((i9.u47.Finished_5>=1)||(i1.u43.Finished_4>=1)))||(((i4.u...13314
Formula 0 simplified : X(G(F"(((((i7.u41.Finished_2>=1)||(i0.u42.Finished_3>=1))||((i9.u47.Finished_5>=1)||(i1.u43.Finished_4>=1)))||(((i4.u46.Finished_0>=...13290
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 finished in 243956 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-05-31 02:26:32] [INFO ] Computed 22 invariants in 4 ms
[2024-05-31 02:26:32] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 02:26:32] [INFO ] Invariant cache hit.
[2024-05-31 02:26:32] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-31 02:26:32] [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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 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]
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 61086ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61108ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61446 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 171 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 61648 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 1 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 0 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 21 ms. Remains 44 /375 variables (removed 331) and now considering 42/590 (removed 548) transitions.
// Phase 1: matrix 42 rows 44 cols
[2024-05-31 02:27:33] [INFO ] Computed 22 invariants in 0 ms
[2024-05-31 02:27:33] [INFO ] Implicit Places using invariants in 58 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 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 84 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-08
Product exploration explored 100000 steps with 1968 reset in 226 ms.
Stack based approach found an accepted trace after 121 steps with 3 reset with depth 35 and stack size 35 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 finished in 393 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 36 ms. Remains 43 /375 variables (removed 332) and now considering 42/590 (removed 548) transitions.
// Phase 1: matrix 42 rows 43 cols
[2024-05-31 02:27:34] [INFO ] Computed 21 invariants in 0 ms
[2024-05-31 02:27:34] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 02:27:34] [INFO ] Invariant cache hit.
[2024-05-31 02:27:34] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-31 02:27:34] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-31 02:27:34] [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 468 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 332 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 810ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 810ms
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 998 ms. Remains : 43/375 places, 42/590 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-09
Product exploration explored 100000 steps with 6208 reset in 201 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 finished in 1282 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 29 ms. Remains 43 /375 variables (removed 332) and now considering 42/590 (removed 548) transitions.
// Phase 1: matrix 42 rows 43 cols
[2024-05-31 02:27:35] [INFO ] Computed 21 invariants in 2 ms
[2024-05-31 02:27:35] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 02:27:35] [INFO ] Invariant cache hit.
[2024-05-31 02:27:35] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-31 02:27:35] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-31 02:27:35] [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 355 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 310 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 671ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 672ms
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 865 ms. Remains : 43/375 places, 42/590 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-12
Product exploration explored 100000 steps with 7492 reset in 320 ms.
Stack based approach found an accepted trace after 18 steps with 1 reset with depth 11 and stack size 11 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 finished in 1264 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 7 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-31 02:27:36] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 02:27:36] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-31 02:27:36] [INFO ] Invariant cache hit.
[2024-05-31 02:27:37] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-31 02:27:37] [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 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]
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 61411ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61430ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62049 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 192 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 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 finished in 62267 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 6 ms. Remains 256 /375 variables (removed 119) and now considering 471/590 (removed 119) transitions.
// Phase 1: matrix 471 rows 256 cols
[2024-05-31 02:28:39] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 02:28:39] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-31 02:28:39] [INFO ] Invariant cache hit.
[2024-05-31 02:28:39] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-05-31 02:28:39] [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 26332 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 30024 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 57346ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 57352ms
Starting structural reductions in LTL mode, iteration 1 : 256/375 places, 471/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57912 ms. Remains : 256/375 places, 471/590 transitions.
Stuttering acceptance computed with spot in 251 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 246 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 finished in 58194 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 115 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 23 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-31 02:29:37] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 02:29:37] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-31 02:29:37] [INFO ] Invariant cache hit.
[2024-05-31 02:29:37] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-31 02:29:37] [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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30013 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 61050ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61059ms
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 61572 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 11130 reset in 1403 ms.
Product exploration explored 100000 steps with 11049 reset in 1468 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 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 143 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 56 steps (0 resets) in 6 ms. (8 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 115 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 130 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-05-31 02:30:42] [INFO ] Invariant cache hit.
[2024-05-31 02:30:43] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-31 02:30:43] [INFO ] Invariant cache hit.
[2024-05-31 02:30:43] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-31 02:30:43] [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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 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]
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 61210ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61220ms
Finished structural reductions in LTL mode , in 1 iterations and 61619 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 309 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 131 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 39 steps (0 resets) in 6 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 350 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 124 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 139 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 11211 reset in 1355 ms.
Product exploration explored 100000 steps with 11062 reset in 1377 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 146 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-05-31 02:31:48] [INFO ] Redundant transitions in 4 ms returned []
Running 460 sub problems to find dead transitions.
[2024-05-31 02:31:48] [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 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]
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 30021 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 61004ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61013ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61039 ms. Remains : 255/255 places, 470/470 transitions.
Built C files in :
/tmp/ltsmin15424672423148565182
[2024-05-31 02:32:49] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15424672423148565182
Running compilation step : cd /tmp/ltsmin15424672423148565182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1919 ms.
Running link step : cd /tmp/ltsmin15424672423148565182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15424672423148565182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3150438355627729616.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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-05-31 02:33:05] [INFO ] Invariant cache hit.
[2024-05-31 02:33:05] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-31 02:33:05] [INFO ] Invariant cache hit.
[2024-05-31 02:33:05] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-31 02:33:05] [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 28460 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 30018 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 59462ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 59469ms
Finished structural reductions in LTL mode , in 1 iterations and 59922 ms. Remains : 255/255 places, 470/470 transitions.
Built C files in :
/tmp/ltsmin15928262617815887741
[2024-05-31 02:34:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15928262617815887741
Running compilation step : cd /tmp/ltsmin15928262617815887741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1575 ms.
Running link step : cd /tmp/ltsmin15928262617815887741;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15928262617815887741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10271984220600779454.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 02:34:20] [INFO ] Flatten gal took : 18 ms
[2024-05-31 02:34:20] [INFO ] Flatten gal took : 18 ms
[2024-05-31 02:34:20] [INFO ] Time to serialize gal into /tmp/LTL915830536050301248.gal : 4 ms
[2024-05-31 02:34:20] [INFO ] Time to serialize properties into /tmp/LTL5586846861629227781.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL915830536050301248.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16539093801012337373.hoa' '-atoms' '/tmp/LTL5586846861629227781.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5586846861629227781.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16539093801012337373.hoa
Detected timeout of ITS tools.
[2024-05-31 02:34:35] [INFO ] Flatten gal took : 19 ms
[2024-05-31 02:34:35] [INFO ] Flatten gal took : 19 ms
[2024-05-31 02:34:35] [INFO ] Time to serialize gal into /tmp/LTL10265730593272315603.gal : 5 ms
[2024-05-31 02:34:35] [INFO ] Time to serialize properties into /tmp/LTL6189619026948397074.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10265730593272315603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6189619026948397074.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(F(((G("(((((((((((IdleTechs_2>=1)&&(OpenRequests_6_2>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)...19596
Formula 0 simplified : XXG((F!"(((((((((((IdleTechs_2>=1)&&(OpenRequests_6_2>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(...19577
Detected timeout of ITS tools.
[2024-05-31 02:34:50] [INFO ] Flatten gal took : 19 ms
[2024-05-31 02:34:50] [INFO ] Applying decomposition
[2024-05-31 02:34:50] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11792505971580782866.txt' '-o' '/tmp/graph11792505971580782866.bin' '-w' '/tmp/graph11792505971580782866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11792505971580782866.bin' '-l' '-1' '-v' '-w' '/tmp/graph11792505971580782866.weights' '-q' '0' '-e' '0.001'
[2024-05-31 02:34:50] [INFO ] Decomposing Gal with order
[2024-05-31 02:34:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 02:34:50] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-31 02:34:50] [INFO ] Flatten gal took : 67 ms
[2024-05-31 02:34:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 16 ms.
[2024-05-31 02:34:50] [INFO ] Time to serialize gal into /tmp/LTL14004991004197095899.gal : 5 ms
[2024-05-31 02:34:50] [INFO ] Time to serialize properties into /tmp/LTL7586023792260849948.ltl : 25 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14004991004197095899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7586023792260849948.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(X(F(((G("(((((((((((i1.i0.u31.IdleTechs_2>=1)&&(i7.i0.u41.OpenRequests_6_2>=1))&&(i7.i0.u40.Idles>=1))||(((i9.i0.u24.IdleTechs_0...29103
Formula 0 simplified : XXG((F!"(((((((((((i1.i0.u31.IdleTechs_2>=1)&&(i7.i0.u41.OpenRequests_6_2>=1))&&(i7.i0.u40.Idles>=1))||(((i9.i0.u24.IdleTechs_0>=1)&...29084
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1262 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.6926,353132,1,0,684171,524,3902,494197,145,1868,1086682
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 finished in 328194 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 TRUE TECHNIQUES SHORTENING_INSENSITIVE
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-05-31 02:35:05] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2512284513051205584
[2024-05-31 02:35:05] [INFO ] Computing symmetric may disable matrix : 590 transitions.
[2024-05-31 02:35:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:35:05] [INFO ] Applying decomposition
[2024-05-31 02:35:05] [INFO ] Computing symmetric may enable matrix : 590 transitions.
[2024-05-31 02:35:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:35:05] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3053329236913432375.txt' '-o' '/tmp/graph3053329236913432375.bin' '-w' '/tmp/graph3053329236913432375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3053329236913432375.bin' '-l' '-1' '-v' '-w' '/tmp/graph3053329236913432375.weights' '-q' '0' '-e' '0.001'
[2024-05-31 02:35:05] [INFO ] Decomposing Gal with order
[2024-05-31 02:35:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 02:35:05] [INFO ] Removed a total of 482 redundant transitions.
[2024-05-31 02:35:05] [INFO ] Computing Do-Not-Accords matrix : 590 transitions.
[2024-05-31 02:35:05] [INFO ] Flatten gal took : 38 ms
[2024-05-31 02:35:05] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:35:05] [INFO ] Built C files in 191ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2512284513051205584
Running compilation step : cd /tmp/ltsmin2512284513051205584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 02:35:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 334 labels/synchronizations in 11 ms.
[2024-05-31 02:35:05] [INFO ] Time to serialize gal into /tmp/LTLFireability4165306301374434876.gal : 5 ms
[2024-05-31 02:35:05] [INFO ] Time to serialize properties into /tmp/LTLFireability1234127548978835169.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4165306301374434876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1234127548978835169.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F(("((((((((((i7.u5.IdleTechs_2>=1)&&(i5.u16.OpenRequests_6_2>=1))&&(i1.u13.Idles>=1))||(((i8.u6.IdleTechs_0>=1)&&(i9.u9.OpenR...13250
Formula 0 simplified : X(G(F"(((((i8.u47.Finished_2>=1)||(i9.u48.Finished_3>=1))||((i4.u42.Finished_5>=1)||(i1.u41.Finished_4>=1)))||(((i0.u40.Finished_0>=...13238
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 3415 ms.
Running link step : cd /tmp/ltsmin2512284513051205584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin2512284513051205584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(([](!(LTLAPp4==true))||(LTLAPp3==true)))) U (LTLAPp4==true)))' '--buchi-type=spotba'
46 unique states visited
0 strongly connected components in search stack
87 transitions explored
45 items max in DFS search stack
10124 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,101.315,1105972,1,0,1.93232e+06,11137,3904,3.10071e+06,631,81374,2573747
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1711577 ms.
BK_STOP 1717123148836
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z4T3N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-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 r444-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 '
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 ;