Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r444-smll-171701110800140.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is UtilityControlRoom-COL-Z4T4N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701110800140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 11K Apr 13 06:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 06:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 05:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 05:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 06:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 13 06:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 13 06:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 06:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-COL-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 1717102486332

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 202405141337
[2024-05-30 20:54:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 20:54:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 20:54:49] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 20:54:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 20:54:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1286 ms
[2024-05-30 20:54:50] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 376 PT places and 750.0 transition bindings in 33 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 20:54:50] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 7 ms.
[2024-05-30 20:54:50] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 293 steps (0 resets) in 21 ms. (13 steps per ms) remains 0/8 properties
[2024-05-30 20:54:51] [INFO ] Flatten gal took : 29 ms
[2024-05-30 20:54:51] [INFO ] Flatten gal took : 8 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
[2024-05-30 20:54:51] [INFO ] Unfolded HLPN to a Petri net with 376 places and 750 transitions 2410 arcs in 77 ms.
[2024-05-30 20:54:51] [INFO ] Unfolded 13 HLPN properties in 1 ms.
[2024-05-30 20:54:51] [INFO ] Reduced 30 identical enabling conditions.
[2024-05-30 20:54:51] [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 20 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2024-05-30 20:54:51] [INFO ] Computed 23 invariants in 57 ms
[2024-05-30 20:54:51] [INFO ] Implicit Places using invariants in 487 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 547 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 375/376 places, 590/590 transitions.
Applied a total of 0 rules in 9 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 592 ms. Remains : 375/376 places, 590/590 transitions.
Support contains 335 out of 375 places after structural reductions.
[2024-05-30 20:54:52] [INFO ] Flatten gal took : 129 ms
[2024-05-30 20:54:52] [INFO ] Flatten gal took : 128 ms
[2024-05-30 20:54:52] [INFO ] Input system was already deterministic with 590 transitions.
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 191 steps (0 resets) in 49 ms. (3 steps per ms) remains 0/10 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 95 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 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 380 place count 205 transition count 380
Applied a total of 380 rules in 109 ms. Remains 205 /375 variables (removed 170) and now considering 380/590 (removed 210) transitions.
// Phase 1: matrix 380 rows 205 cols
[2024-05-30 20:54:53] [INFO ] Computed 22 invariants in 6 ms
[2024-05-30 20:54:53] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-30 20:54:53] [INFO ] Invariant cache hit.
[2024-05-30 20:54:53] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-30 20:54:53] [INFO ] Redundant transitions in 42 ms returned []
Running 330 sub problems to find dead transitions.
[2024-05-30 20:54:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 227 constraints, problems are : Problem set: 0 solved, 330 unsolved in 22179 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 330/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 557 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
After SMT, in 53424ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 53455ms
Starting structural reductions in SI_LTL mode, iteration 1 : 205/375 places, 380/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54066 ms. Remains : 205/375 places, 380/590 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-00
Product exploration explored 100000 steps with 5810 reset in 1148 ms.
Product exploration explored 100000 steps with 5789 reset in 870 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 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 79 steps (0 resets) in 8 ms. (8 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 95 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 380/380 transitions.
Applied a total of 0 rules in 27 ms. Remains 205 /205 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2024-05-30 20:55:50] [INFO ] Invariant cache hit.
[2024-05-30 20:55:50] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-30 20:55:50] [INFO ] Invariant cache hit.
[2024-05-30 20:55:51] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-30 20:55:51] [INFO ] Redundant transitions in 10 ms returned []
Running 330 sub problems to find dead transitions.
[2024-05-30 20:55:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 227 constraints, problems are : Problem set: 0 solved, 330 unsolved in 23584 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 330/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 557 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
After SMT, in 54497ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 54506ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54909 ms. Remains : 205/205 places, 380/380 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 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 99 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5772 reset in 905 ms.
Product exploration explored 100000 steps with 5800 reset in 767 ms.
Built C files in :
/tmp/ltsmin12913705605523092988
[2024-05-30 20:56:48] [INFO ] Computing symmetric may disable matrix : 380 transitions.
[2024-05-30 20:56:48] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 20:56:48] [INFO ] Computing symmetric may enable matrix : 380 transitions.
[2024-05-30 20:56:48] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 20:56:48] [INFO ] Computing Do-Not-Accords matrix : 380 transitions.
[2024-05-30 20:56:48] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 20:56:48] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12913705605523092988
Running compilation step : cd /tmp/ltsmin12913705605523092988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2124 ms.
Running link step : cd /tmp/ltsmin12913705605523092988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin12913705605523092988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2581694873457390711.hoa' '--buchi-type=spotba'
LTSmin run took 2192 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-00 finished in 119723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 50 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
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 363 place count 212 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 366 place count 212 transition count 270
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 396 place count 182 transition count 240
Iterating global reduction 2 with 30 rules applied. Total rules applied 426 place count 182 transition count 240
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 61 rules applied. Total rules applied 487 place count 151 transition count 210
Applied a total of 487 rules in 50 ms. Remains 151 /375 variables (removed 224) and now considering 210/590 (removed 380) transitions.
// Phase 1: matrix 210 rows 151 cols
[2024-05-30 20:56:53] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 20:56:53] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-30 20:56:53] [INFO ] Invariant cache hit.
[2024-05-30 20:56:53] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-30 20:56:53] [INFO ] Redundant transitions in 1 ms returned []
Running 170 sub problems to find dead transitions.
[2024-05-30 20:56:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/151 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 210/361 variables, 151/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 172 constraints, problems are : Problem set: 0 solved, 170 unsolved in 6260 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/151 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 210/361 variables, 151/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 170/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 342 constraints, problems are : Problem set: 0 solved, 170 unsolved in 9459 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
After SMT, in 15844ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 15847ms
Starting structural reductions in SI_LTL mode, iteration 1 : 151/375 places, 210/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16139 ms. Remains : 151/375 places, 210/590 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 636 ms.
Stack based approach found an accepted trace after 67621 steps with 0 reset with depth 67622 and stack size 67599 in 492 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-01 finished in 17330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 82 transition count 70
Deduced a syphon composed of 10 places in 1 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 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 717 place count 51 transition count 50
Applied a total of 717 rules in 49 ms. Remains 51 /375 variables (removed 324) and now considering 50/590 (removed 540) transitions.
// Phase 1: matrix 50 rows 51 cols
[2024-05-30 20:57:10] [INFO ] Computed 21 invariants in 0 ms
[2024-05-30 20:57:10] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 20:57:10] [INFO ] Invariant cache hit.
[2024-05-30 20:57:10] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-30 20:57:10] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-30 20:57:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 72 constraints, problems are : Problem set: 0 solved, 40 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 112 constraints, problems are : Problem set: 0 solved, 40 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1549ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1549ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/375 places, 50/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1766 ms. Remains : 51/375 places, 50/590 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 413 ms.
Stack based approach found an accepted trace after 317 steps with 0 reset with depth 318 and stack size 318 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-02 finished in 2262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p1))||p0))))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 45 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-30 20:57:12] [INFO ] Computed 22 invariants in 5 ms
[2024-05-30 20:57:12] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-30 20:57:12] [INFO ] Invariant cache hit.
[2024-05-30 20:57:13] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 20:57:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
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 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 61293ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61304ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62053 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-03
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-03 finished in 62313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(p1)))'
Support contains 55 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 11 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-05-30 20:58:14] [INFO ] Invariant cache hit.
[2024-05-30 20:58:15] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-30 20:58:15] [INFO ] Invariant cache hit.
[2024-05-30 20:58:15] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 20:58:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
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]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 61453ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61465ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62117 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 1518 ms.
Product exploration explored 100000 steps with 50000 reset in 1510 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 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-04 finished in 65357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 82 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 72 transition count 70
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 696 place count 62 transition count 60
Applied a total of 696 rules in 37 ms. Remains 62 /375 variables (removed 313) and now considering 60/590 (removed 530) transitions.
// Phase 1: matrix 60 rows 62 cols
[2024-05-30 20:59:20] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 20:59:20] [INFO ] Implicit Places using invariants in 77 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/375 places, 60/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 61/375 places, 60/590 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-05
Product exploration explored 100000 steps with 7309 reset in 241 ms.
Product exploration explored 100000 steps with 7284 reset in 263 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
RANDOM walk for 49 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
// Phase 1: matrix 60 rows 61 cols
[2024-05-30 20:59:21] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 20:59:21] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-05-30 20:59:21] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-30 20:59:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 20:59:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-30 20:59:21] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-30 20:59:21] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 20:59:21] [INFO ] Added : 4 causal constraints over 1 iterations in 29 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 20:59:21] [INFO ] Invariant cache hit.
[2024-05-30 20:59:21] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-30 20:59:21] [INFO ] Invariant cache hit.
[2024-05-30 20:59:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-30 20:59:21] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-30 20:59:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 11/61 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 60/121 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 82 constraints, problems are : Problem set: 0 solved, 40 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 11/61 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 60/121 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 122 constraints, problems are : Problem set: 0 solved, 40 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1664ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1665ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1844 ms. Remains : 61/61 places, 60/60 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
RANDOM walk for 37 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
[2024-05-30 20:59:23] [INFO ] Invariant cache hit.
[2024-05-30 20:59:23] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-05-30 20:59:23] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-30 20:59:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 20:59:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-30 20:59:23] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-30 20:59:23] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-30 20:59:23] [INFO ] Added : 4 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 37 ms :[p0]
Product exploration explored 100000 steps with 7306 reset in 239 ms.
Product exploration explored 100000 steps with 7298 reset in 262 ms.
Built C files in :
/tmp/ltsmin18220010858290761355
[2024-05-30 20:59:24] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-30 20:59:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 20:59:24] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-30 20:59:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 20:59:24] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-30 20:59:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 20:59:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18220010858290761355
Running compilation step : cd /tmp/ltsmin18220010858290761355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin18220010858290761355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin18220010858290761355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased146696243751587302.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 20:59:39] [INFO ] Invariant cache hit.
[2024-05-30 20:59:39] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 20:59:39] [INFO ] Invariant cache hit.
[2024-05-30 20:59:39] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-30 20:59:39] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-30 20:59:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 11/61 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 60/121 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 82 constraints, problems are : Problem set: 0 solved, 40 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 11/61 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 60/121 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 122 constraints, problems are : Problem set: 0 solved, 40 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1629ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1630ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1781 ms. Remains : 61/61 places, 60/60 transitions.
Built C files in :
/tmp/ltsmin6908464518042323259
[2024-05-30 20:59:41] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-30 20:59:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 20:59:41] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-30 20:59:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 20:59:41] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-30 20:59:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 20:59:41] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6908464518042323259
Running compilation step : cd /tmp/ltsmin6908464518042323259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 265 ms.
Running link step : cd /tmp/ltsmin6908464518042323259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6908464518042323259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9933097242699364529.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 20:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-30 20:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-30 20:59:56] [INFO ] Time to serialize gal into /tmp/LTL7661563706991016046.gal : 3 ms
[2024-05-30 20:59:56] [INFO ] Time to serialize properties into /tmp/LTL3695123901560539121.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7661563706991016046.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14388606316208280330.hoa' '-atoms' '/tmp/LTL3695123901560539121.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3695123901560539121.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14388606316208280330.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
27 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.317705,23212,1,0,83,52176,17,16,1394,46688,173
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-05 finished in 36837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 82 transition count 70
Deduced a syphon composed of 10 places in 1 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 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 717 place count 51 transition count 50
Applied a total of 717 rules in 32 ms. Remains 51 /375 variables (removed 324) and now considering 50/590 (removed 540) transitions.
// Phase 1: matrix 50 rows 51 cols
[2024-05-30 20:59:57] [INFO ] Computed 21 invariants in 0 ms
[2024-05-30 20:59:57] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 20:59:57] [INFO ] Invariant cache hit.
[2024-05-30 20:59:57] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-30 20:59:57] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-30 20:59:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 72 constraints, problems are : Problem set: 0 solved, 40 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 112 constraints, problems are : Problem set: 0 solved, 40 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1205ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1205ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/375 places, 50/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1368 ms. Remains : 51/375 places, 50/590 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-06
Product exploration explored 100000 steps with 2525 reset in 228 ms.
Product exploration explored 100000 steps with 2410 reset in 251 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 114 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 134 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-30 20:59:59] [INFO ] Invariant cache hit.
[2024-05-30 20:59:59] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-05-30 20:59:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-30 20:59:59] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-30 20:59:59] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-30 20:59:59] [INFO ] Invariant cache hit.
[2024-05-30 20:59:59] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 20:59:59] [INFO ] Invariant cache hit.
[2024-05-30 20:59:59] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-30 20:59:59] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-30 20:59:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 72 constraints, problems are : Problem set: 0 solved, 40 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 112 constraints, problems are : Problem set: 0 solved, 40 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1275ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1276ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1403 ms. Remains : 51/51 places, 50/50 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 118 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 139 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-30 21:00:01] [INFO ] Invariant cache hit.
[2024-05-30 21:00:01] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-30 21:00:01] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-30 21:00:01] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-30 21:00:01] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2463 reset in 223 ms.
Product exploration explored 100000 steps with 2409 reset in 241 ms.
Built C files in :
/tmp/ltsmin10353196409904479902
[2024-05-30 21:00:02] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-05-30 21:00:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:00:02] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-05-30 21:00:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:00:02] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-05-30 21:00:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:00:02] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10353196409904479902
Running compilation step : cd /tmp/ltsmin10353196409904479902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 231 ms.
Running link step : cd /tmp/ltsmin10353196409904479902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10353196409904479902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3138951489262530491.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 50/50 transitions.
Applied a total of 0 rules in 6 ms. Remains 51 /51 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-30 21:00:17] [INFO ] Invariant cache hit.
[2024-05-30 21:00:17] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 21:00:17] [INFO ] Invariant cache hit.
[2024-05-30 21:00:17] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-30 21:00:17] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-30 21:00:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 72 constraints, problems are : Problem set: 0 solved, 40 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 112 constraints, problems are : Problem set: 0 solved, 40 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1249ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1249ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1393 ms. Remains : 51/51 places, 50/50 transitions.
Built C files in :
/tmp/ltsmin3748000738019896575
[2024-05-30 21:00:18] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-05-30 21:00:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:00:18] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-05-30 21:00:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:00:18] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-05-30 21:00:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:00:18] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3748000738019896575
Running compilation step : cd /tmp/ltsmin3748000738019896575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 218 ms.
Running link step : cd /tmp/ltsmin3748000738019896575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3748000738019896575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14638809671527828555.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 21:00:33] [INFO ] Flatten gal took : 4 ms
[2024-05-30 21:00:33] [INFO ] Flatten gal took : 4 ms
[2024-05-30 21:00:33] [INFO ] Time to serialize gal into /tmp/LTL5229831857072895611.gal : 2 ms
[2024-05-30 21:00:33] [INFO ] Time to serialize properties into /tmp/LTL17699155530298341977.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5229831857072895611.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15134746946840611452.hoa' '-atoms' '/tmp/LTL17699155530298341977.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17699155530298341977.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15134746946840611452.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
10 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.117875,17864,1,0,46,21732,24,1,1244,12074,119
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-06 finished in 36947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U p1))))'
Support contains 55 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 7 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-30 21:00:34] [INFO ] Computed 22 invariants in 4 ms
[2024-05-30 21:00:34] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-30 21:00:34] [INFO ] Invariant cache hit.
[2024-05-30 21:00:34] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 21:00:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25424 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56645ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56656ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57053 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 787 ms.
Product exploration explored 100000 steps with 2 reset in 854 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 p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (NOT p1)]
RANDOM walk for 981 steps (0 resets) in 20 ms. (46 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p0), (NOT p1)]
Support contains 55 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 430
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 215 transition count 430
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 175 transition count 390
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 200 place count 175 transition count 350
Applied a total of 200 rules in 20 ms. Remains 175 /255 variables (removed 80) and now considering 350/470 (removed 120) transitions.
// Phase 1: matrix 350 rows 175 cols
[2024-05-30 21:01:33] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 21:01:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-30 21:01:33] [INFO ] Invariant cache hit.
[2024-05-30 21:01:33] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-30 21:01:33] [INFO ] Redundant transitions in 2 ms returned []
Running 340 sub problems to find dead transitions.
[2024-05-30 21:01:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 10/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 350/525 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 0/525 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 197 constraints, problems are : Problem set: 0 solved, 340 unsolved in 14598 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 10/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 350/525 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 340/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 0/525 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 537 constraints, problems are : Problem set: 0 solved, 340 unsolved in 23051 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints]
After SMT, in 38551ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 38559ms
Starting structural reductions in SI_LTL mode, iteration 1 : 175/255 places, 350/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38956 ms. Remains : 175/255 places, 350/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 p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 147 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0), (NOT p1)]
RANDOM walk for 1120 steps (0 resets) in 18 ms. (58 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 918 ms.
Product exploration explored 100000 steps with 0 reset in 938 ms.
Built C files in :
/tmp/ltsmin13768483935144052459
[2024-05-30 21:02:15] [INFO ] Computing symmetric may disable matrix : 350 transitions.
[2024-05-30 21:02:15] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:02:15] [INFO ] Computing symmetric may enable matrix : 350 transitions.
[2024-05-30 21:02:15] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:02:15] [INFO ] Computing Do-Not-Accords matrix : 350 transitions.
[2024-05-30 21:02:15] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:02:15] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13768483935144052459
Running compilation step : cd /tmp/ltsmin13768483935144052459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1468 ms.
Running link step : cd /tmp/ltsmin13768483935144052459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13768483935144052459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18035792447737805804.hoa' '--buchi-type=spotba'
LTSmin run took 2637 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-07 finished in 105412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 45 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 24 ms. Remains 165 /375 variables (removed 210) and now considering 340/590 (removed 250) transitions.
// Phase 1: matrix 340 rows 165 cols
[2024-05-30 21:02:19] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 21:02:19] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 21:02:19] [INFO ] Invariant cache hit.
[2024-05-30 21:02:19] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-30 21:02:19] [INFO ] Redundant transitions in 1 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-30 21:02:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 187 constraints, problems are : Problem set: 0 solved, 290 unsolved in 10687 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 290/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 19017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 30245ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 30250ms
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 30586 ms. Remains : 165/375 places, 340/590 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 869 ms.
Stack based approach found an accepted trace after 196 steps with 0 reset with depth 197 and stack size 197 in 2 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-08 finished in 31510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||F(!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 24 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-30 21:02:50] [INFO ] Computed 22 invariants in 3 ms
[2024-05-30 21:02:51] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-30 21:02:51] [INFO ] Invariant cache hit.
[2024-05-30 21:02:51] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-30 21:02:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25785 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 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]
After SMT, in 56649ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56655ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57141 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 102 ms :[p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-10
Product exploration explored 100000 steps with 2358 reset in 315 ms.
Product exploration explored 100000 steps with 2324 reset in 329 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 (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 254 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[p1, p1, p1]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 7 factoid took 305 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 103 ms :[p1, p1, p1]
Support contains 10 out of 255 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 155 transition count 370
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 240 place count 155 transition count 330
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 243 place count 152 transition count 210
Ensure Unique test removed 1 places
Iterating global reduction 1 with 4 rules applied. Total rules applied 247 place count 151 transition count 210
Applied a total of 247 rules in 16 ms. Remains 151 /255 variables (removed 104) and now considering 210/470 (removed 260) transitions.
// Phase 1: matrix 210 rows 151 cols
[2024-05-30 21:03:49] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 21:03:49] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-30 21:03:49] [INFO ] Invariant cache hit.
[2024-05-30 21:03:50] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-30 21:03:50] [INFO ] Redundant transitions in 1 ms returned []
Running 170 sub problems to find dead transitions.
[2024-05-30 21:03:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/151 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 210/361 variables, 151/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 172 constraints, problems are : Problem set: 0 solved, 170 unsolved in 5371 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/151 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 210/361 variables, 151/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 170/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 342 constraints, problems are : Problem set: 0 solved, 170 unsolved in 6602 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
After SMT, in 12078ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 12080ms
Starting structural reductions in SI_LTL mode, iteration 1 : 151/255 places, 210/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12389 ms. Remains : 151/255 places, 210/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 p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[p1, p1, 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 p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 101 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 102 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 1737 reset in 278 ms.
Stack based approach found an accepted trace after 3654 steps with 60 reset with depth 42 and stack size 42 in 11 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-10 finished in 72209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 160 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 375 transition count 550
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 335 transition count 550
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 200 place count 275 transition count 490
Applied a total of 200 rules in 33 ms. Remains 275 /375 variables (removed 100) and now considering 490/590 (removed 100) transitions.
// Phase 1: matrix 490 rows 275 cols
[2024-05-30 21:04:03] [INFO ] Computed 22 invariants in 4 ms
[2024-05-30 21:04:03] [INFO ] Implicit Places using invariants in 307 ms returned [254]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 319 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/375 places, 490/590 transitions.
Applied a total of 0 rules in 7 ms. Remains 274 /274 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 361 ms. Remains : 274/375 places, 490/590 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-13
Product exploration explored 100000 steps with 15631 reset in 1034 ms.
Stack based approach found an accepted trace after 2366 steps with 374 reset with depth 8 and stack size 8 in 26 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-13 finished in 1474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 205 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 375 transition count 550
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 335 transition count 550
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 0 with 20 rules applied. Total rules applied 100 place count 325 transition count 540
Applied a total of 100 rules in 14 ms. Remains 325 /375 variables (removed 50) and now considering 540/590 (removed 50) transitions.
// Phase 1: matrix 540 rows 325 cols
[2024-05-30 21:04:04] [INFO ] Computed 22 invariants in 6 ms
[2024-05-30 21:04:04] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-30 21:04:04] [INFO ] Invariant cache hit.
[2024-05-30 21:04:05] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-05-30 21:04:05] [INFO ] Redundant transitions in 5 ms returned []
Running 490 sub problems to find dead transitions.
[2024-05-30 21:04:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/325 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 540/865 variables, 325/347 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/865 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 865/865 variables, and 347 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/325 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 540/865 variables, 325/347 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/865 variables, 490/837 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 865/865 variables, and 837 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
After SMT, in 61141ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 61152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 325/375 places, 540/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61761 ms. Remains : 325/375 places, 540/590 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-14
Product exploration explored 100000 steps with 44626 reset in 1805 ms.
Product exploration explored 100000 steps with 44526 reset in 1820 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-30 21:05:10] [INFO ] Invariant cache hit.
[2024-05-30 21:05:13] [INFO ] [Real]Absence check using 22 positive place invariants in 28 ms returned sat
[2024-05-30 21:05:14] [INFO ] [Real]Absence check using state equation in 931 ms returned sat
[2024-05-30 21:05:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 21:05:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 21 ms returned sat
[2024-05-30 21:05:17] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2024-05-30 21:05:17] [INFO ] Computed and/alt/rep : 490/920/490 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-30 21:05:21] [INFO ] Added : 471 causal constraints over 96 iterations in 4330 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 205 out of 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 540/540 transitions.
Applied a total of 0 rules in 7 ms. Remains 325 /325 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2024-05-30 21:05:21] [INFO ] Invariant cache hit.
[2024-05-30 21:05:21] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-30 21:05:21] [INFO ] Invariant cache hit.
[2024-05-30 21:05:22] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-05-30 21:05:22] [INFO ] Redundant transitions in 3 ms returned []
Running 490 sub problems to find dead transitions.
[2024-05-30 21:05:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/325 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 540/865 variables, 325/347 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/865 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/865 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 490 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 347 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/325 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 540/865 variables, 325/347 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/865 variables, 490/837 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 865/865 variables, and 837 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
After SMT, in 60915ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 60922ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61524 ms. Remains : 325/325 places, 540/540 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 303 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
[2024-05-30 21:06:23] [INFO ] Invariant cache hit.
[2024-05-30 21:06:27] [INFO ] [Real]Absence check using 22 positive place invariants in 28 ms returned sat
[2024-05-30 21:06:28] [INFO ] [Real]Absence check using state equation in 901 ms returned sat
[2024-05-30 21:06:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 21:06:30] [INFO ] [Nat]Absence check using 22 positive place invariants in 24 ms returned sat
[2024-05-30 21:06:31] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2024-05-30 21:06:31] [INFO ] Computed and/alt/rep : 490/920/490 causal constraints (skipped 0 transitions) in 60 ms.
[2024-05-30 21:06:35] [INFO ] Added : 471 causal constraints over 96 iterations in 4490 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 44520 reset in 2198 ms.
Product exploration explored 100000 steps with 44460 reset in 1817 ms.
Built C files in :
/tmp/ltsmin1562130671854823391
[2024-05-30 21:06:39] [INFO ] Computing symmetric may disable matrix : 540 transitions.
[2024-05-30 21:06:39] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:06:39] [INFO ] Computing symmetric may enable matrix : 540 transitions.
[2024-05-30 21:06:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:06:39] [INFO ] Computing Do-Not-Accords matrix : 540 transitions.
[2024-05-30 21:06:39] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:06:40] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1562130671854823391
Running compilation step : cd /tmp/ltsmin1562130671854823391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2564 ms.
Running link step : cd /tmp/ltsmin1562130671854823391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin1562130671854823391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16707894795817039449.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 205 out of 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 540/540 transitions.
Applied a total of 0 rules in 11 ms. Remains 325 /325 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2024-05-30 21:06:54] [INFO ] Invariant cache hit.
[2024-05-30 21:06:55] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-30 21:06:55] [INFO ] Invariant cache hit.
[2024-05-30 21:06:55] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-30 21:06:55] [INFO ] Redundant transitions in 4 ms returned []
Running 490 sub problems to find dead transitions.
[2024-05-30 21:06:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/325 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 540/865 variables, 325/347 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/865 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 865/865 variables, and 347 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/325 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 540/865 variables, 325/347 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/865 variables, 490/837 constraints. Problems are: Problem set: 0 solved, 490 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 865/865 variables, and 837 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
After SMT, in 60914ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 60921ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61448 ms. Remains : 325/325 places, 540/540 transitions.
Built C files in :
/tmp/ltsmin6718859275112915418
[2024-05-30 21:07:56] [INFO ] Computing symmetric may disable matrix : 540 transitions.
[2024-05-30 21:07:56] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:07:56] [INFO ] Computing symmetric may enable matrix : 540 transitions.
[2024-05-30 21:07:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:07:56] [INFO ] Computing Do-Not-Accords matrix : 540 transitions.
[2024-05-30 21:07:56] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:07:56] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6718859275112915418
Running compilation step : cd /tmp/ltsmin6718859275112915418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2583 ms.
Running link step : cd /tmp/ltsmin6718859275112915418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6718859275112915418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased956143602506185271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 21:08:11] [INFO ] Flatten gal took : 39 ms
[2024-05-30 21:08:11] [INFO ] Flatten gal took : 33 ms
[2024-05-30 21:08:11] [INFO ] Time to serialize gal into /tmp/LTL15315189372861617285.gal : 7 ms
[2024-05-30 21:08:11] [INFO ] Time to serialize properties into /tmp/LTL947241942239758366.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15315189372861617285.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2754220153180622682.hoa' '-atoms' '/tmp/LTL947241942239758366.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL947241942239758366.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2754220153180622682.hoa
Detected timeout of ITS tools.
[2024-05-30 21:08:26] [INFO ] Flatten gal took : 32 ms
[2024-05-30 21:08:26] [INFO ] Flatten gal took : 32 ms
[2024-05-30 21:08:26] [INFO ] Time to serialize gal into /tmp/LTL7418023355887443604.gal : 6 ms
[2024-05-30 21:08:26] [INFO ] Time to serialize properties into /tmp/LTL14696778756065197139.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7418023355887443604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14696778756065197139.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((MovetoZ_37>=1)||(MovetoZ_98>=1))||((MovetoZ_41>=1)||(MovetoZ_102>=1)))||(((MovetoZ_45>=1)||(MovetoZ_106>=1))||((Moveto...12357
Formula 0 simplified : G!"((((((((((MovetoZ_37>=1)||(MovetoZ_98>=1))||((MovetoZ_41>=1)||(MovetoZ_102>=1)))||(((MovetoZ_45>=1)||(MovetoZ_106>=1))||((MovetoZ...12353
Detected timeout of ITS tools.
[2024-05-30 21:08:41] [INFO ] Flatten gal took : 29 ms
[2024-05-30 21:08:41] [INFO ] Applying decomposition
[2024-05-30 21:08:41] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12576707588511822261.txt' '-o' '/tmp/graph12576707588511822261.bin' '-w' '/tmp/graph12576707588511822261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12576707588511822261.bin' '-l' '-1' '-v' '-w' '/tmp/graph12576707588511822261.weights' '-q' '0' '-e' '0.001'
[2024-05-30 21:08:41] [INFO ] Decomposing Gal with order
[2024-05-30 21:08:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 21:08:42] [INFO ] Removed a total of 487 redundant transitions.
[2024-05-30 21:08:42] [INFO ] Flatten gal took : 153 ms
[2024-05-30 21:08:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 343 labels/synchronizations in 38 ms.
[2024-05-30 21:08:42] [INFO ] Time to serialize gal into /tmp/LTL4236453060868624702.gal : 16 ms
[2024-05-30 21:08:42] [INFO ] Time to serialize properties into /tmp/LTL18252963653446234665.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4236453060868624702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18252963653446234665.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((i9.u9.MovetoZ_37>=1)||(i6.u20.MovetoZ_98>=1))||((i9.u9.MovetoZ_41>=1)||(i6.u20.MovetoZ_102>=1)))||(((i9.u9.MovetoZ_45>...16677
Formula 0 simplified : G!"((((((((((i9.u9.MovetoZ_37>=1)||(i6.u20.MovetoZ_98>=1))||((i9.u9.MovetoZ_41>=1)||(i6.u20.MovetoZ_102>=1)))||(((i9.u9.MovetoZ_45>=...16673
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
91 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.989441,36984,1,0,32468,2512,3682,102879,417,21311,18840
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-14 finished in 278776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 210 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
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 100 place count 325 transition count 540
Applied a total of 100 rules in 23 ms. Remains 325 /375 variables (removed 50) and now considering 540/590 (removed 50) transitions.
// Phase 1: matrix 540 rows 325 cols
[2024-05-30 21:08:43] [INFO ] Computed 22 invariants in 4 ms
[2024-05-30 21:08:43] [INFO ] Implicit Places using invariants in 411 ms returned [304]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 413 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/375 places, 540/590 transitions.
Applied a total of 0 rules in 6 ms. Remains 324 /324 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 443 ms. Remains : 324/375 places, 540/590 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLFireability-15
Product exploration explored 100000 steps with 1 reset in 1044 ms.
Product exploration explored 100000 steps with 2 reset in 1067 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 357 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 82 steps (0 resets) in 7 ms. (10 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F p0), (F p1)]
Knowledge based reduction with 12 factoid took 627 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 540 rows 324 cols
[2024-05-30 21:08:47] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 21:08:47] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-30 21:08:48] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2024-05-30 21:08:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 21:08:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned sat
[2024-05-30 21:08:49] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-05-30 21:08:49] [INFO ] Computed and/alt/rep : 530/770/530 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-30 21:08:49] [INFO ] Added : 91 causal constraints over 19 iterations in 649 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-30 21:08:49] [INFO ] Invariant cache hit.
[2024-05-30 21:08:50] [INFO ] [Real]Absence check using 21 positive place invariants in 28 ms returned sat
[2024-05-30 21:08:51] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2024-05-30 21:08:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 21:08:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned sat
[2024-05-30 21:08:52] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2024-05-30 21:08:52] [INFO ] Computed and/alt/rep : 530/770/530 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-30 21:08:53] [INFO ] Added : 76 causal constraints over 16 iterations in 569 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 210 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 540/540 transitions.
Applied a total of 0 rules in 5 ms. Remains 324 /324 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2024-05-30 21:08:53] [INFO ] Invariant cache hit.
[2024-05-30 21:08:53] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-30 21:08:53] [INFO ] Invariant cache hit.
[2024-05-30 21:08:53] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-30 21:08:53] [INFO ] Redundant transitions in 3 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-30 21:08:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (OVERLAPS) 10/324 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (OVERLAPS) 540/864 variables, 324/345 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/864 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/864 variables, and 345 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 530 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (OVERLAPS) 10/324 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (OVERLAPS) 540/864 variables, 324/345 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/864 variables, 530/875 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/864 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 864/864 variables, and 875 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 60526ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60538ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61217 ms. Remains : 324/324 places, 540/540 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 446 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 45 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F p0), (F p1)]
Knowledge based reduction with 12 factoid took 613 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2024-05-30 21:09:55] [INFO ] Invariant cache hit.
[2024-05-30 21:09:56] [INFO ] [Real]Absence check using 21 positive place invariants in 22 ms returned sat
[2024-05-30 21:09:56] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2024-05-30 21:09:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 21:09:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 33 ms returned sat
[2024-05-30 21:09:57] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2024-05-30 21:09:57] [INFO ] Computed and/alt/rep : 530/770/530 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-30 21:09:58] [INFO ] Added : 210 causal constraints over 42 iterations in 1525 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-30 21:09:58] [INFO ] Invariant cache hit.
[2024-05-30 21:09:59] [INFO ] [Real]Absence check using 21 positive place invariants in 27 ms returned sat
[2024-05-30 21:10:00] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2024-05-30 21:10:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 21:10:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-30 21:10:01] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2024-05-30 21:10:01] [INFO ] Computed and/alt/rep : 530/770/530 causal constraints (skipped 0 transitions) in 39 ms.
[2024-05-30 21:10:01] [INFO ] Added : 76 causal constraints over 16 iterations in 537 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7 reset in 1384 ms.
Product exploration explored 100000 steps with 0 reset in 1155 ms.
Built C files in :
/tmp/ltsmin4038543472111903941
[2024-05-30 21:10:04] [INFO ] Computing symmetric may disable matrix : 540 transitions.
[2024-05-30 21:10:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:10:04] [INFO ] Computing symmetric may enable matrix : 540 transitions.
[2024-05-30 21:10:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:10:04] [INFO ] Computing Do-Not-Accords matrix : 540 transitions.
[2024-05-30 21:10:04] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:10:04] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4038543472111903941
Running compilation step : cd /tmp/ltsmin4038543472111903941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2486 ms.
Running link step : cd /tmp/ltsmin4038543472111903941;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4038543472111903941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8848282807585799739.hoa' '--buchi-type=spotba'
LTSmin run took 4607 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLFireability-15 finished in 88264 ms.
All properties solved by simple procedures.
Total runtime 922873 ms.

BK_STOP 1717103411729

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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