Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446300092.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S02J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446300092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T10-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716904065914

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 13:47:47] [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-28 13:47:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:47:47] [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-28 13:47:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 13:47:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 665 ms
[2024-05-28 13:47:48] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 13:47:48] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 13:47:48] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-15 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.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (14 resets) in 1072 ms. (37 steps per ms) remains 4/22 properties
BEST_FIRST walk for 40000 steps (18 resets) in 546 ms. (73 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (13 resets) in 457 ms. (87 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (26 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
[2024-05-28 13:47:49] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 13:47:49] [INFO ] Computed 26 invariants in 12 ms
[2024-05-28 13:47:49] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 39/46 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/50 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Real declared 73/145 variables, and 21 constraints, problems are : Problem set: 3 solved, 0 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2024-05-28 13:47:49] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 13:47:49] [INFO ] Flatten gal took : 22 ms
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:47:49] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 13:47:49] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 41 ms.
[2024-05-28 13:47:49] [INFO ] Unfolded 11 HLPN properties in 1 ms.
[2024-05-28 13:47:49] [INFO ] Reduced 40 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 290 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Applied a total of 22 rules in 67 ms. Remains 740 /752 variables (removed 12) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-28 13:47:49] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 740 cols
[2024-05-28 13:47:49] [INFO ] Computed 52 invariants in 58 ms
[2024-05-28 13:47:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:48:06] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 18 ms to minimize.
[2024-05-28 13:48:06] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:48:06] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-05-28 13:48:06] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 2 ms to minimize.
[2024-05-28 13:48:07] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:48:07] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:48:07] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:48:07] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:48:07] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:48:08] [INFO ] Deduced a trap composed of 420 places in 373 ms of which 6 ms to minimize.
[2024-05-28 13:48:08] [INFO ] Deduced a trap composed of 393 places in 360 ms of which 5 ms to minimize.
[2024-05-28 13:48:08] [INFO ] Deduced a trap composed of 396 places in 326 ms of which 5 ms to minimize.
[2024-05-28 13:48:09] [INFO ] Deduced a trap composed of 421 places in 333 ms of which 4 ms to minimize.
[2024-05-28 13:48:09] [INFO ] Deduced a trap composed of 216 places in 334 ms of which 5 ms to minimize.
[2024-05-28 13:48:11] [INFO ] Deduced a trap composed of 395 places in 328 ms of which 4 ms to minimize.
[2024-05-28 13:48:11] [INFO ] Deduced a trap composed of 416 places in 342 ms of which 4 ms to minimize.
[2024-05-28 13:48:11] [INFO ] Deduced a trap composed of 412 places in 355 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 4.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 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.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 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 9.0)
(s203 0.0)
(s204 1.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/2122 variables, and 67 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:48:14] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:48:14] [INFO ] Deduced a trap composed of 370 places in 369 ms of which 5 ms to minimize.
[2024-05-28 13:48:16] [INFO ] Deduced a trap composed of 23 places in 392 ms of which 6 ms to minimize.
[2024-05-28 13:48:16] [INFO ] Deduced a trap composed of 386 places in 367 ms of which 4 ms to minimize.
[2024-05-28 13:48:16] [INFO ] Deduced a trap composed of 403 places in 397 ms of which 5 ms to minimize.
[2024-05-28 13:48:17] [INFO ] Deduced a trap composed of 394 places in 332 ms of which 5 ms to minimize.
[2024-05-28 13:48:25] [INFO ] Deduced a trap composed of 495 places in 245 ms of which 4 ms to minimize.
[2024-05-28 13:48:25] [INFO ] Deduced a trap composed of 502 places in 256 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/2122 variables, and 75 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 25/25 constraints]
After SMT, in 42262ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42292ms
[2024-05-28 13:48:31] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:48:31] [INFO ] Invariant cache hit.
[2024-05-28 13:48:32] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-28 13:48:32] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:48:32] [INFO ] Invariant cache hit.
[2024-05-28 13:48:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:48:37] [INFO ] Implicit Places using invariants and state equation in 4880 ms returned []
Implicit Place search using SMT with State Equation took 5368 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2024-05-28 13:48:37] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:48:37] [INFO ] Invariant cache hit.
[2024-05-28 13:48:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 2 ms to minimize.
[2024-05-28 13:48:52] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 363 places in 339 ms of which 9 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 224 places in 312 ms of which 5 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 231 places in 278 ms of which 5 ms to minimize.
[2024-05-28 13:48:55] [INFO ] Deduced a trap composed of 410 places in 365 ms of which 4 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 412 places in 298 ms of which 3 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 410 places in 257 ms of which 7 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 419 places in 269 ms of which 4 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 434 places in 384 ms of which 5 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 487 places in 361 ms of which 5 ms to minimize.
[2024-05-28 13:48:57] [INFO ] Deduced a trap composed of 420 places in 335 ms of which 4 ms to minimize.
[2024-05-28 13:48:58] [INFO ] Deduced a trap composed of 400 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:48:58] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:48:59] [INFO ] Deduced a trap composed of 396 places in 249 ms of which 4 ms to minimize.
[2024-05-28 13:49:00] [INFO ] Deduced a trap composed of 449 places in 268 ms of which 4 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 479 places in 267 ms of which 4 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 422 places in 356 ms of which 5 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 372 places in 349 ms of which 6 ms to minimize.
[2024-05-28 13:49:02] [INFO ] Deduced a trap composed of 404 places in 260 ms of which 4 ms to minimize.
[2024-05-28 13:49:02] [INFO ] Deduced a trap composed of 431 places in 284 ms of which 3 ms to minimize.
[2024-05-28 13:49:02] [INFO ] Deduced a trap composed of 441 places in 302 ms of which 3 ms to minimize.
[2024-05-28 13:49:03] [INFO ] Deduced a trap composed of 413 places in 291 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/2122 variables, and 80 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 3 ms to minimize.
[2024-05-28 13:49:20] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 19 ms to minimize.
[2024-05-28 13:49:20] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
[2024-05-28 13:49:21] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 3 ms to minimize.
[2024-05-28 13:49:21] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 2 ms to minimize.
[2024-05-28 13:49:21] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 3 ms to minimize.
[2024-05-28 13:49:21] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 3 ms to minimize.
[2024-05-28 13:49:21] [INFO ] Deduced a trap composed of 83 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:49:22] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-28 13:49:22] [INFO ] Deduced a trap composed of 406 places in 252 ms of which 4 ms to minimize.
[2024-05-28 13:49:22] [INFO ] Deduced a trap composed of 404 places in 264 ms of which 3 ms to minimize.
[2024-05-28 13:49:30] [INFO ] Deduced a trap composed of 387 places in 310 ms of which 5 ms to minimize.
[2024-05-28 13:49:32] [INFO ] Deduced a trap composed of 397 places in 280 ms of which 4 ms to minimize.
[2024-05-28 13:49:32] [INFO ] Deduced a trap composed of 410 places in 387 ms of which 5 ms to minimize.
[2024-05-28 13:49:32] [INFO ] Deduced a trap composed of 421 places in 322 ms of which 4 ms to minimize.
[2024-05-28 13:49:33] [INFO ] Deduced a trap composed of 417 places in 376 ms of which 5 ms to minimize.
[2024-05-28 13:49:33] [INFO ] Deduced a trap composed of 417 places in 366 ms of which 4 ms to minimize.
[2024-05-28 13:49:36] [INFO ] Deduced a trap composed of 526 places in 357 ms of which 5 ms to minimize.
[2024-05-28 13:49:37] [INFO ] Deduced a trap composed of 388 places in 296 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/2122 variables, and 99 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 49/49 constraints]
After SMT, in 61897ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 61912ms
Starting structural reductions in LTL mode, iteration 1 : 740/752 places, 1402/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109661 ms. Remains : 740/752 places, 1402/1412 transitions.
Support contains 290 out of 740 places after structural reductions.
[2024-05-28 13:49:39] [INFO ] Flatten gal took : 173 ms
[2024-05-28 13:49:39] [INFO ] Flatten gal took : 106 ms
[2024-05-28 13:49:39] [INFO ] Input system was already deterministic with 1402 transitions.
Support contains 279 out of 740 places (down from 290) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (14 resets) in 985 ms. (40 steps per ms) remains 2/19 properties
BEST_FIRST walk for 40004 steps (9 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 399 ms. (100 steps per ms) remains 2/2 properties
[2024-05-28 13:49:40] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 13:49:40] [INFO ] Invariant cache hit.
[2024-05-28 13:49:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 582/616 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/636 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/636 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 736/2122 variables, and 49 constraints, problems are : Problem set: 2 solved, 0 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 431ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p1)))'
Support contains 21 out of 740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 740/740 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 740 transition count 1332
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 140 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 300 place count 590 transition count 1252
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 440 place count 520 transition count 1182
Applied a total of 440 rules in 213 ms. Remains 520 /740 variables (removed 220) and now considering 1182/1402 (removed 220) transitions.
Running 1180 sub problems to find dead transitions.
[2024-05-28 13:49:41] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 520 cols
[2024-05-28 13:49:41] [INFO ] Computed 52 invariants in 44 ms
[2024-05-28 13:49:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:49:51] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:49:52] [INFO ] Deduced a trap composed of 211 places in 252 ms of which 3 ms to minimize.
[2024-05-28 13:50:01] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 4 ms to minimize.
[2024-05-28 13:50:02] [INFO ] Deduced a trap composed of 202 places in 287 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9.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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.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 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 9.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 (/ 1.0 3.0))
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 (/ 1.0 3.0))
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 (/ 1.0 3.0))
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 4.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1682 variables, and 63 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:50:04] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-05-28 13:50:05] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:50:09] [INFO ] Deduced a trap composed of 212 places in 290 ms of which 4 ms to minimize.
[2024-05-28 13:50:13] [INFO ] Deduced a trap composed of 245 places in 209 ms of which 2 ms to minimize.
[2024-05-28 13:50:14] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:50:14] [INFO ] Deduced a trap composed of 109 places in 197 ms of which 2 ms to minimize.
[2024-05-28 13:50:14] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 1180 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 518/1682 variables, and 70 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 20/20 constraints]
After SMT, in 42022ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42051ms
[2024-05-28 13:50:23] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:50:23] [INFO ] Invariant cache hit.
[2024-05-28 13:50:23] [INFO ] Implicit Places using invariants in 345 ms returned [464, 465, 466, 467, 468, 469, 470, 471, 472, 473]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 361 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/740 places, 1182/1402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 500 transition count 1172
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 500 transition count 1172
Applied a total of 20 rules in 80 ms. Remains 500 /510 variables (removed 10) and now considering 1172/1182 (removed 10) transitions.
[2024-05-28 13:50:23] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
// Phase 1: matrix 1152 rows 500 cols
[2024-05-28 13:50:24] [INFO ] Computed 42 invariants in 51 ms
[2024-05-28 13:50:24] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-05-28 13:50:24] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-05-28 13:50:24] [INFO ] Invariant cache hit.
[2024-05-28 13:50:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:50:30] [INFO ] Implicit Places using invariants and state equation in 5463 ms returned []
Implicit Place search using SMT with State Equation took 6109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 500/740 places, 1172/1402 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48817 ms. Remains : 500/740 places, 1172/1402 transitions.
Stuttering acceptance computed with spot in 364 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-00
Stuttering criterion allowed to conclude after 3104 steps with 72 reset in 60 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-00 finished in 49326 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 21 out of 740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 740/740 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 740 transition count 1352
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 690 transition count 1342
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 680 transition count 1342
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 120 place count 680 transition count 1252
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 300 place count 590 transition count 1252
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 420 place count 530 transition count 1192
Applied a total of 420 rules in 98 ms. Remains 530 /740 variables (removed 210) and now considering 1192/1402 (removed 210) transitions.
Running 1190 sub problems to find dead transitions.
[2024-05-28 13:50:30] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
// Phase 1: matrix 1172 rows 530 cols
[2024-05-28 13:50:30] [INFO ] Computed 52 invariants in 32 ms
[2024-05-28 13:50:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:50:40] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:50:41] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:50:41] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2024-05-28 13:50:41] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:50:41] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
[2024-05-28 13:50:41] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:50:41] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:50:41] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:50:41] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:50:41] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:50:42] [INFO ] Deduced a trap composed of 239 places in 198 ms of which 2 ms to minimize.
[2024-05-28 13:50:42] [INFO ] Deduced a trap composed of 192 places in 206 ms of which 2 ms to minimize.
[2024-05-28 13:50:42] [INFO ] Deduced a trap composed of 227 places in 211 ms of which 2 ms to minimize.
[2024-05-28 13:50:42] [INFO ] Deduced a trap composed of 217 places in 224 ms of which 2 ms to minimize.
[2024-05-28 13:50:43] [INFO ] Deduced a trap composed of 256 places in 221 ms of which 2 ms to minimize.
[2024-05-28 13:50:43] [INFO ] Deduced a trap composed of 234 places in 197 ms of which 3 ms to minimize.
[2024-05-28 13:50:43] [INFO ] Deduced a trap composed of 240 places in 208 ms of which 3 ms to minimize.
[2024-05-28 13:50:43] [INFO ] Deduced a trap composed of 212 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:50:44] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:50:44] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:50:46] [INFO ] Deduced a trap composed of 99 places in 251 ms of which 3 ms to minimize.
[2024-05-28 13:50:50] [INFO ] Deduced a trap composed of 196 places in 199 ms of which 3 ms to minimize.
[2024-05-28 13:50:51] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1702 variables, and 73 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 23/73 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:50:58] [INFO ] Deduced a trap composed of 320 places in 192 ms of which 3 ms to minimize.
[2024-05-28 13:51:01] [INFO ] Deduced a trap composed of 249 places in 192 ms of which 3 ms to minimize.
[2024-05-28 13:51:02] [INFO ] Deduced a trap composed of 349 places in 319 ms of which 3 ms to minimize.
[2024-05-28 13:51:02] [INFO ] Deduced a trap composed of 252 places in 248 ms of which 4 ms to minimize.
[2024-05-28 13:51:02] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 4 ms to minimize.
[2024-05-28 13:51:02] [INFO ] Deduced a trap composed of 226 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:51:03] [INFO ] Deduced a trap composed of 248 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:51:03] [INFO ] Deduced a trap composed of 252 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:51:03] [INFO ] Deduced a trap composed of 250 places in 175 ms of which 2 ms to minimize.
[2024-05-28 13:51:07] [INFO ] Deduced a trap composed of 250 places in 304 ms of which 3 ms to minimize.
[2024-05-28 13:51:08] [INFO ] Deduced a trap composed of 235 places in 242 ms of which 3 ms to minimize.
[2024-05-28 13:51:08] [INFO ] Deduced a trap composed of 245 places in 237 ms of which 2 ms to minimize.
[2024-05-28 13:51:08] [INFO ] Deduced a trap composed of 233 places in 237 ms of which 3 ms to minimize.
[2024-05-28 13:51:08] [INFO ] Deduced a trap composed of 227 places in 188 ms of which 3 ms to minimize.
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 237 places in 180 ms of which 2 ms to minimize.
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 231 places in 192 ms of which 2 ms to minimize.
[2024-05-28 13:51:11] [INFO ] Deduced a trap composed of 208 places in 272 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 17/90 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1702 variables, and 90 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 40/40 constraints]
After SMT, in 42170ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 42192ms
[2024-05-28 13:51:12] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:51:12] [INFO ] Invariant cache hit.
[2024-05-28 13:51:13] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-28 13:51:13] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:51:13] [INFO ] Invariant cache hit.
[2024-05-28 13:51:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:51:17] [INFO ] Implicit Places using invariants and state equation in 4731 ms returned []
Implicit Place search using SMT with State Equation took 5120 ms to find 0 implicit places.
[2024-05-28 13:51:18] [INFO ] Redundant transitions in 96 ms returned []
Running 1190 sub problems to find dead transitions.
[2024-05-28 13:51:18] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:51:18] [INFO ] Invariant cache hit.
[2024-05-28 13:51:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:51:29] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-05-28 13:51:30] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:51:30] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 2 ms to minimize.
[2024-05-28 13:51:30] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 2 ms to minimize.
[2024-05-28 13:51:30] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 4 ms to minimize.
[2024-05-28 13:51:32] [INFO ] Deduced a trap composed of 320 places in 236 ms of which 4 ms to minimize.
[2024-05-28 13:51:33] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:51:35] [INFO ] Deduced a trap composed of 130 places in 281 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:51:46] [INFO ] Deduced a trap composed of 200 places in 193 ms of which 9 ms to minimize.
[2024-05-28 13:51:46] [INFO ] Deduced a trap composed of 196 places in 183 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1702 variables, and 64 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-28 13:52:04] [INFO ] Deduced a trap composed of 194 places in 262 ms of which 3 ms to minimize.
[2024-05-28 13:52:05] [INFO ] Deduced a trap composed of 77 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:52:06] [INFO ] Deduced a trap composed of 234 places in 329 ms of which 4 ms to minimize.
[2024-05-28 13:52:07] [INFO ] Deduced a trap composed of 217 places in 324 ms of which 3 ms to minimize.
[2024-05-28 13:52:07] [INFO ] Deduced a trap composed of 204 places in 213 ms of which 3 ms to minimize.
[2024-05-28 13:52:07] [INFO ] Deduced a trap composed of 229 places in 294 ms of which 4 ms to minimize.
[2024-05-28 13:52:15] [INFO ] Deduced a trap composed of 311 places in 258 ms of which 3 ms to minimize.
[2024-05-28 13:52:19] [INFO ] Deduced a trap composed of 248 places in 293 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1702 variables, and 73 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 23/23 constraints]
After SMT, in 61944ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 61959ms
Starting structural reductions in SI_LTL mode, iteration 1 : 530/740 places, 1192/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109479 ms. Remains : 530/740 places, 1192/1402 transitions.
Stuttering acceptance computed with spot in 65 ms :[p0]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-03
Product exploration explored 100000 steps with 23 reset in 441 ms.
Stack based approach found an accepted trace after 979 steps with 0 reset with depth 980 and stack size 980 in 5 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-03 finished in 110021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 10 out of 740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 740/740 places, 1402/1402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 730 transition count 1392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 730 transition count 1392
Applied a total of 20 rules in 24 ms. Remains 730 /740 variables (removed 10) and now considering 1392/1402 (removed 10) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:52:20] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 13:52:20] [INFO ] Computed 52 invariants in 37 ms
[2024-05-28 13:52:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:52:35] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
[2024-05-28 13:52:36] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:52:36] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-28 13:52:36] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:52:36] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:52:36] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:52:36] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-28 13:52:36] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:52:36] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 0 ms to minimize.
[2024-05-28 13:52:37] [INFO ] Deduced a trap composed of 404 places in 419 ms of which 5 ms to minimize.
[2024-05-28 13:52:38] [INFO ] Deduced a trap composed of 209 places in 390 ms of which 5 ms to minimize.
[2024-05-28 13:52:39] [INFO ] Deduced a trap composed of 75 places in 186 ms of which 3 ms to minimize.
[2024-05-28 13:52:40] [INFO ] Deduced a trap composed of 440 places in 359 ms of which 5 ms to minimize.
[2024-05-28 13:52:40] [INFO ] Deduced a trap composed of 432 places in 332 ms of which 4 ms to minimize.
[2024-05-28 13:52:40] [INFO ] Deduced a trap composed of 393 places in 326 ms of which 4 ms to minimize.
[2024-05-28 13:52:41] [INFO ] Deduced a trap composed of 411 places in 324 ms of which 4 ms to minimize.
[2024-05-28 13:52:41] [INFO ] Deduced a trap composed of 392 places in 317 ms of which 4 ms to minimize.
[2024-05-28 13:52:41] [INFO ] Deduced a trap composed of 370 places in 285 ms of which 4 ms to minimize.
[2024-05-28 13:52:42] [INFO ] Deduced a trap composed of 404 places in 311 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 69 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:52:44] [INFO ] Deduced a trap composed of 63 places in 39 ms of which 0 ms to minimize.
[2024-05-28 13:52:45] [INFO ] Deduced a trap composed of 324 places in 337 ms of which 5 ms to minimize.
[2024-05-28 13:52:46] [INFO ] Deduced a trap composed of 49 places in 361 ms of which 5 ms to minimize.
[2024-05-28 13:52:46] [INFO ] Deduced a trap composed of 383 places in 301 ms of which 4 ms to minimize.
[2024-05-28 13:52:46] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:52:55] [INFO ] Deduced a trap composed of 507 places in 350 ms of which 6 ms to minimize.
[2024-05-28 13:52:55] [INFO ] Deduced a trap composed of 491 places in 288 ms of which 4 ms to minimize.
[2024-05-28 13:52:55] [INFO ] Deduced a trap composed of 491 places in 274 ms of which 4 ms to minimize.
[2024-05-28 13:52:56] [INFO ] Deduced a trap composed of 514 places in 278 ms of which 5 ms to minimize.
[2024-05-28 13:52:56] [INFO ] Deduced a trap composed of 491 places in 459 ms of which 19 ms to minimize.
[2024-05-28 13:52:57] [INFO ] Deduced a trap composed of 502 places in 355 ms of which 5 ms to minimize.
[2024-05-28 13:53:00] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 81 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 31/31 constraints]
After SMT, in 42088ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42101ms
[2024-05-28 13:53:02] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:53:02] [INFO ] Invariant cache hit.
[2024-05-28 13:53:03] [INFO ] Implicit Places using invariants in 494 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 502 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/740 places, 1392/1402 transitions.
Applied a total of 0 rules in 9 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42640 ms. Remains : 720/740 places, 1392/1402 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-06 finished in 42792 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 15 out of 740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 740/740 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 740 transition count 1352
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 690 transition count 1342
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 680 transition count 1342
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 120 place count 680 transition count 1252
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 300 place count 590 transition count 1252
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 420 place count 530 transition count 1192
Applied a total of 420 rules in 125 ms. Remains 530 /740 variables (removed 210) and now considering 1192/1402 (removed 210) transitions.
Running 1190 sub problems to find dead transitions.
[2024-05-28 13:53:03] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
// Phase 1: matrix 1172 rows 530 cols
[2024-05-28 13:53:03] [INFO ] Computed 52 invariants in 14 ms
[2024-05-28 13:53:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 2 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:53:15] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:53:15] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:53:15] [INFO ] Deduced a trap composed of 239 places in 241 ms of which 3 ms to minimize.
[2024-05-28 13:53:15] [INFO ] Deduced a trap composed of 192 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:53:16] [INFO ] Deduced a trap composed of 227 places in 291 ms of which 3 ms to minimize.
[2024-05-28 13:53:16] [INFO ] Deduced a trap composed of 217 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:53:16] [INFO ] Deduced a trap composed of 256 places in 200 ms of which 3 ms to minimize.
[2024-05-28 13:53:16] [INFO ] Deduced a trap composed of 234 places in 292 ms of which 4 ms to minimize.
[2024-05-28 13:53:17] [INFO ] Deduced a trap composed of 240 places in 465 ms of which 3 ms to minimize.
[2024-05-28 13:53:17] [INFO ] Deduced a trap composed of 212 places in 199 ms of which 3 ms to minimize.
[2024-05-28 13:53:18] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2024-05-28 13:53:18] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:53:20] [INFO ] Deduced a trap composed of 99 places in 276 ms of which 4 ms to minimize.
[2024-05-28 13:53:25] [INFO ] Deduced a trap composed of 196 places in 183 ms of which 3 ms to minimize.
SMT process timed out in 22495ms, After SMT, problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 22513ms
[2024-05-28 13:53:25] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:53:25] [INFO ] Invariant cache hit.
[2024-05-28 13:53:26] [INFO ] Implicit Places using invariants in 376 ms returned [454, 455, 456, 457, 458, 459, 460, 461, 462, 463]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 379 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 520/740 places, 1192/1402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 510 transition count 1182
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 510 transition count 1182
Applied a total of 20 rules in 27 ms. Remains 510 /520 variables (removed 10) and now considering 1182/1192 (removed 10) transitions.
[2024-05-28 13:53:26] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 510 cols
[2024-05-28 13:53:26] [INFO ] Computed 42 invariants in 11 ms
[2024-05-28 13:53:26] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-28 13:53:26] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:53:26] [INFO ] Invariant cache hit.
[2024-05-28 13:53:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:53:31] [INFO ] Implicit Places using invariants and state equation in 5161 ms returned []
Implicit Place search using SMT with State Equation took 5561 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 510/740 places, 1182/1402 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28610 ms. Remains : 510/740 places, 1182/1402 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-07
Product exploration explored 100000 steps with 2432 reset in 660 ms.
Product exploration explored 100000 steps with 2429 reset in 582 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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 43 ms :[(NOT p0)]
RANDOM walk for 167 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 161 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 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-28 13:53:33] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:53:33] [INFO ] Invariant cache hit.
[2024-05-28 13:53:34] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2024-05-28 13:53:34] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 87 ms returned sat
[2024-05-28 13:53:35] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2024-05-28 13:53:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:53:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 40 ms returned sat
[2024-05-28 13:53:36] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 92 ms returned sat
[2024-05-28 13:53:39] [INFO ] [Nat]Absence check using state equation in 3186 ms returned sat
[2024-05-28 13:53:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:53:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 13:53:42] [INFO ] [Nat]Added 120 Read/Feed constraints in 3017 ms returned unknown
Could not prove EG (NOT p0)
Support contains 15 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 1182/1182 transitions.
Applied a total of 0 rules in 37 ms. Remains 510 /510 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Running 1180 sub problems to find dead transitions.
[2024-05-28 13:53:42] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:53:42] [INFO ] Invariant cache hit.
[2024-05-28 13:53:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:53:53] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-28 13:53:53] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:53:57] [INFO ] Deduced a trap composed of 43 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:53:59] [INFO ] Deduced a trap composed of 209 places in 193 ms of which 2 ms to minimize.
[2024-05-28 13:54:03] [INFO ] Deduced a trap composed of 177 places in 279 ms of which 3 ms to minimize.
[2024-05-28 13:54:03] [INFO ] Deduced a trap composed of 239 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 192 places in 287 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 54 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 320 places in 181 ms of which 3 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1672 variables, and 56 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 16/16 constraints]
After SMT, in 41926ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 41945ms
[2024-05-28 13:54:24] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:54:24] [INFO ] Invariant cache hit.
[2024-05-28 13:54:25] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-28 13:54:25] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:54:25] [INFO ] Invariant cache hit.
[2024-05-28 13:54:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:54:30] [INFO ] Implicit Places using invariants and state equation in 5503 ms returned []
Implicit Place search using SMT with State Equation took 5939 ms to find 0 implicit places.
[2024-05-28 13:54:30] [INFO ] Redundant transitions in 78 ms returned []
Running 1180 sub problems to find dead transitions.
[2024-05-28 13:54:30] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:54:30] [INFO ] Invariant cache hit.
[2024-05-28 13:54:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 4 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 0 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 1 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 0 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 209 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:54:51] [INFO ] Deduced a trap composed of 177 places in 213 ms of which 3 ms to minimize.
[2024-05-28 13:54:51] [INFO ] Deduced a trap composed of 239 places in 206 ms of which 3 ms to minimize.
[2024-05-28 13:54:51] [INFO ] Deduced a trap composed of 192 places in 215 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:54:52] [INFO ] Deduced a trap composed of 251 places in 199 ms of which 2 ms to minimize.
[2024-05-28 13:54:52] [INFO ] Deduced a trap composed of 234 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:54:54] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 196 places in 188 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 58 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:55:07] [INFO ] Deduced a trap composed of 320 places in 193 ms of which 2 ms to minimize.
[2024-05-28 13:55:07] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/509 variables, 1/61 constraints. Problems are: Problem set: 60 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/1672 variables, and 61 constraints, problems are : Problem set: 60 solved, 1120 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 20/20 constraints]
After SMT, in 62033ms problems are : Problem set: 60 solved, 1120 unsolved
Search for dead transitions found 60 dead transitions in 62050ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 510/510 places, 1122/1182 transitions.
Applied a total of 0 rules in 15 ms. Remains 510 /510 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
[2024-05-28 13:55:32] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 110109 ms. Remains : 510/510 places, 1122/1182 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 58 ms :[(NOT p0)]
RANDOM walk for 168 steps (0 resets) in 14 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-05-28 13:55:33] [INFO ] Flow matrix only has 1102 transitions (discarded 20 similar events)
// Phase 1: matrix 1102 rows 510 cols
[2024-05-28 13:55:33] [INFO ] Computed 42 invariants in 13 ms
[2024-05-28 13:55:33] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-28 13:55:33] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 131 ms returned sat
[2024-05-28 13:55:35] [INFO ] [Real]Absence check using state equation in 1368 ms returned sat
[2024-05-28 13:55:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:55:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-28 13:55:36] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 65 ms returned sat
[2024-05-28 13:55:38] [INFO ] [Nat]Absence check using state equation in 1983 ms returned sat
[2024-05-28 13:55:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:55:39] [INFO ] [Nat]Added 120 Read/Feed constraints in 1033 ms returned sat
[2024-05-28 13:55:39] [INFO ] Deduced a trap composed of 193 places in 301 ms of which 3 ms to minimize.
[2024-05-28 13:55:40] [INFO ] Deduced a trap composed of 212 places in 256 ms of which 3 ms to minimize.
[2024-05-28 13:55:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1025 ms
[2024-05-28 13:55:40] [INFO ] Computed and/alt/rep : 440/1258/430 causal constraints (skipped 670 transitions) in 106 ms.
[2024-05-28 13:55:41] [INFO ] Added : 56 causal constraints over 12 iterations in 1252 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2428 reset in 379 ms.
Product exploration explored 100000 steps with 2430 reset in 398 ms.
Built C files in :
/tmp/ltsmin16927925271837228171
[2024-05-28 13:55:42] [INFO ] Computing symmetric may disable matrix : 1122 transitions.
[2024-05-28 13:55:42] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:42] [INFO ] Computing symmetric may enable matrix : 1122 transitions.
[2024-05-28 13:55:42] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:42] [INFO ] Computing Do-Not-Accords matrix : 1122 transitions.
[2024-05-28 13:55:42] [INFO ] Computation of Completed DNA matrix. took 62 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:42] [INFO ] Built C files in 380ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16927925271837228171
Running compilation step : cd /tmp/ltsmin16927925271837228171;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16927925271837228171;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16927925271837228171;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 15 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 1122/1122 transitions.
Applied a total of 0 rules in 48 ms. Remains 510 /510 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Running 1120 sub problems to find dead transitions.
[2024-05-28 13:55:45] [INFO ] Flow matrix only has 1102 transitions (discarded 20 similar events)
[2024-05-28 13:55:45] [INFO ] Invariant cache hit.
[2024-05-28 13:55:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 3 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 43 places in 24 ms of which 1 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 4 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:55:56] [INFO ] Deduced a trap composed of 199 places in 193 ms of which 2 ms to minimize.
[2024-05-28 13:55:56] [INFO ] Deduced a trap composed of 183 places in 278 ms of which 2 ms to minimize.
[2024-05-28 13:55:56] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 3 ms to minimize.
[2024-05-28 13:55:57] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:55:59] [INFO ] Deduced a trap composed of 320 places in 254 ms of which 3 ms to minimize.
[2024-05-28 13:56:04] [INFO ] Deduced a trap composed of 229 places in 260 ms of which 4 ms to minimize.
[2024-05-28 13:56:05] [INFO ] Deduced a trap composed of 212 places in 240 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1612 variables, and 56 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 13:56:08] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 4 ms to minimize.
[2024-05-28 13:56:10] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 178 places in 191 ms of which 3 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
[2024-05-28 13:56:18] [INFO ] Deduced a trap composed of 268 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:56:18] [INFO ] Deduced a trap composed of 268 places in 203 ms of which 2 ms to minimize.
[2024-05-28 13:56:20] [INFO ] Deduced a trap composed of 171 places in 197 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 13:56:24] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1612 variables, and 64 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 24/24 constraints]
After SMT, in 41541ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 41573ms
[2024-05-28 13:56:27] [INFO ] Flow matrix only has 1102 transitions (discarded 20 similar events)
[2024-05-28 13:56:27] [INFO ] Invariant cache hit.
[2024-05-28 13:56:27] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-05-28 13:56:27] [INFO ] Flow matrix only has 1102 transitions (discarded 20 similar events)
[2024-05-28 13:56:27] [INFO ] Invariant cache hit.
[2024-05-28 13:56:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:56:33] [INFO ] Implicit Places using invariants and state equation in 5489 ms returned []
Implicit Place search using SMT with State Equation took 6017 ms to find 0 implicit places.
[2024-05-28 13:56:33] [INFO ] Redundant transitions in 6 ms returned []
Running 1120 sub problems to find dead transitions.
[2024-05-28 13:56:33] [INFO ] Flow matrix only has 1102 transitions (discarded 20 similar events)
[2024-05-28 13:56:33] [INFO ] Invariant cache hit.
[2024-05-28 13:56:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 43 places in 23 ms of which 1 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 199 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:56:44] [INFO ] Deduced a trap composed of 183 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:56:44] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 2 ms to minimize.
[2024-05-28 13:56:45] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 320 places in 425 ms of which 3 ms to minimize.
[2024-05-28 13:56:51] [INFO ] Deduced a trap composed of 229 places in 186 ms of which 2 ms to minimize.
[2024-05-28 13:56:52] [INFO ] Deduced a trap composed of 212 places in 197 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 13:56:59] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1612 variables, and 57 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 13:57:12] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 13:57:18] [INFO ] Deduced a trap composed of 179 places in 278 ms of which 3 ms to minimize.
[2024-05-28 13:57:18] [INFO ] Deduced a trap composed of 177 places in 248 ms of which 4 ms to minimize.
[2024-05-28 13:57:19] [INFO ] Deduced a trap composed of 213 places in 280 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 5 (OVERLAPS) 1/509 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/1612 variables, and 62 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 21/21 constraints]
After SMT, in 61544ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 61554ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109226 ms. Remains : 510/510 places, 1122/1122 transitions.
Built C files in :
/tmp/ltsmin13994834753526866516
[2024-05-28 13:57:34] [INFO ] Computing symmetric may disable matrix : 1122 transitions.
[2024-05-28 13:57:34] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:34] [INFO ] Computing symmetric may enable matrix : 1122 transitions.
[2024-05-28 13:57:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:35] [INFO ] Computing Do-Not-Accords matrix : 1122 transitions.
[2024-05-28 13:57:35] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:35] [INFO ] Built C files in 244ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13994834753526866516
Running compilation step : cd /tmp/ltsmin13994834753526866516;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13994834753526866516;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13994834753526866516;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 13:57:38] [INFO ] Flatten gal took : 73 ms
[2024-05-28 13:57:38] [INFO ] Flatten gal took : 62 ms
[2024-05-28 13:57:38] [INFO ] Time to serialize gal into /tmp/LTL7937459441846454725.gal : 18 ms
[2024-05-28 13:57:38] [INFO ] Time to serialize properties into /tmp/LTL8561233402583885797.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/LTL7937459441846454725.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17793746541459672243.hoa' '-atoms' '/tmp/LTL8561233402583885797.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/LTL8561233402583885797.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17793746541459672243.hoa
Detected timeout of ITS tools.
[2024-05-28 13:57:53] [INFO ] Flatten gal took : 59 ms
[2024-05-28 13:57:53] [INFO ] Flatten gal took : 52 ms
[2024-05-28 13:57:53] [INFO ] Time to serialize gal into /tmp/LTL4198986152913098990.gal : 10 ms
[2024-05-28 13:57:53] [INFO ] Time to serialize properties into /tmp/LTL3117088538886590487.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/LTL4198986152913098990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3117088538886590487.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((cBlockedTasks>=10)&&(PollingAbort>=1))&&((Abort_Check_Sources_E_7>=1)&&(ORB_Lock>=1)))&&(AbourtToModifySrc_1>=1))||((((...2447
Formula 0 simplified : G!"(((((((((cBlockedTasks>=10)&&(PollingAbort>=1))&&((Abort_Check_Sources_E_7>=1)&&(ORB_Lock>=1)))&&(AbourtToModifySrc_1>=1))||((((c...2443
Detected timeout of ITS tools.
[2024-05-28 13:58:08] [INFO ] Flatten gal took : 60 ms
[2024-05-28 13:58:08] [INFO ] Applying decomposition
[2024-05-28 13:58:09] [INFO ] Flatten gal took : 49 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/graph15650114826819159512.txt' '-o' '/tmp/graph15650114826819159512.bin' '-w' '/tmp/graph15650114826819159512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15650114826819159512.bin' '-l' '-1' '-v' '-w' '/tmp/graph15650114826819159512.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:58:09] [INFO ] Decomposing Gal with order
[2024-05-28 13:58:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:58:09] [INFO ] Removed a total of 828 redundant transitions.
[2024-05-28 13:58:09] [INFO ] Flatten gal took : 320 ms
[2024-05-28 13:58:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 692 labels/synchronizations in 62 ms.
[2024-05-28 13:58:09] [INFO ] Time to serialize gal into /tmp/LTL12907683859784718605.gal : 30 ms
[2024-05-28 13:58:09] [INFO ] Time to serialize properties into /tmp/LTL2182357025189698893.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12907683859784718605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2182357025189698893.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("(((((((((i5.u13.cBlockedTasks>=10)&&(i5.u13.PollingAbort>=1))&&((i5.u13.Abort_Check_Sources_E_7>=1)&&(i5.u13.ORB_Lock>=1)))&&(i5...3147
Formula 0 simplified : G!"(((((((((i5.u13.cBlockedTasks>=10)&&(i5.u13.PollingAbort>=1))&&((i5.u13.Abort_Check_Sources_E_7>=1)&&(i5.u13.ORB_Lock>=1)))&&(i5....3143
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-07 finished in 321475 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(((p1&&X(X(p2)))||p0)))'
Support contains 32 out of 740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 740/740 places, 1402/1402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 730 transition count 1392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 730 transition count 1392
Applied a total of 20 rules in 29 ms. Remains 730 /740 variables (removed 10) and now considering 1392/1402 (removed 10) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:58:24] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 13:58:24] [INFO ] Computed 52 invariants in 25 ms
[2024-05-28 13:58:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:58:39] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 6 ms to minimize.
[2024-05-28 13:58:39] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-28 13:58:39] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:58:39] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:58:39] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:58:39] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2024-05-28 13:58:40] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-28 13:58:40] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:58:40] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:58:40] [INFO ] Deduced a trap composed of 404 places in 276 ms of which 4 ms to minimize.
[2024-05-28 13:58:41] [INFO ] Deduced a trap composed of 209 places in 355 ms of which 5 ms to minimize.
[2024-05-28 13:58:42] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 2 ms to minimize.
[2024-05-28 13:58:42] [INFO ] Deduced a trap composed of 440 places in 396 ms of which 5 ms to minimize.
[2024-05-28 13:58:43] [INFO ] Deduced a trap composed of 432 places in 353 ms of which 5 ms to minimize.
[2024-05-28 13:58:43] [INFO ] Deduced a trap composed of 393 places in 432 ms of which 6 ms to minimize.
[2024-05-28 13:58:44] [INFO ] Deduced a trap composed of 411 places in 303 ms of which 3 ms to minimize.
[2024-05-28 13:58:44] [INFO ] Deduced a trap composed of 392 places in 407 ms of which 5 ms to minimize.
[2024-05-28 13:58:44] [INFO ] Deduced a trap composed of 370 places in 380 ms of which 5 ms to minimize.
[2024-05-28 13:58:45] [INFO ] Deduced a trap composed of 404 places in 401 ms of which 5 ms to minimize.
[2024-05-28 13:58:46] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:58:49] [INFO ] Deduced a trap composed of 360 places in 377 ms of which 5 ms to minimize.
[2024-05-28 13:58:58] [INFO ] Deduced a trap composed of 491 places in 359 ms of which 3 ms to minimize.
[2024-05-28 13:58:58] [INFO ] Deduced a trap composed of 493 places in 338 ms of which 3 ms to minimize.
[2024-05-28 13:58:58] [INFO ] Deduced a trap composed of 389 places in 400 ms of which 5 ms to minimize.
[2024-05-28 13:58:59] [INFO ] Deduced a trap composed of 381 places in 379 ms of which 5 ms to minimize.
[2024-05-28 13:58:59] [INFO ] Deduced a trap composed of 379 places in 326 ms of which 4 ms to minimize.
[2024-05-28 13:58:59] [INFO ] Deduced a trap composed of 448 places in 273 ms of which 4 ms to minimize.
[2024-05-28 13:59:00] [INFO ] Deduced a trap composed of 357 places in 341 ms of which 4 ms to minimize.
[2024-05-28 13:59:03] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 4 ms to minimize.
[2024-05-28 13:59:03] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 80 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 30/30 constraints]
After SMT, in 42121ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42142ms
[2024-05-28 13:59:07] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:59:07] [INFO ] Invariant cache hit.
[2024-05-28 13:59:07] [INFO ] Implicit Places using invariants in 664 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 680 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/740 places, 1392/1402 transitions.
Applied a total of 0 rules in 18 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42875 ms. Remains : 720/740 places, 1392/1402 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-08
Product exploration explored 100000 steps with 7645 reset in 478 ms.
Product exploration explored 100000 steps with 7625 reset in 439 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) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 170 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (12 resets) in 444 ms. (89 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40001 steps (23 resets) in 941 ms. (42 steps per ms) remains 1/1 properties
[2024-05-28 13:59:09] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2024-05-28 13:59:09] [INFO ] Computed 42 invariants in 27 ms
[2024-05-28 13:59:09] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 579/611 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 13:59:10] [INFO ] Deduced a trap composed of 213 places in 318 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/611 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 712/2092 variables, and 36 constraints, problems are : Problem set: 1 solved, 0 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 6/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 735ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1 p2))), (F (NOT p2))]
Knowledge based reduction with 13 factoid took 555 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-28 13:59:11] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:59:11] [INFO ] Invariant cache hit.
[2024-05-28 13:59:12] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2024-05-28 13:59:12] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 124 ms returned sat
[2024-05-28 13:59:13] [INFO ] [Real]Absence check using state equation in 1457 ms returned sat
[2024-05-28 13:59:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:59:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 27 ms returned sat
[2024-05-28 13:59:14] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 174 ms returned sat
[2024-05-28 13:59:18] [INFO ] [Nat]Absence check using state equation in 4232 ms returned sat
[2024-05-28 13:59:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:59:20] [INFO ] [Nat]Added 120 Read/Feed constraints in 1114 ms returned sat
[2024-05-28 13:59:20] [INFO ] Deduced a trap composed of 65 places in 349 ms of which 4 ms to minimize.
[2024-05-28 13:59:21] [INFO ] Deduced a trap composed of 64 places in 389 ms of which 5 ms to minimize.
[2024-05-28 13:59:22] [INFO ] Deduced a trap composed of 128 places in 341 ms of which 5 ms to minimize.
[2024-05-28 13:59:23] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 6 ms to minimize.
[2024-05-28 13:59:23] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:59:25] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 5020 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 32 out of 720 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 1392/1392 transitions.
Applied a total of 0 rules in 18 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:59:25] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:59:25] [INFO ] Invariant cache hit.
[2024-05-28 13:59:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:59:40] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:59:40] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2024-05-28 13:59:40] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-28 13:59:40] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:59:40] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:59:40] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:59:41] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-05-28 13:59:41] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:59:41] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:59:41] [INFO ] Deduced a trap composed of 403 places in 365 ms of which 5 ms to minimize.
[2024-05-28 13:59:42] [INFO ] Deduced a trap composed of 170 places in 269 ms of which 4 ms to minimize.
[2024-05-28 13:59:42] [INFO ] Deduced a trap composed of 214 places in 308 ms of which 5 ms to minimize.
[2024-05-28 13:59:42] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:59:43] [INFO ] Deduced a trap composed of 439 places in 402 ms of which 6 ms to minimize.
[2024-05-28 13:59:44] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:59:45] [INFO ] Deduced a trap composed of 380 places in 378 ms of which 5 ms to minimize.
[2024-05-28 13:59:45] [INFO ] Deduced a trap composed of 23 places in 437 ms of which 5 ms to minimize.
[2024-05-28 13:59:46] [INFO ] Deduced a trap composed of 410 places in 408 ms of which 5 ms to minimize.
[2024-05-28 13:59:46] [INFO ] Deduced a trap composed of 393 places in 421 ms of which 5 ms to minimize.
[2024-05-28 13:59:47] [INFO ] Deduced a trap composed of 401 places in 418 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:59:50] [INFO ] Deduced a trap composed of 450 places in 354 ms of which 4 ms to minimize.
[2024-05-28 13:59:50] [INFO ] Deduced a trap composed of 420 places in 310 ms of which 4 ms to minimize.
[2024-05-28 13:59:50] [INFO ] Deduced a trap composed of 376 places in 255 ms of which 3 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 377 places in 373 ms of which 6 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 364 places in 280 ms of which 5 ms to minimize.
[2024-05-28 14:00:06] [INFO ] Deduced a trap composed of 386 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:00:07] [INFO ] Deduced a trap composed of 101 places in 180 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 67 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 27/27 constraints]
After SMT, in 42560ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42586ms
[2024-05-28 14:00:07] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:00:07] [INFO ] Invariant cache hit.
[2024-05-28 14:00:08] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-28 14:00:08] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:00:08] [INFO ] Invariant cache hit.
[2024-05-28 14:00:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:00:17] [INFO ] Implicit Places using invariants and state equation in 9065 ms returned []
Implicit Place search using SMT with State Equation took 9477 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-28 14:00:17] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:00:17] [INFO ] Invariant cache hit.
[2024-05-28 14:00:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:00:32] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2024-05-28 14:00:32] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-28 14:00:32] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:00:32] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:00:32] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:00:32] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:00:33] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:00:33] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:00:33] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-28 14:00:34] [INFO ] Deduced a trap composed of 403 places in 408 ms of which 5 ms to minimize.
[2024-05-28 14:00:34] [INFO ] Deduced a trap composed of 170 places in 369 ms of which 5 ms to minimize.
[2024-05-28 14:00:35] [INFO ] Deduced a trap composed of 214 places in 320 ms of which 4 ms to minimize.
[2024-05-28 14:00:35] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:00:35] [INFO ] Deduced a trap composed of 439 places in 335 ms of which 4 ms to minimize.
[2024-05-28 14:00:36] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:00:36] [INFO ] Deduced a trap composed of 380 places in 272 ms of which 4 ms to minimize.
[2024-05-28 14:00:37] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 4 ms to minimize.
[2024-05-28 14:00:37] [INFO ] Deduced a trap composed of 410 places in 263 ms of which 4 ms to minimize.
[2024-05-28 14:00:37] [INFO ] Deduced a trap composed of 393 places in 329 ms of which 4 ms to minimize.
[2024-05-28 14:00:38] [INFO ] Deduced a trap composed of 401 places in 353 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:00:39] [INFO ] Deduced a trap composed of 395 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:00:40] [INFO ] Deduced a trap composed of 414 places in 245 ms of which 4 ms to minimize.
[2024-05-28 14:00:41] [INFO ] Deduced a trap composed of 379 places in 257 ms of which 4 ms to minimize.
[2024-05-28 14:00:41] [INFO ] Deduced a trap composed of 412 places in 255 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 64 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:00:58] [INFO ] Deduced a trap composed of 490 places in 258 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/718 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1390 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 718/2092 variables, and 65 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 25/25 constraints]
After SMT, in 62037ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 62068ms
Finished structural reductions in LTL mode , in 1 iterations and 114157 ms. Remains : 720/720 places, 1392/1392 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) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 103 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 265 steps (0 resets) in 7 ms. (33 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 238 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-28 14:01:20] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:01:20] [INFO ] Invariant cache hit.
[2024-05-28 14:01:20] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-05-28 14:01:20] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 88 ms returned sat
[2024-05-28 14:01:22] [INFO ] [Real]Absence check using state equation in 1344 ms returned sat
[2024-05-28 14:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:01:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 26 ms returned sat
[2024-05-28 14:01:22] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 185 ms returned sat
[2024-05-28 14:01:27] [INFO ] [Nat]Absence check using state equation in 4665 ms returned sat
[2024-05-28 14:01:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:01:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:01:30] [INFO ] [Nat]Added 120 Read/Feed constraints in 2891 ms returned sat
[2024-05-28 14:01:30] [INFO ] Deduced a trap composed of 65 places in 320 ms of which 4 ms to minimize.
[2024-05-28 14:01:32] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1889 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 7632 reset in 406 ms.
Product exploration explored 100000 steps with 7646 reset in 419 ms.
Built C files in :
/tmp/ltsmin679610898074230316
[2024-05-28 14:01:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin679610898074230316
Running compilation step : cd /tmp/ltsmin679610898074230316;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin679610898074230316;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin679610898074230316;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 32 out of 720 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 1392/1392 transitions.
Applied a total of 0 rules in 11 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 14:01:36] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:01:36] [INFO ] Invariant cache hit.
[2024-05-28 14:01:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:01:51] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 0 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:01:53] [INFO ] Deduced a trap composed of 403 places in 383 ms of which 5 ms to minimize.
[2024-05-28 14:01:54] [INFO ] Deduced a trap composed of 170 places in 349 ms of which 5 ms to minimize.
[2024-05-28 14:01:54] [INFO ] Deduced a trap composed of 214 places in 353 ms of which 5 ms to minimize.
[2024-05-28 14:01:54] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:01:55] [INFO ] Deduced a trap composed of 439 places in 409 ms of which 5 ms to minimize.
[2024-05-28 14:01:56] [INFO ] Deduced a trap composed of 75 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 380 places in 397 ms of which 5 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 4 ms to minimize.
[2024-05-28 14:01:57] [INFO ] Deduced a trap composed of 410 places in 368 ms of which 5 ms to minimize.
[2024-05-28 14:01:58] [INFO ] Deduced a trap composed of 393 places in 375 ms of which 5 ms to minimize.
[2024-05-28 14:01:58] [INFO ] Deduced a trap composed of 401 places in 376 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.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 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.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 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 timeout
0.0)
(s164 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:02:01] [INFO ] Deduced a trap composed of 450 places in 365 ms of which 5 ms to minimize.
[2024-05-28 14:02:02] [INFO ] Deduced a trap composed of 420 places in 339 ms of which 6 ms to minimize.
[2024-05-28 14:02:02] [INFO ] Deduced a trap composed of 376 places in 326 ms of which 6 ms to minimize.
[2024-05-28 14:02:03] [INFO ] Deduced a trap composed of 377 places in 389 ms of which 5 ms to minimize.
[2024-05-28 14:02:04] [INFO ] Deduced a trap composed of 364 places in 341 ms of which 4 ms to minimize.
[2024-05-28 14:02:17] [INFO ] Deduced a trap composed of 386 places in 358 ms of which 6 ms to minimize.
[2024-05-28 14:02:17] [INFO ] Deduced a trap composed of 101 places in 218 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 67 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 27/27 constraints]
After SMT, in 42728ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42750ms
[2024-05-28 14:02:19] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:02:19] [INFO ] Invariant cache hit.
[2024-05-28 14:02:19] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-28 14:02:19] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:02:19] [INFO ] Invariant cache hit.
[2024-05-28 14:02:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:02:29] [INFO ] Implicit Places using invariants and state equation in 9731 ms returned []
Implicit Place search using SMT with State Equation took 10132 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-28 14:02:29] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:02:29] [INFO ] Invariant cache hit.
[2024-05-28 14:02:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:02:43] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-28 14:02:43] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-28 14:02:44] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-28 14:02:44] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:02:44] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:02:44] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:02:44] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:02:44] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:02:44] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:02:45] [INFO ] Deduced a trap composed of 403 places in 402 ms of which 5 ms to minimize.
[2024-05-28 14:02:45] [INFO ] Deduced a trap composed of 170 places in 345 ms of which 5 ms to minimize.
[2024-05-28 14:02:46] [INFO ] Deduced a trap composed of 214 places in 344 ms of which 5 ms to minimize.
[2024-05-28 14:02:46] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:02:47] [INFO ] Deduced a trap composed of 439 places in 331 ms of which 5 ms to minimize.
[2024-05-28 14:02:47] [INFO ] Deduced a trap composed of 75 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:02:48] [INFO ] Deduced a trap composed of 380 places in 419 ms of which 5 ms to minimize.
[2024-05-28 14:02:49] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 6 ms to minimize.
[2024-05-28 14:02:49] [INFO ] Deduced a trap composed of 410 places in 335 ms of which 3 ms to minimize.
[2024-05-28 14:02:49] [INFO ] Deduced a trap composed of 393 places in 297 ms of which 4 ms to minimize.
[2024-05-28 14:02:50] [INFO ] Deduced a trap composed of 401 places in 299 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:02:51] [INFO ] Deduced a trap composed of 395 places in 356 ms of which 5 ms to minimize.
[2024-05-28 14:02:53] [INFO ] Deduced a trap composed of 414 places in 378 ms of which 5 ms to minimize.
[2024-05-28 14:02:53] [INFO ] Deduced a trap composed of 379 places in 347 ms of which 5 ms to minimize.
[2024-05-28 14:02:53] [INFO ] Deduced a trap composed of 412 places in 367 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 64 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:03:11] [INFO ] Deduced a trap composed of 490 places in 433 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/718 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 65 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 25/25 constraints]
After SMT, in 61880ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61893ms
Finished structural reductions in LTL mode , in 1 iterations and 114793 ms. Remains : 720/720 places, 1392/1392 transitions.
Built C files in :
/tmp/ltsmin9392136123800123539
[2024-05-28 14:03:31] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9392136123800123539
Running compilation step : cd /tmp/ltsmin9392136123800123539;'/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 2809 ms.
Running link step : cd /tmp/ltsmin9392136123800123539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9392136123800123539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9286198158120604180.hoa' '--buchi-type=spotba'
LTSmin run took 1528 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-08 finished in 311049 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(p1))))'
Support contains 62 out of 740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 740/740 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 740 transition count 1332
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 140 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 300 place count 590 transition count 1252
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 480 place count 500 transition count 1162
Applied a total of 480 rules in 41 ms. Remains 500 /740 variables (removed 240) and now considering 1162/1402 (removed 240) transitions.
Running 1160 sub problems to find dead transitions.
[2024-05-28 14:03:35] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 500 cols
[2024-05-28 14:03:35] [INFO ] Computed 52 invariants in 12 ms
[2024-05-28 14:03:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 14:03:45] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:03:45] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-05-28 14:03:45] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:03:45] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:03:45] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:03:45] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2024-05-28 14:03:45] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-05-28 14:03:45] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:03:45] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-05-28 14:03:45] [INFO ] Deduced a trap composed of 192 places in 184 ms of which 4 ms to minimize.
[2024-05-28 14:03:46] [INFO ] Deduced a trap composed of 215 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:03:46] [INFO ] Deduced a trap composed of 193 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:03:46] [INFO ] Deduced a trap composed of 187 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:03:46] [INFO ] Deduced a trap composed of 197 places in 265 ms of which 3 ms to minimize.
[2024-05-28 14:03:47] [INFO ] Deduced a trap composed of 201 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:03:47] [INFO ] Deduced a trap composed of 188 places in 307 ms of which 4 ms to minimize.
[2024-05-28 14:03:47] [INFO ] Deduced a trap composed of 204 places in 237 ms of which 3 ms to minimize.
[2024-05-28 14:03:48] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:03:50] [INFO ] Deduced a trap composed of 290 places in 223 ms of which 2 ms to minimize.
[2024-05-28 14:03:57] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1642 variables, and 70 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 14:04:02] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:04:13] [INFO ] Deduced a trap composed of 176 places in 275 ms of which 3 ms to minimize.
[2024-05-28 14:04:14] [INFO ] Deduced a trap composed of 91 places in 276 ms of which 3 ms to minimize.
[2024-05-28 14:04:15] [INFO ] Deduced a trap composed of 179 places in 206 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1642 variables, and 74 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 24/24 constraints]
After SMT, in 42056ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 42068ms
[2024-05-28 14:04:17] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-28 14:04:17] [INFO ] Invariant cache hit.
[2024-05-28 14:04:18] [INFO ] Implicit Places using invariants in 450 ms returned [444, 445, 446, 447, 448, 449, 450, 451, 452, 453]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 452 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 490/740 places, 1162/1402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 480 transition count 1152
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 480 transition count 1152
Applied a total of 20 rules in 20 ms. Remains 480 /490 variables (removed 10) and now considering 1152/1162 (removed 10) transitions.
[2024-05-28 14:04:18] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
// Phase 1: matrix 1132 rows 480 cols
[2024-05-28 14:04:18] [INFO ] Computed 42 invariants in 18 ms
[2024-05-28 14:04:18] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-28 14:04:18] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-28 14:04:18] [INFO ] Invariant cache hit.
[2024-05-28 14:04:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:04:24] [INFO ] Implicit Places using invariants and state equation in 6032 ms returned []
Implicit Place search using SMT with State Equation took 6505 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 480/740 places, 1152/1402 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49091 ms. Remains : 480/740 places, 1152/1402 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-09
Stuttering criterion allowed to conclude after 4223 steps with 6 reset in 24 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-09 finished in 49260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U G(!p1))&&X(G(!p1)))))'
Support contains 31 out of 740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 740/740 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 740 transition count 1362
Reduce places removed 40 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 90 place count 700 transition count 1352
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 690 transition count 1352
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 100 place count 690 transition count 1262
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 280 place count 600 transition count 1262
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 400 place count 540 transition count 1202
Applied a total of 400 rules in 65 ms. Remains 540 /740 variables (removed 200) and now considering 1202/1402 (removed 200) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-28 14:04:25] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
// Phase 1: matrix 1182 rows 540 cols
[2024-05-28 14:04:25] [INFO ] Computed 52 invariants in 27 ms
[2024-05-28 14:04:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:04:36] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-05-28 14:04:36] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:04:37] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:04:37] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:04:37] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:04:37] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:04:37] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 0 ms to minimize.
[2024-05-28 14:04:37] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:04:37] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:04:38] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 3 ms to minimize.
[2024-05-28 14:04:38] [INFO ] Deduced a trap composed of 226 places in 366 ms of which 4 ms to minimize.
[2024-05-28 14:04:38] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 4 ms to minimize.
[2024-05-28 14:04:39] [INFO ] Deduced a trap composed of 236 places in 328 ms of which 3 ms to minimize.
[2024-05-28 14:04:39] [INFO ] Deduced a trap composed of 242 places in 305 ms of which 3 ms to minimize.
[2024-05-28 14:04:39] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:04:43] [INFO ] Deduced a trap composed of 330 places in 372 ms of which 32 ms to minimize.
[2024-05-28 14:04:47] [INFO ] Deduced a trap composed of 192 places in 365 ms of which 5 ms to minimize.
[2024-05-28 14:04:47] [INFO ] Deduced a trap composed of 238 places in 210 ms of which 3 ms to minimize.
SMT process timed out in 22507ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 22527ms
[2024-05-28 14:04:47] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:04:47] [INFO ] Invariant cache hit.
[2024-05-28 14:04:48] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-28 14:04:48] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:04:48] [INFO ] Invariant cache hit.
[2024-05-28 14:04:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:04:53] [INFO ] Implicit Places using invariants and state equation in 5335 ms returned []
Implicit Place search using SMT with State Equation took 5733 ms to find 0 implicit places.
[2024-05-28 14:04:53] [INFO ] Redundant transitions in 7 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-28 14:04:53] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:04:53] [INFO ] Invariant cache hit.
[2024-05-28 14:04:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 3 ms to minimize.
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:05:05] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:05:11] [INFO ] Deduced a trap composed of 201 places in 293 ms of which 4 ms to minimize.
[2024-05-28 14:05:12] [INFO ] Deduced a trap composed of 247 places in 286 ms of which 4 ms to minimize.
[2024-05-28 14:05:12] [INFO ] Deduced a trap composed of 250 places in 276 ms of which 4 ms to minimize.
[2024-05-28 14:05:13] [INFO ] Deduced a trap composed of 265 places in 310 ms of which 4 ms to minimize.
[2024-05-28 14:05:13] [INFO ] Deduced a trap composed of 254 places in 263 ms of which 4 ms to minimize.
[2024-05-28 14:05:13] [INFO ] Deduced a trap composed of 258 places in 303 ms of which 4 ms to minimize.
[2024-05-28 14:05:14] [INFO ] Deduced a trap composed of 240 places in 292 ms of which 5 ms to minimize.
[2024-05-28 14:05:14] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 4 ms to minimize.
[2024-05-28 14:05:14] [INFO ] Deduced a trap composed of 107 places in 260 ms of which 3 ms to minimize.
[2024-05-28 14:05:14] [INFO ] Deduced a trap composed of 95 places in 230 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:05:21] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 1.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 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.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 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 10.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 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 538/1722 variables, and 71 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:05:29] [INFO ] Deduced a trap composed of 223 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:05:31] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-28 14:05:31] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:05:34] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:05:42] [INFO ] Deduced a trap composed of 237 places in 292 ms of which 4 ms to minimize.
[2024-05-28 14:05:42] [INFO ] Deduced a trap composed of 229 places in 278 ms of which 3 ms to minimize.
[2024-05-28 14:05:42] [INFO ] Deduced a trap composed of 249 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:05:42] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:05:43] [INFO ] Deduced a trap composed of 226 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:05:43] [INFO ] Deduced a trap composed of 240 places in 240 ms of which 3 ms to minimize.
[2024-05-28 14:05:43] [INFO ] Deduced a trap composed of 231 places in 359 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1722 variables, and 82 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 32/32 constraints]
After SMT, in 61896ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 61910ms
Starting structural reductions in SI_LTL mode, iteration 1 : 540/740 places, 1202/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90264 ms. Remains : 540/740 places, 1202/1402 transitions.
Stuttering acceptance computed with spot in 154 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-10
Product exploration explored 100000 steps with 4757 reset in 427 ms.
Product exploration explored 100000 steps with 4784 reset in 453 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 146 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 154 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 99 steps (0 resets) in 7 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 296 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 134 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 129 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
[2024-05-28 14:05:57] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:05:57] [INFO ] Invariant cache hit.
[2024-05-28 14:05:57] [INFO ] [Real]Absence check using 13 positive place invariants in 27 ms returned sat
[2024-05-28 14:05:58] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 185 ms returned sat
[2024-05-28 14:06:01] [INFO ] [Real]Absence check using state equation in 2875 ms returned sat
[2024-05-28 14:06:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:06:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-28 14:06:01] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 116 ms returned sat
[2024-05-28 14:06:03] [INFO ] [Nat]Absence check using state equation in 2215 ms returned sat
[2024-05-28 14:06:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:06:04] [INFO ] [Nat]Added 120 Read/Feed constraints in 352 ms returned sat
[2024-05-28 14:06:04] [INFO ] Deduced a trap composed of 213 places in 298 ms of which 4 ms to minimize.
[2024-05-28 14:06:05] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:06:06] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2297 ms
Could not prove EG p1
Support contains 31 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 1202/1202 transitions.
Applied a total of 0 rules in 30 ms. Remains 540 /540 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-28 14:06:06] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:06:06] [INFO ] Invariant cache hit.
[2024-05-28 14:06:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:06:18] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:06:18] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 6 ms to minimize.
[2024-05-28 14:06:18] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-28 14:06:18] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:06:18] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:06:18] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:06:18] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-28 14:06:18] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:06:18] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:06:19] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:06:24] [INFO ] Deduced a trap composed of 201 places in 279 ms of which 4 ms to minimize.
[2024-05-28 14:06:25] [INFO ] Deduced a trap composed of 247 places in 276 ms of which 4 ms to minimize.
[2024-05-28 14:06:25] [INFO ] Deduced a trap composed of 250 places in 249 ms of which 4 ms to minimize.
[2024-05-28 14:06:26] [INFO ] Deduced a trap composed of 265 places in 217 ms of which 2 ms to minimize.
[2024-05-28 14:06:26] [INFO ] Deduced a trap composed of 254 places in 274 ms of which 4 ms to minimize.
[2024-05-28 14:06:26] [INFO ] Deduced a trap composed of 258 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:06:27] [INFO ] Deduced a trap composed of 240 places in 254 ms of which 2 ms to minimize.
[2024-05-28 14:06:27] [INFO ] Deduced a trap composed of 67 places in 307 ms of which 5 ms to minimize.
[2024-05-28 14:06:27] [INFO ] Deduced a trap composed of 107 places in 402 ms of which 4 ms to minimize.
[2024-05-28 14:06:28] [INFO ] Deduced a trap composed of 95 places in 282 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1722 variables, and 70 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:06:30] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:06:32] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:06:34] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 3 ms to minimize.
[2024-05-28 14:06:35] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:06:38] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 1200 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 538/1722 variables, and 75 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 25/25 constraints]
After SMT, in 42573ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 42593ms
[2024-05-28 14:06:49] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:06:49] [INFO ] Invariant cache hit.
[2024-05-28 14:06:49] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-28 14:06:49] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:06:49] [INFO ] Invariant cache hit.
[2024-05-28 14:06:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:06:55] [INFO ] Implicit Places using invariants and state equation in 5784 ms returned []
Implicit Place search using SMT with State Equation took 6157 ms to find 0 implicit places.
[2024-05-28 14:06:55] [INFO ] Redundant transitions in 15 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-28 14:06:55] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:06:55] [INFO ] Invariant cache hit.
[2024-05-28 14:06:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:07:06] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:07:06] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-28 14:07:06] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-05-28 14:07:06] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:07:07] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:07:07] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:07:07] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-28 14:07:07] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:07:07] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:07:08] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:07:14] [INFO ] Deduced a trap composed of 201 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:07:14] [INFO ] Deduced a trap composed of 247 places in 243 ms of which 3 ms to minimize.
[2024-05-28 14:07:15] [INFO ] Deduced a trap composed of 250 places in 273 ms of which 4 ms to minimize.
[2024-05-28 14:07:15] [INFO ] Deduced a trap composed of 265 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:07:15] [INFO ] Deduced a trap composed of 254 places in 292 ms of which 5 ms to minimize.
[2024-05-28 14:07:15] [INFO ] Deduced a trap composed of 258 places in 312 ms of which 4 ms to minimize.
[2024-05-28 14:07:16] [INFO ] Deduced a trap composed of 240 places in 323 ms of which 4 ms to minimize.
[2024-05-28 14:07:16] [INFO ] Deduced a trap composed of 67 places in 333 ms of which 4 ms to minimize.
[2024-05-28 14:07:16] [INFO ] Deduced a trap composed of 107 places in 284 ms of which 4 ms to minimize.
[2024-05-28 14:07:17] [INFO ] Deduced a trap composed of 95 places in 259 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:07:24] [INFO ] Deduced a trap composed of 3 places in 304 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1722 variables, and 71 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:07:31] [INFO ] Deduced a trap composed of 223 places in 184 ms of which 2 ms to minimize.
[2024-05-28 14:07:34] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 3 ms to minimize.
[2024-05-28 14:07:34] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:07:38] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:07:44] [INFO ] Deduced a trap composed of 237 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:07:45] [INFO ] Deduced a trap composed of 229 places in 222 ms of which 2 ms to minimize.
[2024-05-28 14:07:45] [INFO ] Deduced a trap composed of 249 places in 234 ms of which 3 ms to minimize.
[2024-05-28 14:07:45] [INFO ] Deduced a trap composed of 224 places in 226 ms of which 2 ms to minimize.
[2024-05-28 14:07:45] [INFO ] Deduced a trap composed of 226 places in 210 ms of which 2 ms to minimize.
[2024-05-28 14:07:46] [INFO ] Deduced a trap composed of 240 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:07:46] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1722 variables, and 82 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 32/32 constraints]
After SMT, in 62108ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 62125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110937 ms. Remains : 540/540 places, 1202/1202 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 (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 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 118 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 72 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 205 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 118 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
[2024-05-28 14:07:58] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:07:58] [INFO ] Invariant cache hit.
[2024-05-28 14:07:58] [INFO ] [Real]Absence check using 13 positive place invariants in 27 ms returned sat
[2024-05-28 14:07:59] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 184 ms returned sat
[2024-05-28 14:08:02] [INFO ] [Real]Absence check using state equation in 3320 ms returned sat
[2024-05-28 14:08:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:08:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-05-28 14:08:03] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 191 ms returned sat
[2024-05-28 14:08:04] [INFO ] [Nat]Absence check using state equation in 1800 ms returned sat
[2024-05-28 14:08:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:08:05] [INFO ] [Nat]Added 120 Read/Feed constraints in 453 ms returned sat
[2024-05-28 14:08:05] [INFO ] Deduced a trap composed of 213 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:08:06] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-05-28 14:08:07] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2250 ms
Could not prove EG p1
Stuttering acceptance computed with spot in 140 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 4765 reset in 588 ms.
Product exploration explored 100000 steps with 4789 reset in 470 ms.
Built C files in :
/tmp/ltsmin15419662843914375839
[2024-05-28 14:08:08] [INFO ] Computing symmetric may disable matrix : 1202 transitions.
[2024-05-28 14:08:08] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:08:08] [INFO ] Computing symmetric may enable matrix : 1202 transitions.
[2024-05-28 14:08:08] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:08:09] [INFO ] Computing Do-Not-Accords matrix : 1202 transitions.
[2024-05-28 14:08:09] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:08:09] [INFO ] Built C files in 368ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15419662843914375839
Running compilation step : cd /tmp/ltsmin15419662843914375839;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15419662843914375839;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15419662843914375839;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 31 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 1202/1202 transitions.
Applied a total of 0 rules in 28 ms. Remains 540 /540 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-28 14:08:12] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:08:12] [INFO ] Invariant cache hit.
[2024-05-28 14:08:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:08:22] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 4 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:08:23] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:08:24] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2024-05-28 14:08:30] [INFO ] Deduced a trap composed of 201 places in 300 ms of which 4 ms to minimize.
[2024-05-28 14:08:31] [INFO ] Deduced a trap composed of 247 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:08:32] [INFO ] Deduced a trap composed of 250 places in 243 ms of which 3 ms to minimize.
[2024-05-28 14:08:32] [INFO ] Deduced a trap composed of 265 places in 328 ms of which 5 ms to minimize.
[2024-05-28 14:08:32] [INFO ] Deduced a trap composed of 254 places in 243 ms of which 4 ms to minimize.
[2024-05-28 14:08:32] [INFO ] Deduced a trap composed of 258 places in 233 ms of which 3 ms to minimize.
[2024-05-28 14:08:33] [INFO ] Deduced a trap composed of 240 places in 211 ms of which 4 ms to minimize.
[2024-05-28 14:08:33] [INFO ] Deduced a trap composed of 67 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:08:33] [INFO ] Deduced a trap composed of 107 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:08:33] [INFO ] Deduced a trap composed of 95 places in 221 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1722 variables, and 70 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:08:35] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:08:37] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 2 ms to minimize.
[2024-05-28 14:08:40] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-28 14:08:40] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:08:43] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1722 variables, and 75 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 25/25 constraints]
After SMT, in 41793ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 41806ms
[2024-05-28 14:08:54] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:08:54] [INFO ] Invariant cache hit.
[2024-05-28 14:08:54] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-28 14:08:54] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:08:54] [INFO ] Invariant cache hit.
[2024-05-28 14:08:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:09:00] [INFO ] Implicit Places using invariants and state equation in 5883 ms returned []
Implicit Place search using SMT with State Equation took 6413 ms to find 0 implicit places.
[2024-05-28 14:09:00] [INFO ] Redundant transitions in 18 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-28 14:09:00] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-28 14:09:00] [INFO ] Invariant cache hit.
[2024-05-28 14:09:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:09:10] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:09:10] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-05-28 14:09:10] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-05-28 14:09:10] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:09:10] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:09:10] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:09:10] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:09:10] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:09:11] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 0 ms to minimize.
[2024-05-28 14:09:11] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:09:17] [INFO ] Deduced a trap composed of 201 places in 274 ms of which 4 ms to minimize.
[2024-05-28 14:09:18] [INFO ] Deduced a trap composed of 247 places in 279 ms of which 3 ms to minimize.
[2024-05-28 14:09:18] [INFO ] Deduced a trap composed of 250 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:09:19] [INFO ] Deduced a trap composed of 265 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:09:19] [INFO ] Deduced a trap composed of 254 places in 209 ms of which 2 ms to minimize.
[2024-05-28 14:09:19] [INFO ] Deduced a trap composed of 258 places in 210 ms of which 2 ms to minimize.
[2024-05-28 14:09:19] [INFO ] Deduced a trap composed of 240 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:09:20] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:09:20] [INFO ] Deduced a trap composed of 107 places in 215 ms of which 2 ms to minimize.
[2024-05-28 14:09:20] [INFO ] Deduced a trap composed of 95 places in 265 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:09:27] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 4 ms to minimize.
[2024-05-28 14:09:31] [INFO ] Deduced a trap composed of 221 places in 198 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1722 variables, and 72 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:09:37] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-28 14:09:41] [INFO ] Deduced a trap composed of 197 places in 312 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 14:09:52] [INFO ] Deduced a trap composed of 330 places in 284 ms of which 4 ms to minimize.
[2024-05-28 14:09:56] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1722 variables, and 76 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 26/26 constraints]
After SMT, in 61869ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 61888ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110172 ms. Remains : 540/540 places, 1202/1202 transitions.
Built C files in :
/tmp/ltsmin9656044885859216044
[2024-05-28 14:10:02] [INFO ] Computing symmetric may disable matrix : 1202 transitions.
[2024-05-28 14:10:02] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:10:02] [INFO ] Computing symmetric may enable matrix : 1202 transitions.
[2024-05-28 14:10:02] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:10:02] [INFO ] Computing Do-Not-Accords matrix : 1202 transitions.
[2024-05-28 14:10:02] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:10:02] [INFO ] Built C files in 240ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9656044885859216044
Running compilation step : cd /tmp/ltsmin9656044885859216044;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9656044885859216044;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9656044885859216044;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 14:10:05] [INFO ] Flatten gal took : 95 ms
[2024-05-28 14:10:05] [INFO ] Flatten gal took : 55 ms
[2024-05-28 14:10:06] [INFO ] Time to serialize gal into /tmp/LTL4321631830725061759.gal : 51 ms
[2024-05-28 14:10:06] [INFO ] Time to serialize properties into /tmp/LTL18446223463916969041.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4321631830725061759.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3087087333777558056.hoa' '-atoms' '/tmp/LTL18446223463916969041.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/LTL18446223463916969041.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3087087333777558056.hoa
Detected timeout of ITS tools.
[2024-05-28 14:10:21] [INFO ] Flatten gal took : 50 ms
[2024-05-28 14:10:21] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:10:21] [INFO ] Time to serialize gal into /tmp/LTL347225587671177570.gal : 8 ms
[2024-05-28 14:10:21] [INFO ] Time to serialize properties into /tmp/LTL6218103306482081310.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL347225587671177570.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6218103306482081310.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...274
Read 1 LTL properties
Checking formula 0 : !((F(((F("(((((((AwakeTasks_6>=1)&&(Idle_6>=1))&&(ORB_Lock>=1))||(((AwakeTasks_7>=1)&&(Idle_7>=1))&&(ORB_Lock>=1)))||((((AwakeTasks_1>...1209
Formula 0 simplified : G((G!"(((((((AwakeTasks_6>=1)&&(Idle_6>=1))&&(ORB_Lock>=1))||(((AwakeTasks_7>=1)&&(Idle_7>=1))&&(ORB_Lock>=1)))||((((AwakeTasks_1>=1...1194
Detected timeout of ITS tools.
[2024-05-28 14:10:36] [INFO ] Flatten gal took : 69 ms
[2024-05-28 14:10:36] [INFO ] Applying decomposition
[2024-05-28 14:10:36] [INFO ] Flatten gal took : 51 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/graph8688120182438967757.txt' '-o' '/tmp/graph8688120182438967757.bin' '-w' '/tmp/graph8688120182438967757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8688120182438967757.bin' '-l' '-1' '-v' '-w' '/tmp/graph8688120182438967757.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:10:36] [INFO ] Decomposing Gal with order
[2024-05-28 14:10:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:10:36] [INFO ] Removed a total of 760 redundant transitions.
[2024-05-28 14:10:36] [INFO ] Flatten gal took : 167 ms
[2024-05-28 14:10:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 513 labels/synchronizations in 37 ms.
[2024-05-28 14:10:36] [INFO ] Time to serialize gal into /tmp/LTL8919612285047168667.gal : 14 ms
[2024-05-28 14:10:36] [INFO ] Time to serialize properties into /tmp/LTL5667463852978518453.ltl : 39 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/LTL8919612285047168667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5667463852978518453.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(((F("(((((((u5.AwakeTasks_6>=1)&&(i8.u32.Idle_6>=1))&&(i8.u4.ORB_Lock>=1))||(((u5.AwakeTasks_7>=1)&&(i8.u17.Idle_7>=1))&&(i8.u4.O...1503
Formula 0 simplified : G((G!"(((((((u5.AwakeTasks_6>=1)&&(i8.u32.Idle_6>=1))&&(i8.u4.ORB_Lock>=1))||(((u5.AwakeTasks_7>=1)&&(i8.u17.Idle_7>=1))&&(i8.u4.ORB...1488
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-10 finished in 386954 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)||(p1 U X(p2))))'
Support contains 20 out of 740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 740/740 places, 1402/1402 transitions.
Applied a total of 0 rules in 9 ms. Remains 740 /740 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-28 14:10:52] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 740 cols
[2024-05-28 14:10:52] [INFO ] Computed 52 invariants in 28 ms
[2024-05-28 14:10:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-28 14:11:07] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-28 14:11:08] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-05-28 14:11:08] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:11:08] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:11:08] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
[2024-05-28 14:11:08] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:11:08] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:11:08] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:11:08] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:11:09] [INFO ] Deduced a trap composed of 420 places in 401 ms of which 5 ms to minimize.
[2024-05-28 14:11:09] [INFO ] Deduced a trap composed of 393 places in 402 ms of which 6 ms to minimize.
[2024-05-28 14:11:10] [INFO ] Deduced a trap composed of 396 places in 362 ms of which 4 ms to minimize.
[2024-05-28 14:11:10] [INFO ] Deduced a trap composed of 421 places in 323 ms of which 6 ms to minimize.
[2024-05-28 14:11:11] [INFO ] Deduced a trap composed of 216 places in 353 ms of which 5 ms to minimize.
[2024-05-28 14:11:12] [INFO ] Deduced a trap composed of 395 places in 310 ms of which 4 ms to minimize.
[2024-05-28 14:11:12] [INFO ] Deduced a trap composed of 416 places in 266 ms of which 4 ms to minimize.
[2024-05-28 14:11:13] [INFO ] Deduced a trap composed of 412 places in 277 ms of which 3 ms to minimize.
[2024-05-28 14:11:13] [INFO ] Deduced a trap composed of 404 places in 316 ms of which 4 ms to minimize.
[2024-05-28 14:11:13] [INFO ] Deduced a trap composed of 409 places in 271 ms of which 4 ms to minimize.
[2024-05-28 14:11:14] [INFO ] Deduced a trap composed of 410 places in 373 ms of which 16 ms to minimize.
SMT process timed out in 22180ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 22196ms
[2024-05-28 14:11:14] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-28 14:11:14] [INFO ] Invariant cache hit.
[2024-05-28 14:11:14] [INFO ] Implicit Places using invariants in 455 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 472 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/740 places, 1402/1402 transitions.
Applied a total of 0 rules in 7 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22688 ms. Remains : 730/740 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-11 finished in 22920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 21 out of 740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 740/740 places, 1402/1402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 730 transition count 1392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 730 transition count 1392
Applied a total of 20 rules in 17 ms. Remains 730 /740 variables (removed 10) and now considering 1392/1402 (removed 10) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 14:11:15] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 14:11:15] [INFO ] Computed 52 invariants in 27 ms
[2024-05-28 14:11:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:11:29] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-28 14:11:29] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-28 14:11:29] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:11:29] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 0 ms to minimize.
[2024-05-28 14:11:29] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2024-05-28 14:11:29] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:11:30] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:11:30] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:11:30] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 0 ms to minimize.
[2024-05-28 14:11:30] [INFO ] Deduced a trap composed of 404 places in 261 ms of which 4 ms to minimize.
[2024-05-28 14:11:31] [INFO ] Deduced a trap composed of 209 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:11:31] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:11:32] [INFO ] Deduced a trap composed of 440 places in 332 ms of which 6 ms to minimize.
[2024-05-28 14:11:32] [INFO ] Deduced a trap composed of 432 places in 359 ms of which 10 ms to minimize.
[2024-05-28 14:11:33] [INFO ] Deduced a trap composed of 393 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:11:33] [INFO ] Deduced a trap composed of 411 places in 381 ms of which 5 ms to minimize.
[2024-05-28 14:11:33] [INFO ] Deduced a trap composed of 392 places in 263 ms of which 3 ms to minimize.
[2024-05-28 14:11:34] [INFO ] Deduced a trap composed of 370 places in 247 ms of which 4 ms to minimize.
[2024-05-28 14:11:34] [INFO ] Deduced a trap composed of 404 places in 243 ms of which 4 ms to minimize.
[2024-05-28 14:11:35] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:11:37] [INFO ] Deduced a trap composed of 356 places in 351 ms of which 4 ms to minimize.
SMT process timed out in 22046ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 22061ms
[2024-05-28 14:11:37] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:11:37] [INFO ] Invariant cache hit.
[2024-05-28 14:11:37] [INFO ] Implicit Places using invariants in 389 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 391 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/740 places, 1392/1402 transitions.
Applied a total of 0 rules in 6 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22480 ms. Remains : 720/740 places, 1392/1402 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-12
Product exploration explored 100000 steps with 1317 reset in 294 ms.
Product exploration explored 100000 steps with 1316 reset in 381 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 7 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 14:11:39] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2024-05-28 14:11:39] [INFO ] Computed 42 invariants in 29 ms
[2024-05-28 14:11:39] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2024-05-28 14:11:40] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 161 ms returned sat
[2024-05-28 14:11:41] [INFO ] [Real]Absence check using state equation in 1245 ms returned sat
[2024-05-28 14:11:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:11:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 70 ms returned sat
[2024-05-28 14:11:42] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 172 ms returned sat
[2024-05-28 14:11:44] [INFO ] [Nat]Absence check using state equation in 1858 ms returned sat
[2024-05-28 14:11:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:11:44] [INFO ] [Nat]Added 120 Read/Feed constraints in 330 ms returned sat
[2024-05-28 14:11:44] [INFO ] Computed and/alt/rep : 700/1378/690 causal constraints (skipped 680 transitions) in 141 ms.
[2024-05-28 14:11:53] [INFO ] Added : 200 causal constraints over 40 iterations in 8614 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 720 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 1392/1392 transitions.
Applied a total of 0 rules in 15 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 14:11:53] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:11:53] [INFO ] Invariant cache hit.
[2024-05-28 14:11:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:12:07] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2024-05-28 14:12:07] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:12:07] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:12:08] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:12:08] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:12:08] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:12:08] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:12:08] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:12:08] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:12:09] [INFO ] Deduced a trap composed of 403 places in 398 ms of which 6 ms to minimize.
[2024-05-28 14:12:09] [INFO ] Deduced a trap composed of 170 places in 280 ms of which 5 ms to minimize.
[2024-05-28 14:12:10] [INFO ] Deduced a trap composed of 214 places in 310 ms of which 5 ms to minimize.
[2024-05-28 14:12:10] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:12:10] [INFO ] Deduced a trap composed of 439 places in 408 ms of which 5 ms to minimize.
[2024-05-28 14:12:11] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:12:12] [INFO ] Deduced a trap composed of 380 places in 275 ms of which 3 ms to minimize.
[2024-05-28 14:12:12] [INFO ] Deduced a trap composed of 23 places in 379 ms of which 5 ms to minimize.
[2024-05-28 14:12:12] [INFO ] Deduced a trap composed of 410 places in 355 ms of which 5 ms to minimize.
[2024-05-28 14:12:13] [INFO ] Deduced a trap composed of 393 places in 276 ms of which 4 ms to minimize.
[2024-05-28 14:12:13] [INFO ] Deduced a trap composed of 401 places in 336 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:12:15] [INFO ] Deduced a trap composed of 395 places in 453 ms of which 5 ms to minimize.
SMT process timed out in 22260ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 22284ms
[2024-05-28 14:12:15] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:12:15] [INFO ] Invariant cache hit.
[2024-05-28 14:12:15] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-05-28 14:12:15] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:12:15] [INFO ] Invariant cache hit.
[2024-05-28 14:12:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:12:25] [INFO ] Implicit Places using invariants and state equation in 9220 ms returned []
Implicit Place search using SMT with State Equation took 9707 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-28 14:12:25] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:12:25] [INFO ] Invariant cache hit.
[2024-05-28 14:12:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:12:39] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:12:39] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:12:39] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 1 ms to minimize.
[2024-05-28 14:12:39] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:12:39] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:12:39] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:12:39] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:12:39] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:12:39] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:12:40] [INFO ] Deduced a trap composed of 403 places in 373 ms of which 5 ms to minimize.
[2024-05-28 14:12:41] [INFO ] Deduced a trap composed of 170 places in 356 ms of which 5 ms to minimize.
[2024-05-28 14:12:41] [INFO ] Deduced a trap composed of 214 places in 349 ms of which 5 ms to minimize.
[2024-05-28 14:12:41] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:12:42] [INFO ] Deduced a trap composed of 439 places in 411 ms of which 6 ms to minimize.
[2024-05-28 14:12:43] [INFO ] Deduced a trap composed of 75 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:12:44] [INFO ] Deduced a trap composed of 380 places in 388 ms of which 5 ms to minimize.
[2024-05-28 14:12:44] [INFO ] Deduced a trap composed of 23 places in 392 ms of which 5 ms to minimize.
[2024-05-28 14:12:44] [INFO ] Deduced a trap composed of 410 places in 351 ms of which 4 ms to minimize.
[2024-05-28 14:12:45] [INFO ] Deduced a trap composed of 393 places in 334 ms of which 4 ms to minimize.
[2024-05-28 14:12:45] [INFO ] Deduced a trap composed of 401 places in 347 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:12:47] [INFO ] Deduced a trap composed of 395 places in 361 ms of which 5 ms to minimize.
[2024-05-28 14:12:48] [INFO ] Deduced a trap composed of 414 places in 276 ms of which 4 ms to minimize.
[2024-05-28 14:12:48] [INFO ] Deduced a trap composed of 379 places in 292 ms of which 4 ms to minimize.
[2024-05-28 14:12:49] [INFO ] Deduced a trap composed of 412 places in 292 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 64 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:13:06] [INFO ] Deduced a trap composed of 490 places in 237 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/718 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 65 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 25/25 constraints]
After SMT, in 61720ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61733ms
Finished structural reductions in LTL mode , in 1 iterations and 93749 ms. Remains : 720/720 places, 1392/1392 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 : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 294 steps (0 resets) in 7 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 14:13:27] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:13:27] [INFO ] Invariant cache hit.
[2024-05-28 14:13:28] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2024-05-28 14:13:28] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 118 ms returned sat
[2024-05-28 14:13:29] [INFO ] [Real]Absence check using state equation in 1180 ms returned sat
[2024-05-28 14:13:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:13:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 81 ms returned sat
[2024-05-28 14:13:30] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 113 ms returned sat
[2024-05-28 14:13:31] [INFO ] [Nat]Absence check using state equation in 1441 ms returned sat
[2024-05-28 14:13:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:13:32] [INFO ] [Nat]Added 120 Read/Feed constraints in 220 ms returned sat
[2024-05-28 14:13:32] [INFO ] Deduced a trap composed of 441 places in 272 ms of which 4 ms to minimize.
[2024-05-28 14:13:32] [INFO ] Deduced a trap composed of 141 places in 384 ms of which 5 ms to minimize.
[2024-05-28 14:13:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1029 ms
[2024-05-28 14:13:33] [INFO ] Computed and/alt/rep : 700/1378/690 causal constraints (skipped 680 transitions) in 107 ms.
[2024-05-28 14:13:40] [INFO ] Added : 290 causal constraints over 59 iterations in 7313 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1307 reset in 395 ms.
Product exploration explored 100000 steps with 1314 reset in 421 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 720 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 720/720 places, 1392/1392 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 720 transition count 1392
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 50 place count 720 transition count 1482
Deduced a syphon composed of 140 places in 2 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 140 place count 720 transition count 1482
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 160 place count 700 transition count 1462
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 180 place count 700 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 260 place count 700 transition count 1462
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 280 place count 680 transition count 1442
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 300 place count 680 transition count 1442
Deduced a syphon composed of 180 places in 1 ms
Applied a total of 300 rules in 170 ms. Remains 680 /720 variables (removed 40) and now considering 1442/1392 (removed -50) transitions.
Running 1440 sub problems to find dead transitions.
[2024-05-28 14:13:41] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
// Phase 1: matrix 1422 rows 680 cols
[2024-05-28 14:13:41] [INFO ] Computed 42 invariants in 43 ms
[2024-05-28 14:13:41] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-28 14:13:58] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-05-28 14:13:58] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:13:58] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:13:58] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-05-28 14:13:58] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:13:59] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:13:59] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:13:59] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:13:59] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:13:59] [INFO ] Deduced a trap composed of 201 places in 338 ms of which 4 ms to minimize.
[2024-05-28 14:14:01] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/2102 variables, and 51 constraints, problems are : Problem set: 20 solved, 1420 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/680 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 20 solved, 1420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 12/12 constraints. Problems are: Problem set: 20 solved, 1420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 26/38 constraints. Problems are: Problem set: 20 solved, 1420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/658 variables, 11/49 constraints. Problems are: Problem set: 20 solved, 1420 unsolved
[2024-05-28 14:14:07] [INFO ] Deduced a trap composed of 192 places in 229 ms of which 2 ms to minimize.
[2024-05-28 14:14:07] [INFO ] Deduced a trap composed of 175 places in 153 ms of which 2 ms to minimize.
[2024-05-28 14:14:14] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 1 ms to minimize.
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
[2024-05-28 14:14:14] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
[2024-05-28 14:14:15] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:14:15] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
[2024-05-28 14:14:15] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
[2024-05-28 14:14:15] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
[2024-05-28 14:14:15] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
[2024-05-28 14:14:15] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD1352 is UNSAT
[2024-05-28 14:14:21] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
Problem TDEAD1357 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1397 is UNSAT
[2024-05-28 14:14:22] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/658 variables, 12/61 constraints. Problems are: Problem set: 150 solved, 1290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/2102 variables, and 61 constraints, problems are : Problem set: 150 solved, 1290 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/680 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 23/23 constraints]
After SMT, in 42818ms problems are : Problem set: 150 solved, 1290 unsolved
Search for dead transitions found 150 dead transitions in 42836ms
Found 150 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 150 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 150 transitions.
[2024-05-28 14:14:24] [INFO ] Redundant transitions in 8 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 680/720 places, 1292/1392 transitions.
Graph (complete) has 3476 edges and 680 vertex of which 580 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.4 ms
Discarding 100 places :
Also discarding 0 output transitions
Deduced a syphon composed of 80 places in 1 ms
Applied a total of 1 rules in 32 ms. Remains 580 /680 variables (removed 100) and now considering 1292/1292 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 580/720 places, 1292/1392 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43058 ms. Remains : 580/720 places, 1292/1392 transitions.
Built C files in :
/tmp/ltsmin18260541006597476252
[2024-05-28 14:14:24] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18260541006597476252
Running compilation step : cd /tmp/ltsmin18260541006597476252;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18260541006597476252;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18260541006597476252;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 720 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 1392/1392 transitions.
Applied a total of 0 rules in 17 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 14:14:27] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2024-05-28 14:14:27] [INFO ] Computed 42 invariants in 19 ms
[2024-05-28 14:14:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:14:43] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-05-28 14:14:43] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 1 ms to minimize.
[2024-05-28 14:14:43] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-28 14:14:43] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:14:43] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-28 14:14:43] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:14:43] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:14:45] [INFO ] Deduced a trap composed of 64 places in 368 ms of which 5 ms to minimize.
[2024-05-28 14:14:45] [INFO ] Deduced a trap composed of 217 places in 304 ms of which 4 ms to minimize.
[2024-05-28 14:14:46] [INFO ] Deduced a trap composed of 118 places in 176 ms of which 4 ms to minimize.
[2024-05-28 14:14:50] [INFO ] Deduced a trap composed of 97 places in 203 ms of which 3 ms to minimize.
SMT process timed out in 22710ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 22727ms
[2024-05-28 14:14:50] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:14:50] [INFO ] Invariant cache hit.
[2024-05-28 14:14:51] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-28 14:14:51] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:14:51] [INFO ] Invariant cache hit.
[2024-05-28 14:14:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:14:59] [INFO ] Implicit Places using invariants and state equation in 8506 ms returned []
Implicit Place search using SMT with State Equation took 8958 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-28 14:14:59] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:14:59] [INFO ] Invariant cache hit.
[2024-05-28 14:14:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:15:14] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 1 ms to minimize.
[2024-05-28 14:15:15] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:15:15] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-28 14:15:15] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:15:15] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:15:15] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:15:15] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:15:15] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:15:15] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:15:16] [INFO ] Deduced a trap composed of 403 places in 376 ms of which 5 ms to minimize.
[2024-05-28 14:15:17] [INFO ] Deduced a trap composed of 170 places in 337 ms of which 5 ms to minimize.
[2024-05-28 14:15:17] [INFO ] Deduced a trap composed of 214 places in 328 ms of which 5 ms to minimize.
[2024-05-28 14:15:17] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:15:18] [INFO ] Deduced a trap composed of 439 places in 407 ms of which 6 ms to minimize.
[2024-05-28 14:15:18] [INFO ] Deduced a trap composed of 75 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:15:19] [INFO ] Deduced a trap composed of 380 places in 393 ms of which 5 ms to minimize.
[2024-05-28 14:15:20] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 5 ms to minimize.
[2024-05-28 14:15:20] [INFO ] Deduced a trap composed of 410 places in 375 ms of which 6 ms to minimize.
[2024-05-28 14:15:20] [INFO ] Deduced a trap composed of 393 places in 266 ms of which 3 ms to minimize.
[2024-05-28 14:15:21] [INFO ] Deduced a trap composed of 401 places in 320 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:15:22] [INFO ] Deduced a trap composed of 395 places in 338 ms of which 5 ms to minimize.
[2024-05-28 14:15:24] [INFO ] Deduced a trap composed of 414 places in 336 ms of which 4 ms to minimize.
[2024-05-28 14:15:24] [INFO ] Deduced a trap composed of 379 places in 361 ms of which 5 ms to minimize.
[2024-05-28 14:15:25] [INFO ] Deduced a trap composed of 412 places in 363 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 64 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:15:43] [INFO ] Deduced a trap composed of 490 places in 361 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/718 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 65 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 25/25 constraints]
After SMT, in 62683ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 62706ms
Finished structural reductions in LTL mode , in 1 iterations and 94418 ms. Remains : 720/720 places, 1392/1392 transitions.
Built C files in :
/tmp/ltsmin1594238132025589368
[2024-05-28 14:16:02] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1594238132025589368
Running compilation step : cd /tmp/ltsmin1594238132025589368;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1594238132025589368;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1594238132025589368;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 14:16:05] [INFO ] Flatten gal took : 73 ms
[2024-05-28 14:16:05] [INFO ] Flatten gal took : 61 ms
[2024-05-28 14:16:05] [INFO ] Time to serialize gal into /tmp/LTL13104064000146622972.gal : 9 ms
[2024-05-28 14:16:05] [INFO ] Time to serialize properties into /tmp/LTL8944686023502746209.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13104064000146622972.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5012985852642859058.hoa' '-atoms' '/tmp/LTL8944686023502746209.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/LTL8944686023502746209.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5012985852642859058.hoa
Detected timeout of ITS tools.
[2024-05-28 14:16:20] [INFO ] Flatten gal took : 47 ms
[2024-05-28 14:16:20] [INFO ] Flatten gal took : 41 ms
[2024-05-28 14:16:20] [INFO ] Time to serialize gal into /tmp/LTL9392126199850717673.gal : 6 ms
[2024-05-28 14:16:20] [INFO ] Time to serialize properties into /tmp/LTL1705163401216877856.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9392126199850717673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1705163401216877856.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F("(((((NotifyEventJobCompletedB_5>=1)||(NotifyEventJobCompletedB_4>=1))||((NotifyEventJobCompletedB_7>=1)||(NotifyEventJobCompl...710
Formula 0 simplified : X(G!"(((((NotifyEventJobCompletedB_5>=1)||(NotifyEventJobCompletedB_4>=1))||((NotifyEventJobCompletedB_7>=1)||(NotifyEventJobComplet...700
Detected timeout of ITS tools.
[2024-05-28 14:16:35] [INFO ] Flatten gal took : 80 ms
[2024-05-28 14:16:35] [INFO ] Applying decomposition
[2024-05-28 14:16:35] [INFO ] Flatten gal took : 60 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/graph3160429619028627923.txt' '-o' '/tmp/graph3160429619028627923.bin' '-w' '/tmp/graph3160429619028627923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3160429619028627923.bin' '-l' '-1' '-v' '-w' '/tmp/graph3160429619028627923.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:16:36] [INFO ] Decomposing Gal with order
[2024-05-28 14:16:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:16:36] [INFO ] Removed a total of 936 redundant transitions.
[2024-05-28 14:16:36] [INFO ] Flatten gal took : 142 ms
[2024-05-28 14:16:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 265 labels/synchronizations in 31 ms.
[2024-05-28 14:16:36] [INFO ] Time to serialize gal into /tmp/LTL14802400535101242272.gal : 15 ms
[2024-05-28 14:16:36] [INFO ] Time to serialize properties into /tmp/LTL7773129806650696782.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14802400535101242272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7773129806650696782.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("(((((i9.i0.u81.NotifyEventJobCompletedB_5>=1)||(i15.i1.u80.NotifyEventJobCompletedB_4>=1))||((i1.i2.u83.NotifyEventJobComplet...1010
Formula 0 simplified : X(G!"(((((i9.i0.u81.NotifyEventJobCompletedB_5>=1)||(i15.i1.u80.NotifyEventJobCompletedB_4>=1))||((i1.i2.u83.NotifyEventJobCompleted...1000
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-12 finished in 336386 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)))))'
Support contains 22 out of 740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 740/740 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 740 transition count 1372
Reduce places removed 30 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 50 rules applied. Total rules applied 80 place count 710 transition count 1352
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 100 place count 690 transition count 1352
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 100 place count 690 transition count 1272
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 260 place count 610 transition count 1272
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 380 place count 550 transition count 1212
Applied a total of 380 rules in 85 ms. Remains 550 /740 variables (removed 190) and now considering 1212/1402 (removed 190) transitions.
Running 1210 sub problems to find dead transitions.
[2024-05-28 14:16:51] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
// Phase 1: matrix 1192 rows 550 cols
[2024-05-28 14:16:51] [INFO ] Computed 52 invariants in 26 ms
[2024-05-28 14:16:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-28 14:17:02] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 4 ms to minimize.
[2024-05-28 14:17:02] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:17:03] [INFO ] Deduced a trap composed of 98 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:17:03] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:17:03] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:17:03] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:17:03] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:17:03] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:17:03] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:17:03] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 2 ms to minimize.
[2024-05-28 14:17:03] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:17:04] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:17:07] [INFO ] Deduced a trap composed of 351 places in 279 ms of which 4 ms to minimize.
[2024-05-28 14:17:08] [INFO ] Deduced a trap composed of 330 places in 253 ms of which 4 ms to minimize.
[2024-05-28 14:17:11] [INFO ] Deduced a trap composed of 209 places in 302 ms of which 4 ms to minimize.
[2024-05-28 14:17:12] [INFO ] Deduced a trap composed of 242 places in 285 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1742 variables, and 66 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-28 14:17:17] [INFO ] Deduced a trap composed of 62 places in 286 ms of which 4 ms to minimize.
[2024-05-28 14:17:17] [INFO ] Deduced a trap composed of 100 places in 286 ms of which 4 ms to minimize.
[2024-05-28 14:17:17] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:17:23] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:17:24] [INFO ] Deduced a trap composed of 292 places in 276 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/548 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-28 14:17:33] [INFO ] Deduced a trap composed of 229 places in 352 ms of which 4 ms to minimize.
[2024-05-28 14:17:33] [INFO ] Deduced a trap composed of 220 places in 328 ms of which 4 ms to minimize.
[2024-05-28 14:17:33] [INFO ] Deduced a trap composed of 249 places in 312 ms of which 4 ms to minimize.
SMT process timed out in 42214ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 42230ms
[2024-05-28 14:17:33] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
[2024-05-28 14:17:33] [INFO ] Invariant cache hit.
[2024-05-28 14:17:34] [INFO ] Implicit Places using invariants in 405 ms returned [464, 465, 466, 467, 468, 469, 470, 471, 472, 473]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 407 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 540/740 places, 1212/1402 transitions.
Applied a total of 0 rules in 17 ms. Remains 540 /540 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42743 ms. Remains : 540/740 places, 1212/1402 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-14
Product exploration explored 100000 steps with 41 reset in 690 ms.
Stack based approach found an accepted trace after 846 steps with 2 reset with depth 749 and stack size 749 in 10 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-14 finished in 43611 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U G(!p1))&&X(G(!p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
[2024-05-28 14:17:35] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11833670198715384837
[2024-05-28 14:17:35] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2024-05-28 14:17:35] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:17:35] [INFO ] Applying decomposition
[2024-05-28 14:17:35] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2024-05-28 14:17:35] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:17:35] [INFO ] Flatten gal took : 50 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/graph172914902040884649.txt' '-o' '/tmp/graph172914902040884649.bin' '-w' '/tmp/graph172914902040884649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph172914902040884649.bin' '-l' '-1' '-v' '-w' '/tmp/graph172914902040884649.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:17:35] [INFO ] Decomposing Gal with order
[2024-05-28 14:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:17:35] [INFO ] Removed a total of 947 redundant transitions.
[2024-05-28 14:17:35] [INFO ] Flatten gal took : 95 ms
[2024-05-28 14:17:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 15 ms.
[2024-05-28 14:17:36] [INFO ] Time to serialize gal into /tmp/LTLFireability13783235553843737660.gal : 13 ms
[2024-05-28 14:17:36] [INFO ] Time to serialize properties into /tmp/LTLFireability14424679691751786845.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13783235553843737660.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14424679691751786845.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...278
Read 3 LTL properties
[2024-05-28 14:17:36] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2024-05-28 14:17:36] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:17:36] [INFO ] Built C files in 504ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11833670198715384837
Running compilation step : cd /tmp/ltsmin11833670198715384837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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'
Checking formula 0 : !((F("(((((((((i0.i0.u3.cBlockedTasks>=10)&&(i0.i0.u3.PollingAbort>=1))&&((i0.i0.u3.Abort_Check_Sources_E_7>=1)&&(i0.i0.u3.ORB_Lock>=1...3347
Formula 0 simplified : G!"(((((((((i0.i0.u3.cBlockedTasks>=10)&&(i0.i0.u3.PollingAbort>=1))&&((i0.i0.u3.Abort_Check_Sources_E_7>=1)&&(i0.i0.u3.ORB_Lock>=1)...3343
Compilation finished in 5712 ms.
Running link step : cd /tmp/ltsmin11833670198715384837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 130 ms.
Running LTSmin : cd /tmp/ltsmin11833670198715384837;'/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' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
LTSmin run took 41695 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11833670198715384837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((<>((LTLAPp1==true)) U [](!(LTLAPp2==true)))&&X([](!(LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 4081 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11833670198715384837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp3==true))||X([]((LTLAPp4==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11833670198715384837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp3==true))||X([]((LTLAPp4==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin11833670198715384837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp3==true))||X([]((LTLAPp4==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 14:47:32] [INFO ] Applying decomposition
[2024-05-28 14:47:32] [INFO ] Flatten gal took : 103 ms
[2024-05-28 14:47:32] [INFO ] Decomposing Gal with order
[2024-05-28 14:47:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:47:33] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, P_1617_5, ScheduleTaskE_Idle_5],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, Idle_6, NotifyEventJobCompletedE_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, Idle_7, NotifyEventJobCompletedE_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, P_1617_7, ScheduleTaskE_Idle_7],[AwakeTasks_8, IdleTasks_8, NotifyEventJobQueuedE_8, QueueJobE_8, P_2321_8, TryAllocateOneTaskE_8, TryAllocateOneTaskB_8, P_2318_8, EnablePollingE_8, EnablePollingB_8, FetchJobB_8, ScheduleTaskE_Check_8, ScheduleTaskB_8, Abort_Check_Sources_E_8, Abort_Check_Sources_B_8, NotifyEventSourceAddedB_8, Insert_Source_E_8, NotifyEventSourceAddedE_8, P_1113_8, ProcessingEvt_8, P_1155_8, nyo_8, P_1158_8, P_1159_8, P_1160_8, NotifyEventEndOfCheckSourcesB_8, NotifyEventEndOfCheckSourcesE_8, Check_Sources_B_8, Check_Sources_E_8, Idle_8, NotifyEventJobCompletedE_8, NotifyEventJobCompletedB_8, RunE_8, RunB_8, Perform_Work_E_8, Try_Check_Sources_B_8, P_1617_8, ScheduleTaskE_Idle_8],[AwakeTasks_9, IdleTasks_9, NotifyEventJobQueuedE_9, QueueJobE_9, P_2321_9, TryAllocateOneTaskE_9, TryAllocateOneTaskB_9, P_2318_9, EnablePollingE_9, EnablePollingB_9, FetchJobB_9, ScheduleTaskE_Check_9, ScheduleTaskB_9, Abort_Check_Sources_E_9, Abort_Check_Sources_B_9, NotifyEventSourceAddedB_9, Insert_Source_E_9, NotifyEventSourceAddedE_9, P_1113_9, ProcessingEvt_9, P_1155_9, nyo_9, P_1158_9, P_1159_9, P_1160_9, NotifyEventEndOfCheckSourcesB_9, NotifyEventEndOfCheckSourcesE_9, Check_Sources_B_9, Check_Sources_E_9, Idle_9, NotifyEventJobCompletedE_9, NotifyEventJobCompletedB_9, RunE_9, RunB_9, Perform_Work_E_9, Try_Check_Sources_B_9, P_1617_9, ScheduleTaskE_Idle_9],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42, ScheduleTaskE_Work_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43, ScheduleTaskE_Work_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44, ScheduleTaskE_Work_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45, ScheduleTaskE_Work_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46, ScheduleTaskE_Work_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47, ScheduleTaskE_Work_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48, ScheduleTaskE_Work_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49, ScheduleTaskE_Work_49],[PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],[DisablePollingE_16, DisablePollingB_16, Insert_Source_B_16, P_1119_16, P_2579_16],[DisablePollingE_17, DisablePollingB_17, Insert_Source_B_17, P_1119_17, P_2579_17],[DisablePollingE_18, DisablePollingB_18, Insert_Source_B_18, P_1119_18, P_2579_18],[DisablePollingE_19, DisablePollingB_19, Insert_Source_B_19, P_1119_19, P_2579_19],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 14:47:33] [INFO ] Flatten gal took : 146 ms
[2024-05-28 14:47:33] [INFO ] Time to serialize gal into /tmp/LTLFireability13914733170806007564.gal : 22 ms
[2024-05-28 14:47:33] [INFO ] Time to serialize properties into /tmp/LTLFireability3916204672601038804.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13914733170806007564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3916204672601038804.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...298
Read 1 LTL properties
Checking formula 0 : !((X((F("(((((NotifyEventJobCompletedB_5>=1)||(NotifyEventJobCompletedB_4>=1))||((NotifyEventJobCompletedB_7>=1)||(NotifyEventJobCompl...710
Formula 0 simplified : X(G!"(((((NotifyEventJobCompletedB_5>=1)||(NotifyEventJobCompletedB_4>=1))||((NotifyEventJobCompletedB_7>=1)||(NotifyEventJobComplet...700

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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="PolyORBLF-COL-S02J04T10"
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 PolyORBLF-COL-S02J04T10, 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 r290-tajo-171654446300092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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