Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590400764.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is UtilityControlRoom-COL-Z4T4N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590400764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 8.1K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_pt
-rw-r--r-- 1 mcc users 8 May 29 14:33 instance
-rw-r--r-- 1 mcc users 5 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 29K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749271325349

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-07 04:42:06] [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]
[2025-06-07 04:42:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 04:42:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-07 04:42:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-07 04:42:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 634 ms
[2025-06-07 04:42:07] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 376 PT places and 750.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2025-06-07 04:42:07] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2025-06-07 04:42:07] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 7 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 387 steps (0 resets) in 19 ms. (19 steps per ms) remains 0/10 properties
[2025-06-07 04:42:07] [INFO ] Flatten gal took : 15 ms
[2025-06-07 04:42:07] [INFO ] Flatten gal took : 2 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2025-06-07 04:42:07] [INFO ] Unfolded HLPN to a Petri net with 376 places and 750 transitions 2410 arcs in 28 ms.
[2025-06-07 04:42:07] [INFO ] Unfolded 12 HLPN properties in 1 ms.
[2025-06-07 04:42:07] [INFO ] Reduced 30 identical enabling conditions.
[2025-06-07 04:42:07] [INFO ] Reduced 30 identical enabling conditions.
[2025-06-07 04:42:07] [INFO ] Reduced 30 identical enabling conditions.
[2025-06-07 04:42:07] [INFO ] Reduced 30 identical enabling conditions.
[2025-06-07 04:42:07] [INFO ] Reduced 30 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
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 12 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2025-06-07 04:42:08] [INFO ] Computed 23 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:42:08] [INFO ] Implicit Places using invariants in 427 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 467 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 5 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 494 ms. Remains : 375/376 places, 590/590 transitions.
Support contains 335 out of 375 places after structural reductions.
[2025-06-07 04:42:08] [INFO ] Flatten gal took : 57 ms
[2025-06-07 04:42:08] [INFO ] Flatten gal took : 52 ms
[2025-06-07 04:42:08] [INFO ] Input system was already deterministic with 590 transitions.
Reduction of identical properties reduced properties to check from 20 to 16
RANDOM walk for 40000 steps (8 resets) in 1144 ms. (34 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
// Phase 1: matrix 590 rows 375 cols
[2025-06-07 04:42:09] [INFO ] Computed 22 invariants in 16 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 10/965 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((X(X(X(p1))) U (p2&&X(X(X(p1))))))||p0))))'
Support contains 50 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 24 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2025-06-07 04:42:10] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:42:10] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-06-07 04:42:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:42:10] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 04:42:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 60552ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60556ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61366 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 878 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-00
Product exploration explored 100000 steps with 1723 reset in 464 ms.
Product exploration explored 100000 steps with 1698 reset in 368 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 838 ms. Reduced automaton from 16 states, 48 edges and 3 AP (stutter sensitive) to 16 states, 48 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 716 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 10 to 5
RANDOM walk for 40000 steps (8 resets) in 475 ms. (84 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
[2025-06-07 04:43:15] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 50/725 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (G (OR p2 (NOT p0))), (G (OR (NOT p2) p0)), (G (OR p1 (NOT p2) p0)), (G (OR p1 p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR p2 p0))), (F p1)]
Knowledge based reduction with 15 factoid took 331 ms. Reduced automaton from 16 states, 48 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 50 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 5 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2025-06-07 04:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:43:16] [INFO ] Implicit Places using invariants in 299 ms returned []
[2025-06-07 04:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:43:16] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 04:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Finished structural reductions in LTL mode , in 1 iterations and 61040 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 p2 (NOT p1)), (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 212 steps (0 resets) in 7 ms. (26 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 286 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 304 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1720 reset in 276 ms.
Product exploration explored 100000 steps with 1686 reset in 314 ms.
Built C files in :
/tmp/ltsmin12183502208580368580
[2025-06-07 04:44:19] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12183502208580368580
Running compilation step : cd /tmp/ltsmin12183502208580368580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 839 ms.
Running link step : cd /tmp/ltsmin12183502208580368580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12183502208580368580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12054939096096943115.hoa' '--buchi-type=spotba'
LTSmin run took 738 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-00 finished in 131366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))||G(p1))))))'
Support contains 70 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 13 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2025-06-07 04:44:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:44:21] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-06-07 04:44:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:44:21] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 04:44:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60356ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60886 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 350 ms.
Product exploration explored 100000 steps with 0 reset in 403 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) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 147 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 70 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.
[2025-06-07 04:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:45:24] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-07 04:45:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:45:24] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 04:45:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60310ms
Finished structural reductions in LTL mode , in 1 iterations and 60836 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 p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 189 steps (0 resets) in 6 ms. (27 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 308 ms.
Product exploration explored 100000 steps with 0 reset in 358 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 70 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 0 with 90 rules applied. Total rules applied 90 place count 255 transition count 500
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 130 place count 255 transition count 460
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 252 transition count 340
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 252 transition count 340
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 166 place count 222 transition count 310
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 196 place count 222 transition count 310
Deduced a syphon composed of 60 places in 0 ms
Applied a total of 196 rules in 53 ms. Remains 222 /255 variables (removed 33) and now considering 310/470 (removed 160) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:46:26] [INFO ] Redundant transitions in 15 ms returned []
Running 270 sub problems to find dead transitions.
// Phase 1: matrix 310 rows 222 cols
[2025-06-07 04:46:26] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:46:28] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 12 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:46:32] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:46:32] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:46:32] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:46:32] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:46:32] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:46:32] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:46:32] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:46:32] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:46:32] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:46:32] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
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
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 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 TDEAD120 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
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
At refinement iteration 6 (OVERLAPS) 310/532 variables, 222/255 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/255 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/255 constraints. Problems are: Problem set: 90 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 255 constraints, problems are : Problem set: 90 solved, 180 unsolved in 14672 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 90 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 1/1 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/1 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 70/222 variables, 22/23 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 10/33 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/33 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 310/532 variables, 222/255 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 180/435 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/435 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/435 constraints. Problems are: Problem set: 90 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 435 constraints, problems are : Problem set: 90 solved, 180 unsolved in 22964 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 180/270 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37691ms problems are : Problem set: 90 solved, 180 unsolved
Search for dead transitions found 90 dead transitions in 37693ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 222/255 places, 220/470 transitions.
Graph (complete) has 360 edges and 222 vertex of which 162 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 162 /222 variables (removed 60) and now considering 220/220 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 162/255 places, 220/470 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37791 ms. Remains : 162/255 places, 220/470 transitions.
Built C files in :
/tmp/ltsmin10786744244887512934
[2025-06-07 04:47:04] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10786744244887512934
Running compilation step : cd /tmp/ltsmin10786744244887512934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 689 ms.
Running link step : cd /tmp/ltsmin10786744244887512934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10786744244887512934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12363757205350853189.hoa' '--buchi-type=spotba'
LTSmin run took 270 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-01 finished in 164103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 20 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 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 44 ms. Remains 62 /375 variables (removed 313) and now considering 60/590 (removed 530) transitions.
// Phase 1: matrix 60 rows 62 cols
[2025-06-07 04:47:05] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:47:05] [INFO ] Implicit Places using invariants in 53 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 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 2 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 104 ms. Remains : 61/375 places, 60/590 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 204 ms.
Stack based approach found an accepted trace after 1914 steps with 0 reset with depth 1915 and stack size 1914 in 5 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-02 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(!p0) U p1)))))'
Support contains 20 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 9 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2025-06-07 04:47:05] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:47:06] [INFO ] Implicit Places using invariants in 313 ms returned []
[2025-06-07 04:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:47:06] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 04:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60339ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60342ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61038 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), p0, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-03
Product exploration explored 100000 steps with 1593 reset in 299 ms.
Product exploration explored 100000 steps with 1582 reset in 307 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 (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), p0, (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 308 ms. (129 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
[2025-06-07 04:48:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
After SMT solving in domain Real declared 20/725 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/255 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
[2025-06-07 04:48:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:48:08] [INFO ] [Real]Absence check using 22 positive place invariants in 56 ms returned sat
[2025-06-07 04:48:09] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-06-07 04:48:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:48:09] [INFO ] [Nat]Absence check using 22 positive place invariants in 42 ms returned sat
[2025-06-07 04:48:10] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2025-06-07 04:48:10] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 28 ms.
[2025-06-07 04:48:12] [INFO ] Added : 282 causal constraints over 57 iterations in 1998 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 20 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 1 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 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 180 place count 165 transition count 380
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 220 place count 165 transition count 340
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 223 place count 162 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 226 place count 162 transition count 220
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 256 place count 132 transition count 190
Iterating global reduction 1 with 30 rules applied. Total rules applied 286 place count 132 transition count 190
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 316 place count 102 transition count 130
Iterating global reduction 1 with 30 rules applied. Total rules applied 346 place count 102 transition count 130
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 376 place count 72 transition count 100
Iterating global reduction 1 with 30 rules applied. Total rules applied 406 place count 72 transition count 100
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 436 place count 72 transition count 70
Applied a total of 436 rules in 22 ms. Remains 72 /255 variables (removed 183) and now considering 70/470 (removed 400) transitions.
// Phase 1: matrix 70 rows 72 cols
[2025-06-07 04:48:12] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:48:12] [INFO ] Implicit Places using invariants in 55 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/255 places, 70/470 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 71/255 places, 70/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 : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 70 rows 71 cols
[2025-06-07 04:48:12] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:48:12] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2025-06-07 04:48:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-07 04:48:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:48:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2025-06-07 04:48:12] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-07 04:48:12] [INFO ] Computed and/alt/rep : 60/90/60 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-07 04:48:12] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2462 reset in 196 ms.
Product exploration explored 100000 steps with 2532 reset in 212 ms.
Built C files in :
/tmp/ltsmin6714228242283810027
[2025-06-07 04:48:13] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2025-06-07 04:48:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:48:13] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2025-06-07 04:48:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:48:13] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2025-06-07 04:48:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:48:13] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6714228242283810027
Running compilation step : cd /tmp/ltsmin6714228242283810027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 160 ms.
Running link step : cd /tmp/ltsmin6714228242283810027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6714228242283810027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6940007001151532476.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 70/70 transitions.
Applied a total of 0 rules in 5 ms. Remains 71 /71 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2025-06-07 04:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:48:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-07 04:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:48:28] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:48:28] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-07 04:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/71 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/141 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 92 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1280 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/71 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/141 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 60/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/141 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 152 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2647ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2647ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2781 ms. Remains : 71/71 places, 70/70 transitions.
Built C files in :
/tmp/ltsmin10310078546498958011
[2025-06-07 04:48:31] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2025-06-07 04:48:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:48:31] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2025-06-07 04:48:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:48:31] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2025-06-07 04:48:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:48:31] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10310078546498958011
Running compilation step : cd /tmp/ltsmin10310078546498958011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 155 ms.
Running link step : cd /tmp/ltsmin10310078546498958011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10310078546498958011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12736995133777223943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 04:48:46] [INFO ] Flatten gal took : 4 ms
[2025-06-07 04:48:46] [INFO ] Flatten gal took : 3 ms
[2025-06-07 04:48:46] [INFO ] Time to serialize gal into /tmp/LTL3108674557350239185.gal : 1 ms
[2025-06-07 04:48:46] [INFO ] Time to serialize properties into /tmp/LTL1021450072236627246.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3108674557350239185.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7816597385712326314.hoa' '-atoms' '/tmp/LTL1021450072236627246.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1021450072236627246.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7816597385712326314.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 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,0.134497,20596,1,0,23,34395,24,1,1707,14061,59
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-03 finished in 101044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U (X(X(G(!p0)))||(X(X(!p0))&&(X(p1) U (X(G(p1))||(G(!p0)&&X(p1))))))))'
Support contains 60 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 13 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2025-06-07 04:48:46] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:48:47] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-07 04:48:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:48:47] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 04:48:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60360ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60885 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 353 ms :[true, p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-04 finished in 61264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 205 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 5 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2025-06-07 04:49:48] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:49:48] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-07 04:49:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:49:48] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2025-06-07 04:49:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
SMT process timed out in 30330ms, After SMT, problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 30331ms
Finished structural reductions in LTL mode , in 1 iterations and 30736 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 1325 ms.
Product exploration explored 100000 steps with 50000 reset in 1363 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) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-06 finished in 33587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U X((!p2&&X(!p1)))))'
Support contains 60 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 12 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2025-06-07 04:50:21] [INFO ] Computed 22 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:50:22] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-06-07 04:50:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:50:22] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 04:50:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 60330ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61016 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR p1 p2), (AND (NOT p1) p2), (OR p2 p1), (AND (NOT p1) p2), true, p1, p1, (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2365 steps with 176 reset in 14 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-07 finished in 61369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p1))&&p0))))'
Support contains 70 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 5 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2025-06-07 04:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:51:23] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-07 04:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:51:23] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 04:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 60345ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60844 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-08 finished in 61039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(!p1)||(X(!p1)&&p2)))&&X((F(p3)||G(p4)))&&p0)))'
Support contains 65 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 9 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2025-06-07 04:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:52:24] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-07 04:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:52:24] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 04:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60358ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60640 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) p1 (AND (NOT p3) (NOT p4))), (OR (NOT p0) p1 (AND (NOT p3) (NOT p4))), true, p1, (AND (NOT p3) (NOT p4)), p1, (NOT p3)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-09
Product exploration explored 100000 steps with 2523 reset in 445 ms.
Product exploration explored 100000 steps with 2502 reset in 429 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p3 p4), (X (NOT p2)), (X p0), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p3) p4)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 382 ms. Reduced automaton from 7 states, 15 edges and 5 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p3) p1), (OR (NOT p3) p1), p1, p1, (NOT p3)]
RANDOM walk for 434 steps (0 resets) in 6 ms. (62 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p3 p4), (X (NOT p2)), (X p0), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p3) p4)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F p1), (F (NOT p3)), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 9 factoid took 548 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p3) p1), (OR (NOT p3) p1), p1, p1, (NOT p3)]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p3) p1), (OR (NOT p3) p1), p1, p1, (NOT p3)]
Support contains 65 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 4 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2025-06-07 04:53:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:53:27] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-07 04:53:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:53:27] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 04:53:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Finished structural reductions in LTL mode , in 1 iterations and 60650 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 p2) (NOT p1) p3), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p3))), (X (X p3)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 275 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p3) p1), (OR (NOT p3) p1), p1, p1, (NOT p3)]
RANDOM walk for 185 steps (0 resets) in 6 ms. (26 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p3), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p3))), (X (X p3)), (X (X p1)), (X (X (NOT p1))), (F (NOT p3)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 4 factoid took 510 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p3) p1), (OR (NOT p3) p1), p1, p1, (NOT p3)]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p3) p1), (OR (NOT p3) p1), p1, p1, (NOT p3)]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p3) p1), (OR (NOT p3) p1), p1, p1, (NOT p3)]
Product exploration explored 100000 steps with 2515 reset in 386 ms.
Product exploration explored 100000 steps with 2633 reset in 380 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p3) p1), (OR (NOT p3) p1), p1, p1, (NOT p3)]
Support contains 65 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 510
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 255 transition count 510
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 255 transition count 510
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 120 place count 255 transition count 470
Deduced a syphon composed of 80 places in 0 ms
Applied a total of 120 rules in 15 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:54:30] [INFO ] Redundant transitions in 8 ms returned []
Running 460 sub problems to find dead transitions.
// Phase 1: matrix 470 rows 255 cols
[2025-06-07 04:54:30] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:54:34] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 10/255 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:54:41] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:54:41] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:54:41] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:54:41] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:54:42] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:54:42] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:54:42] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:54:42] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:54:42] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:54:42] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
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
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 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/255 variables, 10/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 470/725 variables, 255/288 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/288 constraints. Problems are: Problem set: 120 solved, 340 unsolved
(t20 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 1.0)
(t8 1.0)
(t9 1.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0timeout
) 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 288 constraints, problems are : Problem set: 120 solved, 340 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 120 solved, 340 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 90/255 variables, 22/23 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 10/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 470/725 variables, 255/288 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 340/628 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/628 constraints. Problems are: Problem set: 120 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 628 constraints, problems are : Problem set: 120 solved, 340 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 340/460 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60254ms problems are : Problem set: 120 solved, 340 unsolved
Search for dead transitions found 120 dead transitions in 60255ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 255/255 places, 350/470 transitions.
Graph (complete) has 530 edges and 255 vertex of which 175 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.1 ms
Discarding 80 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 175 /255 variables (removed 80) and now considering 350/350 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 175/255 places, 350/470 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60306 ms. Remains : 175/255 places, 350/470 transitions.
Built C files in :
/tmp/ltsmin11348511483282213821
[2025-06-07 04:55:31] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11348511483282213821
Running compilation step : cd /tmp/ltsmin11348511483282213821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 748 ms.
Running link step : cd /tmp/ltsmin11348511483282213821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11348511483282213821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased350467751273871750.hoa' '--buchi-type=spotba'
LTSmin run took 309 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-09 finished in 188098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 55 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: 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
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 2 with 20 rules applied. Total rules applied 460 place count 165 transition count 340
Applied a total of 460 rules in 21 ms. Remains 165 /375 variables (removed 210) and now considering 340/590 (removed 250) transitions.
// Phase 1: matrix 340 rows 165 cols
[2025-06-07 04:55:32] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:55:32] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-07 04:55:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:55:32] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:55:32] [INFO ] Redundant transitions in 4 ms returned []
Running 290 sub problems to find dead transitions.
[2025-06-07 04:55:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 16052 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46246ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 46247ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/375 places, 340/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46490 ms. Remains : 165/375 places, 340/590 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-11
Product exploration explored 100000 steps with 4289 reset in 609 ms.
Product exploration explored 100000 steps with 4303 reset in 622 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 377 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 81 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 465 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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 8 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2025-06-07 04:56:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:56:21] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 04:56:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:56:21] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:56:21] [INFO ] Redundant transitions in 2 ms returned []
Running 290 sub problems to find dead transitions.
[2025-06-07 04:56:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 15417 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45631ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 45632ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45848 ms. Remains : 165/165 places, 340/340 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) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 349 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 93 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 476 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4292 reset in 624 ms.
Product exploration explored 100000 steps with 4279 reset in 665 ms.
Built C files in :
/tmp/ltsmin17519986379569903715
[2025-06-07 04:57:09] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2025-06-07 04:57:09] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:57:09] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2025-06-07 04:57:09] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:57:09] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2025-06-07 04:57:09] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:57:09] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17519986379569903715
Running compilation step : cd /tmp/ltsmin17519986379569903715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 742 ms.
Running link step : cd /tmp/ltsmin17519986379569903715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17519986379569903715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16783707433720333215.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 8 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2025-06-07 04:57:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:57:24] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 04:57:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:57:24] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:57:24] [INFO ] Redundant transitions in 1 ms returned []
Running 290 sub problems to find dead transitions.
[2025-06-07 04:57:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 15981 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46181ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 46182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46383 ms. Remains : 165/165 places, 340/340 transitions.
Built C files in :
/tmp/ltsmin11383253909223974261
[2025-06-07 04:58:10] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2025-06-07 04:58:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:58:10] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2025-06-07 04:58:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:58:10] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2025-06-07 04:58:10] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:58:10] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11383253909223974261
Running compilation step : cd /tmp/ltsmin11383253909223974261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 736 ms.
Running link step : cd /tmp/ltsmin11383253909223974261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11383253909223974261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4672160214385947105.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 04:58:25] [INFO ] Flatten gal took : 17 ms
[2025-06-07 04:58:26] [INFO ] Flatten gal took : 16 ms
[2025-06-07 04:58:26] [INFO ] Time to serialize gal into /tmp/LTL16649363337997764511.gal : 3 ms
[2025-06-07 04:58:26] [INFO ] Time to serialize properties into /tmp/LTL13012636327507526316.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16649363337997764511.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2626151975402199760.hoa' '-atoms' '/tmp/LTL13012636327507526316.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13012636327507526316.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2626151975402199760.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 04:58:41] [INFO ] Flatten gal took : 14 ms
[2025-06-07 04:58:41] [INFO ] Flatten gal took : 14 ms
[2025-06-07 04:58:41] [INFO ] Time to serialize gal into /tmp/LTL1390245752517932131.gal : 3 ms
[2025-06-07 04:58:41] [INFO ] Time to serialize properties into /tmp/LTL13825803994345652396.ltl : 4 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1390245752517932131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13825803994345652396.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((Finished_2>=1)||(Finished_3>=1))||((Finished_5>=1)||(Finished_4>=1)))||(((Finished_0>=1)||(Finished_1>=1))||((Finished_7>...2421
Formula 0 simplified : G(F!"(((((((((IdleTechs_2<1)||(OpenRequests_26<1))||(Idles<1))&&(((IdleTechs_0<1)||(OpenRequests_12<1))||(Idles<1)))&&((((IdleTechs_...2414
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 04:58:56] [INFO ] Flatten gal took : 19 ms
[2025-06-07 04:58:56] [INFO ] Applying decomposition
[2025-06-07 04:58:56] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1139287364738129629.txt' '-o' '/tmp/graph1139287364738129629.bin' '-w' '/tmp/graph1139287364738129629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1139287364738129629.bin' '-l' '-1' '-v' '-w' '/tmp/graph1139287364738129629.weights' '-q' '0' '-e' '0.001'
[2025-06-07 04:58:56] [INFO ] Decomposing Gal with order
[2025-06-07 04:58:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 04:58:56] [INFO ] Removed a total of 528 redundant transitions.
[2025-06-07 04:58:56] [INFO ] Flatten gal took : 87 ms
[2025-06-07 04:58:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 16 ms.
[2025-06-07 04:58:56] [INFO ] Time to serialize gal into /tmp/LTL15135650930979603853.gal : 4 ms
[2025-06-07 04:58:56] [INFO ] Time to serialize properties into /tmp/LTL11109744663356063799.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15135650930979603853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11109744663356063799.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((i5.u45.Finished_2>=1)||(i6.u40.Finished_3>=1))||((i8.u47.Finished_5>=1)||(i2.u46.Finished_4>=1)))||(((i0.u43.Finished_0>=...3311
Formula 0 simplified : G(F!"(((((((((i0.u21.IdleTechs_2<1)||(i3.u32.OpenRequests_26<1))||(i5.u24.Idles<1))&&(((i8.u30.IdleTechs_0<1)||(i6.u6.OpenRequests_1...3304
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-11 finished in 219291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F((G(F(p1))||(X(X(F(p1)))&&(p0 U (p2||G(p0)))))))))))'
Support contains 255 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 4 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2025-06-07 04:59:11] [INFO ] Computed 22 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:59:11] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-07 04:59:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:59:11] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2025-06-07 04:59:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
SMT process timed out in 30333ms, After SMT, problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 30335ms
Finished structural reductions in LTL mode , in 1 iterations and 30721 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-12
Product exploration explored 100000 steps with 20156 reset in 878 ms.
Product exploration explored 100000 steps with 20246 reset in 890 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (OR p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 121 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 703 ms. (56 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 864 ms. (46 steps per ms) remains 1/1 properties
[2025-06-07 04:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
After SMT solving in domain Real declared 210/965 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (OR p2 p0))), (G (OR (NOT p2) p0))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 374 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 255 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.
[2025-06-07 04:59:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:59:46] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-07 04:59:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:59:46] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2025-06-07 04:59:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
SMT process timed out in 30397ms, After SMT, problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 30398ms
Finished structural reductions in LTL mode , in 1 iterations and 30740 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 p0 p2 p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 1118 steps (0 resets) in 23 ms. (46 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2 p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 20125 reset in 589 ms.
Product exploration explored 100000 steps with 20158 reset in 616 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, false, false]
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 255 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 12 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:00:20] [INFO ] Redundant transitions in 6 ms returned []
Running 580 sub problems to find dead transitions.
[2025-06-07 05:00:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
SMT process timed out in 30372ms, After SMT, problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 30374ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30402 ms. Remains : 375/375 places, 590/590 transitions.
Built C files in :
/tmp/ltsmin3474940407315929033
[2025-06-07 05:00:51] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3474940407315929033
Running compilation step : cd /tmp/ltsmin3474940407315929033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 968 ms.
Running link step : cd /tmp/ltsmin3474940407315929033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3474940407315929033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6962025079061563731.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 255 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.
[2025-06-07 05:01:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:01:06] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-07 05:01:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:01:06] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2025-06-07 05:01:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
SMT process timed out in 30320ms, After SMT, problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 30323ms
Finished structural reductions in LTL mode , in 1 iterations and 30661 ms. Remains : 375/375 places, 590/590 transitions.
Built C files in :
/tmp/ltsmin2191267714948607767
[2025-06-07 05:01:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2191267714948607767
Running compilation step : cd /tmp/ltsmin2191267714948607767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 944 ms.
Running link step : cd /tmp/ltsmin2191267714948607767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2191267714948607767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7316818514470971342.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 05:01:52] [INFO ] Flatten gal took : 22 ms
[2025-06-07 05:01:52] [INFO ] Flatten gal took : 20 ms
[2025-06-07 05:01:52] [INFO ] Time to serialize gal into /tmp/LTL4564875586048935222.gal : 4 ms
[2025-06-07 05:01:52] [INFO ] Time to serialize properties into /tmp/LTL17980488945940478091.prop : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4564875586048935222.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6074019182952889400.hoa' '-atoms' '/tmp/LTL17980488945940478091.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17980488945940478091.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6074019182952889400.hoa
Detected timeout of ITS tools.
[2025-06-07 05:02:07] [INFO ] Flatten gal took : 22 ms
[2025-06-07 05:02:07] [INFO ] Flatten gal took : 22 ms
[2025-06-07 05:02:07] [INFO ] Time to serialize gal into /tmp/LTL6389238297529123482.gal : 3 ms
[2025-06-07 05:02:07] [INFO ] Time to serialize properties into /tmp/LTL586249541620051876.ltl : 4 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6389238297529123482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL586249541620051876.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("((((((((StartSecuring_8<1)||(ClientsWaiting_2<1))&&((StartSecuring_28<1)||(ClientsWaiting_7<1)))&&(((StartSecuring_18<1)|...28412
Formula 0 simplified : XXF(X!"((((((((StartSecuring_8<1)||(ClientsWaiting_2<1))&&((StartSecuring_28<1)||(ClientsWaiting_7<1)))&&(((StartSecuring_18<1)||(Cl...26474
Detected timeout of ITS tools.
[2025-06-07 05:02:22] [INFO ] Flatten gal took : 20 ms
[2025-06-07 05:02:22] [INFO ] Applying decomposition
[2025-06-07 05:02:22] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12200157886765426170.txt' '-o' '/tmp/graph12200157886765426170.bin' '-w' '/tmp/graph12200157886765426170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12200157886765426170.bin' '-l' '-1' '-v' '-w' '/tmp/graph12200157886765426170.weights' '-q' '0' '-e' '0.001'
[2025-06-07 05:02:22] [INFO ] Decomposing Gal with order
[2025-06-07 05:02:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 05:02:22] [INFO ] Removed a total of 483 redundant transitions.
[2025-06-07 05:02:22] [INFO ] Flatten gal took : 50 ms
[2025-06-07 05:02:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 18 ms.
[2025-06-07 05:02:22] [INFO ] Time to serialize gal into /tmp/LTL12741951010395344234.gal : 9 ms
[2025-06-07 05:02:22] [INFO ] Time to serialize properties into /tmp/LTL2608754850302732010.ltl : 5 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12741951010395344234.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2608754850302732010.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("((((((((i10.u34.StartSecuring_8<1)||(i10.u46.ClientsWaiting_2<1))&&((i3.u49.StartSecuring_28<1)||(i3.u49.ClientsWaiting_7...37264
Formula 0 simplified : XXF(X!"((((((((i10.u34.StartSecuring_8<1)||(i10.u46.ClientsWaiting_2<1))&&((i3.u49.StartSecuring_28<1)||(i3.u49.ClientsWaiting_7<1))...34766
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 items max in DFS search stack
805 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,8.15375,316216,1,0,539800,6791,4443,563834,694,43200,694718
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-12 finished in 200734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2025-06-07 05:02:32] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2363333060794991207
[2025-06-07 05:02:32] [INFO ] Computing symmetric may disable matrix : 590 transitions.
[2025-06-07 05:02:32] [INFO ] Applying decomposition
[2025-06-07 05:02:32] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:02:32] [INFO ] Computing symmetric may enable matrix : 590 transitions.
[2025-06-07 05:02:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:02:32] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17069404869162514324.txt' '-o' '/tmp/graph17069404869162514324.bin' '-w' '/tmp/graph17069404869162514324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17069404869162514324.bin' '-l' '-1' '-v' '-w' '/tmp/graph17069404869162514324.weights' '-q' '0' '-e' '0.001'
[2025-06-07 05:02:32] [INFO ] Decomposing Gal with order
[2025-06-07 05:02:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 05:02:32] [INFO ] Computing Do-Not-Accords matrix : 590 transitions.
[2025-06-07 05:02:32] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:02:32] [INFO ] Removed a total of 482 redundant transitions.
[2025-06-07 05:02:32] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2363333060794991207
Running compilation step : cd /tmp/ltsmin2363333060794991207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-07 05:02:32] [INFO ] Flatten gal took : 36 ms
[2025-06-07 05:02:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 328 labels/synchronizations in 9 ms.
[2025-06-07 05:02:32] [INFO ] Time to serialize gal into /tmp/LTLFireability6086583259602740301.gal : 4 ms
[2025-06-07 05:02:32] [INFO ] Time to serialize properties into /tmp/LTLFireability10581602830899720293.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6086583259602740301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10581602830899720293.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((i10.u46.Finished_2>=1)||(i5.u47.Finished_3>=1))||((i1.u42.Finished_5>=1)||(i7.u41.Finished_4>=1)))||(((i6.u40.Finished_0>...3173
Formula 0 simplified : G(F!"(((((((((i3.u26.IdleTechs_2<1)||(i4.u17.OpenRequests_26<1))||(u31.Idles<1))&&(((i0.u3.IdleTechs_0<1)||(i5.u8.OpenRequests_12<1)...3166
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 1428 ms.
Running link step : cd /tmp/ltsmin2363333060794991207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2363333060794991207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-07 05:29:20] [INFO ] Applying decomposition
[2025-06-07 05:29:20] [INFO ] Flatten gal took : 37 ms
[2025-06-07 05:29:20] [INFO ] Decomposing Gal with order
[2025-06-07 05:29:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 05:29:20] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to Idles in partition [Clients_0, ControlRoomDispatch_0, Finished_0, ClientsWaiting_0, ClientsTimeout_0],[Clients_1, ControlRoomDispatch_1, Finished_1, ClientsWaiting_1, ClientsTimeout_1],[Clients_2, ControlRoomDispatch_2, Finished_2, ClientsWaiting_2, ClientsTimeout_2],[Clients_3, ControlRoomDispatch_3, Finished_3, ClientsWaiting_3, ClientsTimeout_3],[Clients_4, ControlRoomDispatch_4, Finished_4, ClientsWaiting_4, ClientsTimeout_4],[Clients_5, ControlRoomDispatch_5, Finished_5, ClientsWaiting_5, ClientsTimeout_5],[Clients_6, ControlRoomDispatch_6, Finished_6, ClientsWaiting_6, ClientsTimeout_6],[Clients_7, ControlRoomDispatch_7, Finished_7, ClientsWaiting_7, ClientsTimeout_7],[Clients_8, ControlRoomDispatch_8, Finished_8, ClientsWaiting_8, ClientsTimeout_8],[Clients_9, ControlRoomDispatch_9, Finished_9, ClientsWaiting_9, ClientsTimeout_9],[MovetoZ_0],[MovetoZ_1],[MovetoZ_2],[MovetoZ_3],[MovetoZ_4],[MovetoZ_5],[MovetoZ_6],[MovetoZ_7],[MovetoZ_8],[MovetoZ_9],[MovetoZ_10],[MovetoZ_11],[MovetoZ_12],[MovetoZ_13],[MovetoZ_14],[MovetoZ_15],[MovetoZ_16],[MovetoZ_17],[MovetoZ_18],[MovetoZ_19],[MovetoZ_20],[MovetoZ_21],[MovetoZ_22],[MovetoZ_23],[MovetoZ_24],[MovetoZ_25],[MovetoZ_26],[MovetoZ_27],[MovetoZ_28],[MovetoZ_29],[MovetoZ_30],[MovetoZ_31],[MovetoZ_32],[MovetoZ_33],[MovetoZ_34],[MovetoZ_35],[MovetoZ_36],[MovetoZ_37],[MovetoZ_38],[MovetoZ_39],[MovetoZ_40],[MovetoZ_41],[MovetoZ_42],[MovetoZ_43],[MovetoZ_44],[MovetoZ_45],[MovetoZ_46],[MovetoZ_47],[MovetoZ_48],[MovetoZ_49],[MovetoZ_50],[MovetoZ_51],[MovetoZ_52],[MovetoZ_53],[MovetoZ_54],[MovetoZ_55],[MovetoZ_56],[MovetoZ_57],[MovetoZ_58],[MovetoZ_59],[MovetoZ_60],[MovetoZ_61],[MovetoZ_62],[MovetoZ_63],[MovetoZ_64],[MovetoZ_65],[MovetoZ_66],[MovetoZ_67],[MovetoZ_68],[MovetoZ_69],[MovetoZ_70],[MovetoZ_71],[MovetoZ_72],[MovetoZ_73],[MovetoZ_74],[MovetoZ_75],[MovetoZ_76],[MovetoZ_77],[MovetoZ_78],[MovetoZ_79],[MovetoZ_80],[MovetoZ_81],[MovetoZ_82],[MovetoZ_83],[MovetoZ_84],[MovetoZ_85],[MovetoZ_86],[MovetoZ_87],[MovetoZ_88],[MovetoZ_89],[MovetoZ_90],[MovetoZ_91],[MovetoZ_92],[MovetoZ_93],[MovetoZ_94],[MovetoZ_95],[MovetoZ_96],[MovetoZ_97],[MovetoZ_98],[MovetoZ_99],[MovetoZ_100],[MovetoZ_101],[MovetoZ_102],[MovetoZ_103],[MovetoZ_104],[MovetoZ_105],[MovetoZ_106],[MovetoZ_107],[MovetoZ_108],[MovetoZ_109],[MovetoZ_110],[MovetoZ_111],[MovetoZ_112],[MovetoZ_113],[MovetoZ_114],[MovetoZ_115],[MovetoZ_116],[MovetoZ_117],[MovetoZ_118],[MovetoZ_119],[MovetoZ_120],[MovetoZ_121],[MovetoZ_122],[MovetoZ_123],[MovetoZ_124],[MovetoZ_125],[MovetoZ_126],[MovetoZ_127],[MovetoZ_128],[MovetoZ_129],[MovetoZ_130],[MovetoZ_131],[MovetoZ_132],[MovetoZ_133],[MovetoZ_134],[MovetoZ_135],[MovetoZ_136],[MovetoZ_137],[MovetoZ_138],[MovetoZ_139],[MovetoZ_140],[MovetoZ_141],[MovetoZ_142],[MovetoZ_143],[MovetoZ_144],[MovetoZ_145],[MovetoZ_146],[MovetoZ_147],[MovetoZ_148],[MovetoZ_149],[MovetoZ_150],[MovetoZ_151],[MovetoZ_152],[MovetoZ_153],[MovetoZ_154],[MovetoZ_155],[MovetoZ_156],[MovetoZ_157],[MovetoZ_158],[MovetoZ_159],[OpenRequests_0, Assigned_0, StartSecuring_0, DoSecuring_0],[OpenRequests_1, Assigned_1, StartSecuring_1, DoSecuring_1],[OpenRequests_2, Assigned_2, StartSecuring_2, DoSecuring_2],[OpenRequests_3, Assigned_3, StartSecuring_3, DoSecuring_3],[OpenRequests_4, Assigned_4, StartSecuring_4, DoSecuring_4],[OpenRequests_5, Assigned_5, StartSecuring_5, DoSecuring_5],[OpenRequests_6, Assigned_6, StartSecuring_6, DoSecuring_6],[OpenRequests_7, Assigned_7, StartSecuring_7, DoSecuring_7],[OpenRequests_8, Assigned_8, StartSecuring_8, DoSecuring_8],[OpenRequests_9, Assigned_9, StartSecuring_9, DoSecuring_9],[OpenRequests_10, Assigned_10, StartSecuring_10, DoSecuring_10],[OpenRequests_11, Assigned_11, StartSecuring_11, DoSecuring_11],[OpenRequests_12, Assigned_12, StartSecuring_12, DoSecuring_12],[OpenRequests_13, Assigned_13, StartSecuring_13, DoSecuring_13],[OpenRequests_14, Assigned_14, StartSecuring_14, DoSecuring_14],[OpenRequests_15, Assigned_15, StartSecuring_15, DoSecuring_15],[OpenRequests_16, Assigned_16, StartSecuring_16, DoSecuring_16],[OpenRequests_17, Assigned_17, StartSecuring_17, DoSecuring_17],[OpenRequests_18, Assigned_18, StartSecuring_18, DoSecuring_18],[OpenRequests_19, Assigned_19, StartSecuring_19, DoSecuring_19],[OpenRequests_20, Assigned_20, StartSecuring_20, DoSecuring_20],[OpenRequests_21, Assigned_21, StartSecuring_21, DoSecuring_21],[OpenRequests_22, Assigned_22, StartSecuring_22, DoSecuring_22],[OpenRequests_23, Assigned_23, StartSecuring_23, DoSecuring_23],[OpenRequests_24, Assigned_24, StartSecuring_24, DoSecuring_24],[OpenRequests_25, Assigned_25, StartSecuring_25, DoSecuring_25],[OpenRequests_26, Assigned_26, StartSecuring_26, DoSecuring_26],[OpenRequests_27, Assigned_27, StartSecuring_27, DoSecuring_27],[OpenRequests_28, Assigned_28, StartSecuring_28, DoSecuring_28],[OpenRequests_29, Assigned_29, StartSecuring_29, DoSecuring_29],[OpenRequests_30, Assigned_30, StartSecuring_30, DoSecuring_30],[OpenRequests_31, Assigned_31, StartSecuring_31, DoSecuring_31],[OpenRequests_32, Assigned_32, StartSecuring_32, DoSecuring_32],[OpenRequests_33, Assigned_33, StartSecuring_33, DoSecuring_33],[OpenRequests_34, Assigned_34, StartSecuring_34, DoSecuring_34],[OpenRequests_35, Assigned_35, StartSecuring_35, DoSecuring_35],[OpenRequests_36, Assigned_36, StartSecuring_36, DoSecuring_36],[OpenRequests_37, Assigned_37, StartSecuring_37, DoSecuring_37],[OpenRequests_38, Assigned_38, StartSecuring_38, DoSecuring_38],[OpenRequests_39, Assigned_39, StartSecuring_39, DoSecuring_39],[IdleTechs_0],[IdleTechs_1],[IdleTechs_2],[IdleTechs_3],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1028)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-07 05:29:20] [INFO ] Flatten gal took : 24 ms
[2025-06-07 05:29:20] [INFO ] Time to serialize gal into /tmp/LTLFireability16147098699943962621.gal : 5 ms
[2025-06-07 05:29:20] [INFO ] Time to serialize properties into /tmp/LTLFireability1714112904024327503.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16147098699943962621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1714112904024327503.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((Finished_2>=1)||(Finished_3>=1))||((Finished_5>=1)||(Finished_4>=1)))||(((Finished_0>=1)||(Finished_1>=1))||((Finished_7>...2421
Formula 0 simplified : G(F!"(((((((((IdleTechs_2<1)||(OpenRequests_26<1))||(Idles<1))&&(((IdleTechs_0<1)||(OpenRequests_12<1))||(Idles<1)))&&((((IdleTechs_...2414

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-COL-Z4T4N10"
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-5832"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-COL-Z4T4N10, 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 r240-tall-174915590400764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N10.tgz
mv UtilityControlRoom-COL-Z4T4N10 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.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;