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-171654446500147.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-S04J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446500147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:06 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.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-S04J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J06T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716909445515

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 15:17:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:17:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:17:26] [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 15:17:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:17:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 561 ms
[2024-05-28 15:17:27] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 618 PT places and 3232.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 15:17:27] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 15:17:27] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-15 TRUE 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 (9 resets) in 1683 ms. (23 steps per ms) remains 7/23 properties
BEST_FIRST walk for 40001 steps (10 resets) in 190 ms. (209 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (10 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (10 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (10 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
[2024-05-28 15:17:28] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:17:28] [INFO ] Computed 26 invariants in 7 ms
[2024-05-28 15:17:28] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/50 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 3/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 5 (OVERLAPS) 19/73 variables, 12/21 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/78 variables, 3/24 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 6 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/47 variables, 5/8 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/51 variables, 1/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 73/145 variables, and 21 constraints, problems are : Problem set: 7 solved, 0 unsolved in 78 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: 0/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:17:29] [INFO ] Flatten gal took : 34 ms
[2024-05-28 15:17:29] [INFO ] Flatten gal took : 10 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 15:17:29] [INFO ] Unfolded HLPN to a Petri net with 618 places and 3190 transitions 21570 arcs in 94 ms.
[2024-05-28 15:17:29] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 182 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 1558
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 606 transition count 1552
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 606 transition count 1552
Applied a total of 24 rules in 100 ms. Remains 606 /618 variables (removed 12) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:17:29] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 606 cols
[2024-05-28 15:17:29] [INFO ] Computed 54 invariants in 110 ms
[2024-05-28 15:17:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:17:48] [INFO ] Deduced a trap composed of 81 places in 188 ms of which 19 ms to minimize.
[2024-05-28 15:17:48] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 3 ms to minimize.
[2024-05-28 15:17:48] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 2 ms to minimize.
[2024-05-28 15:17:48] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:17:48] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 1 ms to minimize.
[2024-05-28 15:17:49] [INFO ] Deduced a trap composed of 349 places in 618 ms of which 4 ms to minimize.
[2024-05-28 15:17:50] [INFO ] Deduced a trap composed of 332 places in 283 ms of which 3 ms to minimize.
[2024-05-28 15:17:50] [INFO ] Deduced a trap composed of 139 places in 318 ms of which 4 ms to minimize.
[2024-05-28 15:17:50] [INFO ] Deduced a trap composed of 159 places in 343 ms of which 5 ms to minimize.
[2024-05-28 15:17:52] [INFO ] Deduced a trap composed of 311 places in 376 ms of which 4 ms to minimize.
[2024-05-28 15:17:52] [INFO ] Deduced a trap composed of 327 places in 338 ms of which 4 ms to minimize.
[2024-05-28 15:17:53] [INFO ] Deduced a trap composed of 337 places in 362 ms of which 4 ms to minimize.
[2024-05-28 15:17:53] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 2 ms to minimize.
[2024-05-28 15:17:53] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:17:54] [INFO ] Deduced a trap composed of 370 places in 383 ms of which 5 ms to minimize.
SMT process timed out in 25208ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 25270ms
[2024-05-28 15:17:54] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:17:54] [INFO ] Invariant cache hit.
[2024-05-28 15:17:55] [INFO ] Implicit Places using invariants in 437 ms returned [484, 485, 486, 487, 488, 489]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 456 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 600/618 places, 1552/1564 transitions.
Applied a total of 0 rules in 18 ms. Remains 600 /600 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25870 ms. Remains : 600/618 places, 1552/1564 transitions.
Support contains 182 out of 600 places after structural reductions.
[2024-05-28 15:17:55] [INFO ] Flatten gal took : 250 ms
[2024-05-28 15:17:55] [INFO ] Flatten gal took : 208 ms
[2024-05-28 15:17:56] [INFO ] Input system was already deterministic with 1552 transitions.
Support contains 175 out of 600 places (down from 182) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 682 ms. (58 steps per ms) remains 4/19 properties
BEST_FIRST walk for 40002 steps (8 resets) in 446 ms. (89 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 274 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
[2024-05-28 15:17:56] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 600 cols
[2024-05-28 15:17:56] [INFO ] Computed 48 invariants in 65 ms
[2024-05-28 15:17:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 3 (OVERLAPS) 427/458 variables, 13/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 5 (OVERLAPS) 58/516 variables, 15/29 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 597/2128 variables, and 46 constraints, problems are : Problem set: 4 solved, 0 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/600 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 398ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 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' '!(X((G((p0 U p1))&&F(G(p2)))))'
Support contains 60 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 15 ms. Remains 596 /600 variables (removed 4) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:17:57] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 15:17:57] [INFO ] Computed 44 invariants in 56 ms
[2024-05-28 15:17:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:18:16] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:18:16] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 0 ms to minimize.
[2024-05-28 15:18:17] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:18:17] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 1 ms to minimize.
[2024-05-28 15:18:17] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:18:18] [INFO ] Deduced a trap composed of 398 places in 364 ms of which 5 ms to minimize.
[2024-05-28 15:18:18] [INFO ] Deduced a trap composed of 359 places in 357 ms of which 5 ms to minimize.
[2024-05-28 15:18:19] [INFO ] Deduced a trap composed of 348 places in 348 ms of which 4 ms to minimize.
[2024-05-28 15:18:19] [INFO ] Deduced a trap composed of 139 places in 330 ms of which 3 ms to minimize.
[2024-05-28 15:18:20] [INFO ] Deduced a trap composed of 82 places in 330 ms of which 3 ms to minimize.
[2024-05-28 15:18:20] [INFO ] Deduced a trap composed of 160 places in 284 ms of which 3 ms to minimize.
[2024-05-28 15:18:21] [INFO ] Deduced a trap composed of 304 places in 287 ms of which 4 ms to minimize.
[2024-05-28 15:18:21] [INFO ] Deduced a trap composed of 328 places in 282 ms of which 3 ms to minimize.
[2024-05-28 15:18:22] [INFO ] Deduced a trap composed of 429 places in 403 ms of which 5 ms to minimize.
[2024-05-28 15:18:23] [INFO ] Deduced a trap composed of 366 places in 306 ms of which 4 ms to minimize.
[2024-05-28 15:18:23] [INFO ] Deduced a trap composed of 375 places in 365 ms of which 4 ms to minimize.
[2024-05-28 15:18:23] [INFO ] Deduced a trap composed of 355 places in 365 ms of which 5 ms to minimize.
[2024-05-28 15:18:24] [INFO ] Deduced a trap composed of 371 places in 391 ms of which 4 ms to minimize.
SMT process timed out in 26583ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 26612ms
[2024-05-28 15:18:24] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:18:24] [INFO ] Invariant cache hit.
[2024-05-28 15:18:24] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-05-28 15:18:24] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:18:24] [INFO ] Invariant cache hit.
[2024-05-28 15:18:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:18:32] [INFO ] Implicit Places using invariants and state equation in 7556 ms returned []
Implicit Place search using SMT with State Equation took 8150 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:18:32] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:18:32] [INFO ] Invariant cache hit.
[2024-05-28 15:18:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:18:48] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 2 ms to minimize.
[2024-05-28 15:18:48] [INFO ] Deduced a trap composed of 82 places in 44 ms of which 2 ms to minimize.
[2024-05-28 15:18:48] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:18:48] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:18:48] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:18:49] [INFO ] Deduced a trap composed of 360 places in 299 ms of which 3 ms to minimize.
[2024-05-28 15:18:49] [INFO ] Deduced a trap composed of 359 places in 257 ms of which 4 ms to minimize.
[2024-05-28 15:18:49] [INFO ] Deduced a trap composed of 263 places in 262 ms of which 3 ms to minimize.
[2024-05-28 15:18:49] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:18:50] [INFO ] Deduced a trap composed of 288 places in 292 ms of which 3 ms to minimize.
[2024-05-28 15:18:51] [INFO ] Deduced a trap composed of 362 places in 295 ms of which 3 ms to minimize.
[2024-05-28 15:18:51] [INFO ] Deduced a trap composed of 362 places in 289 ms of which 3 ms to minimize.
[2024-05-28 15:18:52] [INFO ] Deduced a trap composed of 355 places in 278 ms of which 3 ms to minimize.
[2024-05-28 15:18:52] [INFO ] Deduced a trap composed of 350 places in 250 ms of which 3 ms to minimize.
[2024-05-28 15:18:52] [INFO ] Deduced a trap composed of 342 places in 268 ms of which 3 ms to minimize.
[2024-05-28 15:18:53] [INFO ] Deduced a trap composed of 330 places in 304 ms of which 3 ms to minimize.
[2024-05-28 15:18:53] [INFO ] Deduced a trap composed of 339 places in 276 ms of which 3 ms to minimize.
[2024-05-28 15:18:53] [INFO ] Deduced a trap composed of 305 places in 256 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 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:19:09] [INFO ] Deduced a trap composed of 334 places in 328 ms of which 3 ms to minimize.
[2024-05-28 15:19:10] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 2 ms to minimize.
[2024-05-28 15:19:16] [INFO ] Deduced a trap composed of 366 places in 259 ms of which 3 ms to minimize.
[2024-05-28 15:19:16] [INFO ] Deduced a trap composed of 366 places in 244 ms of which 3 ms to minimize.
[2024-05-28 15:19:18] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:19:27] [INFO ] Deduced a trap composed of 414 places in 328 ms of which 18 ms to minimize.
[2024-05-28 15:19:28] [INFO ] Deduced a trap composed of 65 places in 315 ms of which 4 ms to minimize.
[2024-05-28 15:19:28] [INFO ] Deduced a trap composed of 42 places in 308 ms of which 3 ms to minimize.
[2024-05-28 15:19:32] [INFO ] Deduced a trap composed of 358 places in 303 ms of which 3 ms to minimize.
[2024-05-28 15:19:32] [INFO ] Deduced a trap composed of 313 places in 274 ms of which 3 ms to minimize.
[2024-05-28 15:19:32] [INFO ] Deduced a trap composed of 291 places in 213 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 69 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 29/29 constraints]
After SMT, in 65022ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 65057ms
Starting structural reductions in LTL mode, iteration 1 : 596/600 places, 1552/1552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99860 ms. Remains : 596/600 places, 1552/1552 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-02
Stuttering criterion allowed to conclude after 8897 steps with 0 reset in 108 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-02 finished in 100391 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)||G(p1))))'
Support contains 31 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 10 ms. Remains 596 /600 variables (removed 4) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:19:37] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:19:38] [INFO ] Invariant cache hit.
[2024-05-28 15:19:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:19:53] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 0 ms to minimize.
[2024-05-28 15:19:53] [INFO ] Deduced a trap composed of 82 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:19:53] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:19:53] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:19:53] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:19:54] [INFO ] Deduced a trap composed of 360 places in 263 ms of which 3 ms to minimize.
[2024-05-28 15:19:54] [INFO ] Deduced a trap composed of 359 places in 240 ms of which 3 ms to minimize.
[2024-05-28 15:19:54] [INFO ] Deduced a trap composed of 263 places in 239 ms of which 3 ms to minimize.
[2024-05-28 15:19:55] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:19:55] [INFO ] Deduced a trap composed of 288 places in 255 ms of which 3 ms to minimize.
[2024-05-28 15:19:56] [INFO ] Deduced a trap composed of 362 places in 274 ms of which 3 ms to minimize.
[2024-05-28 15:19:57] [INFO ] Deduced a trap composed of 362 places in 302 ms of which 3 ms to minimize.
[2024-05-28 15:19:57] [INFO ] Deduced a trap composed of 355 places in 269 ms of which 3 ms to minimize.
[2024-05-28 15:19:57] [INFO ] Deduced a trap composed of 350 places in 271 ms of which 3 ms to minimize.
[2024-05-28 15:19:57] [INFO ] Deduced a trap composed of 342 places in 273 ms of which 3 ms to minimize.
[2024-05-28 15:19:58] [INFO ] Deduced a trap composed of 330 places in 271 ms of which 3 ms to minimize.
[2024-05-28 15:19:58] [INFO ] Deduced a trap composed of 339 places in 256 ms of which 3 ms to minimize.
[2024-05-28 15:19:58] [INFO ] Deduced a trap composed of 305 places in 313 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:20:05] [INFO ] Deduced a trap composed of 334 places in 368 ms of which 3 ms to minimize.
[2024-05-28 15:20:06] [INFO ] Deduced a trap composed of 169 places in 147 ms of which 1 ms to minimize.
[2024-05-28 15:20:11] [INFO ] Deduced a trap composed of 366 places in 267 ms of which 3 ms to minimize.
[2024-05-28 15:20:12] [INFO ] Deduced a trap composed of 366 places in 253 ms of which 3 ms to minimize.
[2024-05-28 15:20:13] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2024-05-28 15:20:22] [INFO ] Deduced a trap composed of 414 places in 309 ms of which 3 ms to minimize.
[2024-05-28 15:20:22] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 3 ms to minimize.
[2024-05-28 15:20:23] [INFO ] Deduced a trap composed of 42 places in 279 ms of which 3 ms to minimize.
SMT process timed out in 45291ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45324ms
[2024-05-28 15:20:23] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:20:23] [INFO ] Invariant cache hit.
[2024-05-28 15:20:23] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-28 15:20:23] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:20:23] [INFO ] Invariant cache hit.
[2024-05-28 15:20:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:20:31] [INFO ] Implicit Places using invariants and state equation in 7427 ms returned []
Implicit Place search using SMT with State Equation took 7788 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:20:31] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:20:31] [INFO ] Invariant cache hit.
[2024-05-28 15:20:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:20:46] [INFO ] Deduced a trap composed of 82 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:20:46] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:20:46] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2024-05-28 15:20:46] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:20:47] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:20:47] [INFO ] Deduced a trap composed of 360 places in 264 ms of which 3 ms to minimize.
[2024-05-28 15:20:47] [INFO ] Deduced a trap composed of 359 places in 249 ms of which 3 ms to minimize.
[2024-05-28 15:20:48] [INFO ] Deduced a trap composed of 263 places in 221 ms of which 3 ms to minimize.
[2024-05-28 15:20:48] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:20:48] [INFO ] Deduced a trap composed of 288 places in 239 ms of which 3 ms to minimize.
[2024-05-28 15:20:49] [INFO ] Deduced a trap composed of 362 places in 297 ms of which 3 ms to minimize.
[2024-05-28 15:20:50] [INFO ] Deduced a trap composed of 362 places in 298 ms of which 3 ms to minimize.
[2024-05-28 15:20:50] [INFO ] Deduced a trap composed of 355 places in 268 ms of which 3 ms to minimize.
[2024-05-28 15:20:50] [INFO ] Deduced a trap composed of 350 places in 263 ms of which 3 ms to minimize.
[2024-05-28 15:20:50] [INFO ] Deduced a trap composed of 342 places in 288 ms of which 2 ms to minimize.
[2024-05-28 15:20:51] [INFO ] Deduced a trap composed of 330 places in 265 ms of which 3 ms to minimize.
[2024-05-28 15:20:51] [INFO ] Deduced a trap composed of 339 places in 285 ms of which 3 ms to minimize.
[2024-05-28 15:20:51] [INFO ] Deduced a trap composed of 305 places in 291 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:21:08] [INFO ] Deduced a trap composed of 334 places in 264 ms of which 3 ms to minimize.
[2024-05-28 15:21:09] [INFO ] Deduced a trap composed of 169 places in 153 ms of which 2 ms to minimize.
[2024-05-28 15:21:14] [INFO ] Deduced a trap composed of 366 places in 238 ms of which 3 ms to minimize.
[2024-05-28 15:21:14] [INFO ] Deduced a trap composed of 366 places in 251 ms of which 3 ms to minimize.
[2024-05-28 15:21:16] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-28 15:21:24] [INFO ] Deduced a trap composed of 414 places in 280 ms of which 3 ms to minimize.
[2024-05-28 15:21:25] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-28 15:21:25] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 3 ms to minimize.
[2024-05-28 15:21:29] [INFO ] Deduced a trap composed of 358 places in 237 ms of which 3 ms to minimize.
[2024-05-28 15:21:29] [INFO ] Deduced a trap composed of 313 places in 280 ms of which 3 ms to minimize.
[2024-05-28 15:21:29] [INFO ] Deduced a trap composed of 291 places in 236 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 69 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 29/29 constraints]
After SMT, in 65238ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 65259ms
Starting structural reductions in LTL mode, iteration 1 : 596/600 places, 1552/1552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118393 ms. Remains : 596/600 places, 1552/1552 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-03
Product exploration explored 100000 steps with 738 reset in 362 ms.
Product exploration explored 100000 steps with 726 reset in 405 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 (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 486 steps (0 resets) in 10 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 15:21:37] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:21:37] [INFO ] Invariant cache hit.
[2024-05-28 15:21:38] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-28 15:21:38] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 101 ms returned sat
[2024-05-28 15:21:39] [INFO ] [Real]Absence check using state equation in 999 ms returned sat
[2024-05-28 15:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:21:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-28 15:21:40] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 65 ms returned sat
[2024-05-28 15:21:42] [INFO ] [Nat]Absence check using state equation in 1856 ms returned sat
[2024-05-28 15:21:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:21:42] [INFO ] [Nat]Added 120 Read/Feed constraints in 556 ms returned sat
[2024-05-28 15:21:43] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 1 ms to minimize.
[2024-05-28 15:21:43] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 1 ms to minimize.
[2024-05-28 15:21:43] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 1 ms to minimize.
[2024-05-28 15:21:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 915 ms
[2024-05-28 15:21:43] [INFO ] Computed and/alt/rep : 1098/4213/1080 causal constraints (skipped 444 transitions) in 162 ms.
[2024-05-28 15:21:54] [INFO ] Added : 393 causal constraints over 79 iterations in 10812 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 596 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:21:54] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:21:54] [INFO ] Invariant cache hit.
[2024-05-28 15:21:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:22:09] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:22:09] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:22:09] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:22:09] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 0 ms to minimize.
[2024-05-28 15:22:09] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 0 ms to minimize.
[2024-05-28 15:22:10] [INFO ] Deduced a trap composed of 360 places in 221 ms of which 2 ms to minimize.
[2024-05-28 15:22:10] [INFO ] Deduced a trap composed of 359 places in 238 ms of which 3 ms to minimize.
[2024-05-28 15:22:10] [INFO ] Deduced a trap composed of 263 places in 266 ms of which 3 ms to minimize.
[2024-05-28 15:22:10] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:22:11] [INFO ] Deduced a trap composed of 288 places in 233 ms of which 4 ms to minimize.
[2024-05-28 15:22:13] [INFO ] Deduced a trap composed of 362 places in 300 ms of which 3 ms to minimize.
[2024-05-28 15:22:14] [INFO ] Deduced a trap composed of 362 places in 303 ms of which 3 ms to minimize.
[2024-05-28 15:22:14] [INFO ] Deduced a trap composed of 355 places in 277 ms of which 3 ms to minimize.
[2024-05-28 15:22:14] [INFO ] Deduced a trap composed of 350 places in 289 ms of which 2 ms to minimize.
[2024-05-28 15:22:15] [INFO ] Deduced a trap composed of 342 places in 273 ms of which 3 ms to minimize.
[2024-05-28 15:22:15] [INFO ] Deduced a trap composed of 330 places in 264 ms of which 3 ms to minimize.
[2024-05-28 15:22:15] [INFO ] Deduced a trap composed of 339 places in 250 ms of which 3 ms to minimize.
[2024-05-28 15:22:15] [INFO ] Deduced a trap composed of 305 places in 280 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:22:20] [INFO ] Deduced a trap composed of 334 places in 264 ms of which 3 ms to minimize.
[2024-05-28 15:22:21] [INFO ] Deduced a trap composed of 169 places in 190 ms of which 1 ms to minimize.
[2024-05-28 15:22:27] [INFO ] Deduced a trap composed of 366 places in 280 ms of which 3 ms to minimize.
[2024-05-28 15:22:27] [INFO ] Deduced a trap composed of 366 places in 262 ms of which 3 ms to minimize.
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:22:38] [INFO ] Deduced a trap composed of 414 places in 252 ms of which 3 ms to minimize.
[2024-05-28 15:22:38] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 3 ms to minimize.
SMT process timed out in 44301ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 44315ms
[2024-05-28 15:22:38] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:22:38] [INFO ] Invariant cache hit.
[2024-05-28 15:22:39] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-28 15:22:39] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:22:39] [INFO ] Invariant cache hit.
[2024-05-28 15:22:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:22:46] [INFO ] Implicit Places using invariants and state equation in 7371 ms returned []
Implicit Place search using SMT with State Equation took 7723 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:22:46] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:22:46] [INFO ] Invariant cache hit.
[2024-05-28 15:22:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:23:02] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:23:02] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:23:02] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2024-05-28 15:23:02] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:23:02] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:23:03] [INFO ] Deduced a trap composed of 360 places in 225 ms of which 3 ms to minimize.
[2024-05-28 15:23:03] [INFO ] Deduced a trap composed of 359 places in 258 ms of which 3 ms to minimize.
[2024-05-28 15:23:03] [INFO ] Deduced a trap composed of 263 places in 236 ms of which 2 ms to minimize.
[2024-05-28 15:23:03] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:23:04] [INFO ] Deduced a trap composed of 288 places in 241 ms of which 3 ms to minimize.
[2024-05-28 15:23:05] [INFO ] Deduced a trap composed of 362 places in 282 ms of which 3 ms to minimize.
[2024-05-28 15:23:05] [INFO ] Deduced a trap composed of 362 places in 272 ms of which 3 ms to minimize.
[2024-05-28 15:23:05] [INFO ] Deduced a trap composed of 355 places in 266 ms of which 3 ms to minimize.
[2024-05-28 15:23:06] [INFO ] Deduced a trap composed of 350 places in 272 ms of which 3 ms to minimize.
[2024-05-28 15:23:06] [INFO ] Deduced a trap composed of 342 places in 269 ms of which 3 ms to minimize.
[2024-05-28 15:23:06] [INFO ] Deduced a trap composed of 330 places in 280 ms of which 3 ms to minimize.
[2024-05-28 15:23:07] [INFO ] Deduced a trap composed of 339 places in 271 ms of which 3 ms to minimize.
[2024-05-28 15:23:07] [INFO ] Deduced a trap composed of 305 places in 270 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:23:23] [INFO ] Deduced a trap composed of 334 places in 289 ms of which 4 ms to minimize.
[2024-05-28 15:23:24] [INFO ] Deduced a trap composed of 169 places in 148 ms of which 2 ms to minimize.
[2024-05-28 15:23:30] [INFO ] Deduced a trap composed of 366 places in 253 ms of which 3 ms to minimize.
[2024-05-28 15:23:30] [INFO ] Deduced a trap composed of 366 places in 248 ms of which 3 ms to minimize.
[2024-05-28 15:23:33] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:23:41] [INFO ] Deduced a trap composed of 414 places in 272 ms of which 3 ms to minimize.
[2024-05-28 15:23:42] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 3 ms to minimize.
[2024-05-28 15:23:42] [INFO ] Deduced a trap composed of 42 places in 309 ms of which 3 ms to minimize.
[2024-05-28 15:23:45] [INFO ] Deduced a trap composed of 358 places in 276 ms of which 2 ms to minimize.
[2024-05-28 15:23:46] [INFO ] Deduced a trap composed of 313 places in 256 ms of which 3 ms to minimize.
[2024-05-28 15:23:46] [INFO ] Deduced a trap composed of 291 places in 232 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 69 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 29/29 constraints]
After SMT, in 65104ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 65118ms
Finished structural reductions in LTL mode , in 1 iterations and 117173 ms. Remains : 596/596 places, 1552/1552 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 518 steps (0 resets) in 7 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 15:23:52] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:23:52] [INFO ] Invariant cache hit.
[2024-05-28 15:23:52] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-28 15:23:52] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 81 ms returned sat
[2024-05-28 15:23:53] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2024-05-28 15:23:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:23:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-28 15:23:54] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 56 ms returned sat
[2024-05-28 15:23:56] [INFO ] [Nat]Absence check using state equation in 1714 ms returned sat
[2024-05-28 15:23:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:23:57] [INFO ] [Nat]Added 120 Read/Feed constraints in 637 ms returned sat
[2024-05-28 15:23:57] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2024-05-28 15:23:58] [INFO ] Deduced a trap composed of 82 places in 714 ms of which 1 ms to minimize.
[2024-05-28 15:23:58] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:23:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1610 ms
[2024-05-28 15:23:58] [INFO ] Computed and/alt/rep : 1098/4213/1080 causal constraints (skipped 444 transitions) in 198 ms.
[2024-05-28 15:24:09] [INFO ] Deduced a trap composed of 2 places in 758 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
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 15:24:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 726 reset in 287 ms.
Product exploration explored 100000 steps with 724 reset in 304 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1552
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 30 place count 596 transition count 1600
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 66 place count 596 transition count 1600
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 584 transition count 1588
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 584 transition count 1588
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 186 place count 584 transition count 1588
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 210 place count 560 transition count 1564
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 234 place count 560 transition count 1564
Deduced a syphon composed of 132 places in 2 ms
Applied a total of 234 rules in 292 ms. Remains 560 /596 variables (removed 36) and now considering 1564/1552 (removed -12) transitions.
Running 1560 sub problems to find dead transitions.
[2024-05-28 15:24:11] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 560 cols
[2024-05-28 15:24:11] [INFO ] Computed 44 invariants in 28 ms
[2024-05-28 15:24:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-28 15:24:26] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 2 ms to minimize.
[2024-05-28 15:24:27] [INFO ] Deduced a trap composed of 54 places in 1521 ms of which 3 ms to minimize.
[2024-05-28 15:24:28] [INFO ] Deduced a trap composed of 54 places in 224 ms of which 2 ms to minimize.
[2024-05-28 15:24:28] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 3 ms to minimize.
[2024-05-28 15:24:28] [INFO ] Deduced a trap composed of 218 places in 238 ms of which 2 ms to minimize.
[2024-05-28 15:24:28] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:24:29] [INFO ] Deduced a trap composed of 232 places in 407 ms of which 6 ms to minimize.
[2024-05-28 15:24:30] [INFO ] Deduced a trap composed of 173 places in 544 ms of which 6 ms to minimize.
[2024-05-28 15:24:31] [INFO ] Deduced a trap composed of 158 places in 1200 ms of which 3 ms to minimize.
[2024-05-28 15:24:33] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/2100 variables, and 50 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/560 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 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 TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1557 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 10/50 constraints. Problems are: Problem set: 168 solved, 1392 unsolved
[2024-05-28 15:24:36] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 4 ms to minimize.
[2024-05-28 15:24:37] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:24:49] [INFO ] Deduced a trap composed of 186 places in 261 ms of which 2 ms to minimize.
[2024-05-28 15:24:51] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 2 ms to minimize.
[2024-05-28 15:24:51] [INFO ] Deduced a trap composed of 181 places in 319 ms of which 4 ms to minimize.
[2024-05-28 15:24:52] [INFO ] Deduced a trap composed of 144 places in 321 ms of which 4 ms to minimize.
[2024-05-28 15:24:53] [INFO ] Deduced a trap composed of 149 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/2100 variables, and 57 constraints, problems are : Problem set: 168 solved, 1392 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/560 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 17/17 constraints]
After SMT, in 43979ms problems are : Problem set: 168 solved, 1392 unsolved
Search for dead transitions found 168 dead transitions in 44013ms
Found 168 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 168 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 168 transitions.
[2024-05-28 15:24:55] [INFO ] Redundant transitions in 65 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 560/596 places, 1396/1552 transitions.
Graph (complete) has 3004 edges and 560 vertex of which 440 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.3 ms
Discarding 120 places :
Also discarding 0 output transitions
Deduced a syphon composed of 12 places in 2 ms
Applied a total of 1 rules in 31 ms. Remains 440 /560 variables (removed 120) and now considering 1396/1396 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 440/596 places, 1396/1552 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44424 ms. Remains : 440/596 places, 1396/1552 transitions.
Built C files in :
/tmp/ltsmin934444165689610543
[2024-05-28 15:24:55] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin934444165689610543
Running compilation step : cd /tmp/ltsmin934444165689610543;'/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/ltsmin934444165689610543;'/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/ltsmin934444165689610543;'/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 12 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:24:58] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 15:24:58] [INFO ] Computed 44 invariants in 60 ms
[2024-05-28 15:24:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:25:13] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:25:13] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2024-05-28 15:25:13] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 1 ms to minimize.
[2024-05-28 15:25:13] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:25:14] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 0 ms to minimize.
[2024-05-28 15:25:14] [INFO ] Deduced a trap composed of 398 places in 272 ms of which 3 ms to minimize.
[2024-05-28 15:25:14] [INFO ] Deduced a trap composed of 359 places in 289 ms of which 3 ms to minimize.
[2024-05-28 15:25:15] [INFO ] Deduced a trap composed of 348 places in 258 ms of which 3 ms to minimize.
[2024-05-28 15:25:15] [INFO ] Deduced a trap composed of 139 places in 229 ms of which 3 ms to minimize.
[2024-05-28 15:25:15] [INFO ] Deduced a trap composed of 82 places in 232 ms of which 2 ms to minimize.
[2024-05-28 15:25:16] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 3 ms to minimize.
[2024-05-28 15:25:16] [INFO ] Deduced a trap composed of 304 places in 249 ms of which 3 ms to minimize.
[2024-05-28 15:25:16] [INFO ] Deduced a trap composed of 328 places in 256 ms of which 3 ms to minimize.
[2024-05-28 15:25:18] [INFO ] Deduced a trap composed of 429 places in 299 ms of which 3 ms to minimize.
[2024-05-28 15:25:18] [INFO ] Deduced a trap composed of 366 places in 276 ms of which 3 ms to minimize.
[2024-05-28 15:25:18] [INFO ] Deduced a trap composed of 375 places in 281 ms of which 3 ms to minimize.
[2024-05-28 15:25:18] [INFO ] Deduced a trap composed of 355 places in 284 ms of which 3 ms to minimize.
[2024-05-28 15:25:19] [INFO ] Deduced a trap composed of 371 places in 280 ms of which 3 ms to minimize.
[2024-05-28 15:25:19] [INFO ] Deduced a trap composed of 340 places in 284 ms of which 3 ms to minimize.
[2024-05-28 15:25:19] [INFO ] Deduced a trap composed of 358 places in 267 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:25:22] [INFO ] Deduced a trap composed of 341 places in 299 ms of which 3 ms to minimize.
[2024-05-28 15:25:22] [INFO ] Deduced a trap composed of 329 places in 281 ms of which 3 ms to minimize.
[2024-05-28 15:25:22] [INFO ] Deduced a trap composed of 324 places in 272 ms of which 3 ms to minimize.
[2024-05-28 15:25:22] [INFO ] Deduced a trap composed of 315 places in 267 ms of which 3 ms to minimize.
SMT process timed out in 24536ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 24562ms
[2024-05-28 15:25:22] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:25:22] [INFO ] Invariant cache hit.
[2024-05-28 15:25:23] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-28 15:25:23] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:25:23] [INFO ] Invariant cache hit.
[2024-05-28 15:25:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:25:30] [INFO ] Implicit Places using invariants and state equation in 7522 ms returned []
Implicit Place search using SMT with State Equation took 7988 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:25:30] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:25:30] [INFO ] Invariant cache hit.
[2024-05-28 15:25:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:25:46] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:25:46] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:25:46] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:25:47] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2024-05-28 15:25:47] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 2 ms to minimize.
[2024-05-28 15:25:47] [INFO ] Deduced a trap composed of 360 places in 236 ms of which 3 ms to minimize.
[2024-05-28 15:25:47] [INFO ] Deduced a trap composed of 359 places in 250 ms of which 3 ms to minimize.
[2024-05-28 15:25:48] [INFO ] Deduced a trap composed of 263 places in 248 ms of which 3 ms to minimize.
[2024-05-28 15:25:48] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:25:48] [INFO ] Deduced a trap composed of 288 places in 243 ms of which 3 ms to minimize.
[2024-05-28 15:25:49] [INFO ] Deduced a trap composed of 362 places in 264 ms of which 2 ms to minimize.
[2024-05-28 15:25:50] [INFO ] Deduced a trap composed of 362 places in 270 ms of which 3 ms to minimize.
[2024-05-28 15:25:50] [INFO ] Deduced a trap composed of 355 places in 269 ms of which 17 ms to minimize.
[2024-05-28 15:25:50] [INFO ] Deduced a trap composed of 350 places in 295 ms of which 3 ms to minimize.
[2024-05-28 15:25:51] [INFO ] Deduced a trap composed of 342 places in 272 ms of which 3 ms to minimize.
[2024-05-28 15:25:51] [INFO ] Deduced a trap composed of 330 places in 265 ms of which 2 ms to minimize.
[2024-05-28 15:25:51] [INFO ] Deduced a trap composed of 339 places in 258 ms of which 3 ms to minimize.
[2024-05-28 15:25:51] [INFO ] Deduced a trap composed of 305 places in 270 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:26:08] [INFO ] Deduced a trap composed of 334 places in 248 ms of which 3 ms to minimize.
[2024-05-28 15:26:08] [INFO ] Deduced a trap composed of 169 places in 162 ms of which 2 ms to minimize.
[2024-05-28 15:26:14] [INFO ] Deduced a trap composed of 366 places in 274 ms of which 3 ms to minimize.
[2024-05-28 15:26:15] [INFO ] Deduced a trap composed of 366 places in 253 ms of which 3 ms to minimize.
[2024-05-28 15:26:17] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:26:24] [INFO ] Deduced a trap composed of 414 places in 280 ms of which 3 ms to minimize.
[2024-05-28 15:26:25] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 3 ms to minimize.
[2024-05-28 15:26:26] [INFO ] Deduced a trap composed of 42 places in 284 ms of which 3 ms to minimize.
[2024-05-28 15:26:29] [INFO ] Deduced a trap composed of 358 places in 249 ms of which 3 ms to minimize.
[2024-05-28 15:26:29] [INFO ] Deduced a trap composed of 313 places in 248 ms of which 3 ms to minimize.
[2024-05-28 15:26:29] [INFO ] Deduced a trap composed of 291 places in 197 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 69 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 29/29 constraints]
After SMT, in 65340ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 65353ms
Finished structural reductions in LTL mode , in 1 iterations and 97918 ms. Remains : 596/596 places, 1552/1552 transitions.
Built C files in :
/tmp/ltsmin2317334230816530057
[2024-05-28 15:26:36] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2317334230816530057
Running compilation step : cd /tmp/ltsmin2317334230816530057;'/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/ltsmin2317334230816530057;'/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/ltsmin2317334230816530057;'/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 15:26:39] [INFO ] Flatten gal took : 63 ms
[2024-05-28 15:26:39] [INFO ] Flatten gal took : 61 ms
[2024-05-28 15:26:39] [INFO ] Time to serialize gal into /tmp/LTL17165736845572686846.gal : 18 ms
[2024-05-28 15:26:39] [INFO ] Time to serialize properties into /tmp/LTL16198252449331202966.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17165736845572686846.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17212223177327235365.hoa' '-atoms' '/tmp/LTL16198252449331202966.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...320
Loading property file /tmp/LTL16198252449331202966.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17212223177327235365.hoa
Detected timeout of ITS tools.
[2024-05-28 15:26:54] [INFO ] Flatten gal took : 57 ms
[2024-05-28 15:26:54] [INFO ] Flatten gal took : 72 ms
[2024-05-28 15:26:54] [INFO ] Time to serialize gal into /tmp/LTL6913024015361120611.gal : 24 ms
[2024-05-28 15:26:54] [INFO ] Time to serialize properties into /tmp/LTL1980091515824841124.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6913024015361120611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1980091515824841124.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("((((ScheduleTaskE_Idle_0+ScheduleTaskE_Idle_1)+(ScheduleTaskE_Idle_2+ScheduleTaskE_Idle_3))+(ScheduleTaskE_Idle_4+ScheduleTas...699
Formula 0 simplified : X(G!"((((ScheduleTaskE_Idle_0+ScheduleTaskE_Idle_1)+(ScheduleTaskE_Idle_2+ScheduleTaskE_Idle_3))+(ScheduleTaskE_Idle_4+ScheduleTaskE...691
Detected timeout of ITS tools.
[2024-05-28 15:27:10] [INFO ] Flatten gal took : 101 ms
[2024-05-28 15:27:10] [INFO ] Applying decomposition
[2024-05-28 15:27:10] [INFO ] Flatten gal took : 77 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/graph5575817531983869976.txt' '-o' '/tmp/graph5575817531983869976.bin' '-w' '/tmp/graph5575817531983869976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5575817531983869976.bin' '-l' '-1' '-v' '-w' '/tmp/graph5575817531983869976.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:27:10] [INFO ] Decomposing Gal with order
[2024-05-28 15:27:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:27:11] [INFO ] Removed a total of 1361 redundant transitions.
[2024-05-28 15:27:11] [INFO ] Flatten gal took : 539 ms
[2024-05-28 15:27:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 323 labels/synchronizations in 94 ms.
[2024-05-28 15:27:11] [INFO ] Time to serialize gal into /tmp/LTL1206466151064867147.gal : 27 ms
[2024-05-28 15:27:11] [INFO ] Time to serialize properties into /tmp/LTL7351330932217083720.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/LTL1206466151064867147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7351330932217083720.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("((((gu75.ScheduleTaskE_Idle_0+gu75.ScheduleTaskE_Idle_1)+(gu75.ScheduleTaskE_Idle_2+gu75.ScheduleTaskE_Idle_3))+(gu75.Schedul...984
Formula 0 simplified : X(G!"((((gu75.ScheduleTaskE_Idle_0+gu75.ScheduleTaskE_Idle_1)+(gu75.ScheduleTaskE_Idle_2+gu75.ScheduleTaskE_Idle_3))+(gu75.ScheduleT...976
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-03 finished in 469102 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)||G(F(p1))))'
Support contains 48 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 336 place count 428 transition count 1384
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 342 place count 422 transition count 1378
Iterating global reduction 2 with 6 rules applied. Total rules applied 348 place count 422 transition count 1378
Applied a total of 348 rules in 100 ms. Remains 422 /600 variables (removed 178) and now considering 1378/1552 (removed 174) transitions.
Running 1374 sub problems to find dead transitions.
[2024-05-28 15:27:27] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
// Phase 1: matrix 1354 rows 422 cols
[2024-05-28 15:27:27] [INFO ] Computed 44 invariants in 24 ms
[2024-05-28 15:27:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 15:27:41] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:27:41] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 5 ms to minimize.
[2024-05-28 15:27:41] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:27:41] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 201 places in 306 ms of which 2 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 171 places in 243 ms of which 5 ms to minimize.
[2024-05-28 15:27:42] [INFO ] Deduced a trap composed of 186 places in 227 ms of which 4 ms to minimize.
[2024-05-28 15:27:43] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 49 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 15:27:55] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 2 ms to minimize.
[2024-05-28 15:27:57] [INFO ] Deduced a trap composed of 222 places in 275 ms of which 3 ms to minimize.
[2024-05-28 15:27:58] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-05-28 15:28:07] [INFO ] Deduced a trap composed of 132 places in 287 ms of which 3 ms to minimize.
[2024-05-28 15:28:08] [INFO ] Deduced a trap composed of 142 places in 328 ms of which 4 ms to minimize.
[2024-05-28 15:28:09] [INFO ] Deduced a trap composed of 173 places in 278 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1776 variables, and 55 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 15/15 constraints]
After SMT, in 44835ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 44847ms
[2024-05-28 15:28:12] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-05-28 15:28:12] [INFO ] Invariant cache hit.
[2024-05-28 15:28:12] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-28 15:28:12] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-05-28 15:28:12] [INFO ] Invariant cache hit.
[2024-05-28 15:28:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:28:18] [INFO ] Implicit Places using invariants and state equation in 6557 ms returned []
Implicit Place search using SMT with State Equation took 6930 ms to find 0 implicit places.
[2024-05-28 15:28:19] [INFO ] Redundant transitions in 102 ms returned []
Running 1374 sub problems to find dead transitions.
[2024-05-28 15:28:19] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-05-28 15:28:19] [INFO ] Invariant cache hit.
[2024-05-28 15:28:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 15:28:33] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:28:33] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:28:33] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:28:33] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:28:33] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:28:34] [INFO ] Deduced a trap composed of 184 places in 308 ms of which 3 ms to minimize.
[2024-05-28 15:28:34] [INFO ] Deduced a trap composed of 171 places in 294 ms of which 3 ms to minimize.
[2024-05-28 15:28:34] [INFO ] Deduced a trap composed of 173 places in 313 ms of which 3 ms to minimize.
[2024-05-28 15:28:35] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 15:28:48] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 50 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 15:28:59] [INFO ] Deduced a trap composed of 222 places in 219 ms of which 3 ms to minimize.
[2024-05-28 15:29:00] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:29:08] [INFO ] Deduced a trap composed of 132 places in 290 ms of which 3 ms to minimize.
[2024-05-28 15:29:09] [INFO ] Deduced a trap composed of 149 places in 288 ms of which 3 ms to minimize.
[2024-05-28 15:29:10] [INFO ] Deduced a trap composed of 133 places in 307 ms of which 4 ms to minimize.
[2024-05-28 15:29:10] [INFO ] Deduced a trap composed of 126 places in 290 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1776 variables, and 56 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 16/16 constraints]
After SMT, in 66029ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 66049ms
Starting structural reductions in SI_LTL mode, iteration 1 : 422/600 places, 1378/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118043 ms. Remains : 422/600 places, 1378/1552 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-04
Stuttering criterion allowed to conclude after 17527 steps with 6 reset in 57 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-04 finished in 118236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 12 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
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 596 transition count 1522
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 566 transition count 1522
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 60 place count 566 transition count 1444
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 216 place count 488 transition count 1444
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 324 place count 434 transition count 1390
Applied a total of 324 rules in 49 ms. Remains 434 /600 variables (removed 166) and now considering 1390/1552 (removed 162) transitions.
Running 1386 sub problems to find dead transitions.
[2024-05-28 15:29:25] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
// Phase 1: matrix 1366 rows 434 cols
[2024-05-28 15:29:25] [INFO ] Computed 44 invariants in 34 ms
[2024-05-28 15:29:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 15:29:38] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:29:38] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:29:38] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:29:38] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 0 ms to minimize.
[2024-05-28 15:29:38] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:29:38] [INFO ] Deduced a trap composed of 201 places in 277 ms of which 3 ms to minimize.
[2024-05-28 15:29:38] [INFO ] Deduced a trap composed of 187 places in 255 ms of which 3 ms to minimize.
[2024-05-28 15:29:39] [INFO ] Deduced a trap composed of 201 places in 231 ms of which 2 ms to minimize.
[2024-05-28 15:29:39] [INFO ] Deduced a trap composed of 194 places in 231 ms of which 3 ms to minimize.
[2024-05-28 15:29:39] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 2 ms to minimize.
[2024-05-28 15:29:39] [INFO ] Deduced a trap composed of 221 places in 223 ms of which 3 ms to minimize.
[2024-05-28 15:29:40] [INFO ] Deduced a trap composed of 218 places in 226 ms of which 2 ms to minimize.
[2024-05-28 15:29:40] [INFO ] Deduced a trap composed of 229 places in 228 ms of which 2 ms to minimize.
[2024-05-28 15:29:40] [INFO ] Deduced a trap composed of 240 places in 249 ms of which 3 ms to minimize.
[2024-05-28 15:29:40] [INFO ] Deduced a trap composed of 207 places in 234 ms of which 2 ms to minimize.
[2024-05-28 15:29:41] [INFO ] Deduced a trap composed of 209 places in 233 ms of which 3 ms to minimize.
[2024-05-28 15:29:41] [INFO ] Deduced a trap composed of 190 places in 222 ms of which 2 ms to minimize.
[2024-05-28 15:29:42] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1800 variables, and 58 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 15:29:54] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 3 ms to minimize.
[2024-05-28 15:30:07] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 2 ms to minimize.
[2024-05-28 15:30:07] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1800 variables, and 61 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 21/21 constraints]
After SMT, in 43744ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 43756ms
[2024-05-28 15:30:09] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 15:30:09] [INFO ] Invariant cache hit.
[2024-05-28 15:30:09] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-28 15:30:09] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 15:30:09] [INFO ] Invariant cache hit.
[2024-05-28 15:30:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:30:16] [INFO ] Implicit Places using invariants and state equation in 6530 ms returned []
Implicit Place search using SMT with State Equation took 6987 ms to find 0 implicit places.
[2024-05-28 15:30:16] [INFO ] Redundant transitions in 15 ms returned []
Running 1386 sub problems to find dead transitions.
[2024-05-28 15:30:16] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 15:30:16] [INFO ] Invariant cache hit.
[2024-05-28 15:30:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 15:30:28] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:30:28] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:30:28] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 0 ms to minimize.
[2024-05-28 15:30:28] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 0 ms to minimize.
[2024-05-28 15:30:28] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 0 ms to minimize.
[2024-05-28 15:30:29] [INFO ] Deduced a trap composed of 229 places in 206 ms of which 2 ms to minimize.
[2024-05-28 15:30:29] [INFO ] Deduced a trap composed of 199 places in 216 ms of which 2 ms to minimize.
[2024-05-28 15:30:29] [INFO ] Deduced a trap composed of 218 places in 226 ms of which 2 ms to minimize.
[2024-05-28 15:30:29] [INFO ] Deduced a trap composed of 207 places in 226 ms of which 2 ms to minimize.
[2024-05-28 15:30:30] [INFO ] Deduced a trap composed of 206 places in 228 ms of which 2 ms to minimize.
[2024-05-28 15:30:30] [INFO ] Deduced a trap composed of 194 places in 229 ms of which 3 ms to minimize.
[2024-05-28 15:30:30] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 2 ms to minimize.
[2024-05-28 15:30:30] [INFO ] Deduced a trap composed of 202 places in 244 ms of which 2 ms to minimize.
[2024-05-28 15:30:31] [INFO ] Deduced a trap composed of 184 places in 232 ms of which 2 ms to minimize.
[2024-05-28 15:30:31] [INFO ] Deduced a trap composed of 192 places in 228 ms of which 2 ms to minimize.
[2024-05-28 15:30:31] [INFO ] Deduced a trap composed of 192 places in 227 ms of which 2 ms to minimize.
[2024-05-28 15:30:32] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:30:33] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 2 ms to minimize.
[2024-05-28 15:30:42] [INFO ] Deduced a trap composed of 174 places in 228 ms of which 2 ms to minimize.
[2024-05-28 15:30:43] [INFO ] Deduced a trap composed of 163 places in 210 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1800 variables, and 60 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 15:30:53] [INFO ] Deduced a trap composed of 176 places in 283 ms of which 3 ms to minimize.
[2024-05-28 15:31:06] [INFO ] Deduced a trap composed of 238 places in 245 ms of which 2 ms to minimize.
[2024-05-28 15:31:07] [INFO ] Deduced a trap composed of 138 places in 204 ms of which 2 ms to minimize.
[2024-05-28 15:31:07] [INFO ] Deduced a trap composed of 144 places in 207 ms of which 2 ms to minimize.
[2024-05-28 15:31:07] [INFO ] Deduced a trap composed of 212 places in 189 ms of which 2 ms to minimize.
[2024-05-28 15:31:08] [INFO ] Deduced a trap composed of 188 places in 209 ms of which 3 ms to minimize.
[2024-05-28 15:31:08] [INFO ] Deduced a trap composed of 232 places in 202 ms of which 2 ms to minimize.
[2024-05-28 15:31:09] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 3 ms to minimize.
[2024-05-28 15:31:09] [INFO ] Deduced a trap composed of 60 places in 246 ms of which 2 ms to minimize.
[2024-05-28 15:31:09] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1800 variables, and 70 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 30/30 constraints]
After SMT, in 65095ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 65107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 434/600 places, 1390/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115927 ms. Remains : 434/600 places, 1390/1552 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-07
Product exploration explored 100000 steps with 7 reset in 518 ms.
Product exploration explored 100000 steps with 12 reset in 608 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9 resets) in 317 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 323388 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 323388 steps, saw 215397 distinct states, run finished after 3005 ms. (steps per millisecond=107 ) properties seen :0
[2024-05-28 15:31:25] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 15:31:25] [INFO ] Invariant cache hit.
[2024-05-28 15:31:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 306/318 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/351 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 431/1800 variables, and 42 constraints, problems are : Problem set: 1 solved, 0 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 265ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-07 finished in 120818 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 2 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 348 place count 422 transition count 1378
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 354 place count 416 transition count 1372
Iterating global reduction 2 with 6 rules applied. Total rules applied 360 place count 416 transition count 1372
Applied a total of 360 rules in 135 ms. Remains 416 /600 variables (removed 184) and now considering 1372/1552 (removed 180) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-28 15:31:26] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 416 cols
[2024-05-28 15:31:26] [INFO ] Computed 44 invariants in 36 ms
[2024-05-28 15:31:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:31:39] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 1 ms to minimize.
[2024-05-28 15:31:39] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 1 ms to minimize.
[2024-05-28 15:31:39] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2024-05-28 15:31:39] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:31:40] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:31:40] [INFO ] Deduced a trap composed of 193 places in 245 ms of which 2 ms to minimize.
[2024-05-28 15:31:40] [INFO ] Deduced a trap composed of 173 places in 229 ms of which 2 ms to minimize.
[2024-05-28 15:31:41] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:31:42] [INFO ] Deduced a trap composed of 216 places in 233 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1764 variables, and 49 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:31:53] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-28 15:31:53] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-28 15:31:55] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 1 ms to minimize.
[2024-05-28 15:32:05] [INFO ] Deduced a trap composed of 132 places in 204 ms of which 3 ms to minimize.
[2024-05-28 15:32:06] [INFO ] Deduced a trap composed of 132 places in 200 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1764 variables, and 54 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 14/14 constraints]
After SMT, in 45398ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 45411ms
[2024-05-28 15:32:11] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 15:32:11] [INFO ] Invariant cache hit.
[2024-05-28 15:32:12] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-28 15:32:12] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 15:32:12] [INFO ] Invariant cache hit.
[2024-05-28 15:32:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:32:18] [INFO ] Implicit Places using invariants and state equation in 6287 ms returned []
Implicit Place search using SMT with State Equation took 6670 ms to find 0 implicit places.
[2024-05-28 15:32:18] [INFO ] Redundant transitions in 23 ms returned []
Running 1368 sub problems to find dead transitions.
[2024-05-28 15:32:18] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 15:32:18] [INFO ] Invariant cache hit.
[2024-05-28 15:32:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:32:31] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 1 ms to minimize.
[2024-05-28 15:32:31] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:32:31] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:32:31] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
[2024-05-28 15:32:31] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:32:31] [INFO ] Deduced a trap composed of 205 places in 198 ms of which 2 ms to minimize.
[2024-05-28 15:32:31] [INFO ] Deduced a trap composed of 188 places in 219 ms of which 2 ms to minimize.
[2024-05-28 15:32:32] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 0 ms to minimize.
[2024-05-28 15:32:41] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 15 ms to minimize.
[2024-05-28 15:32:41] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 2 ms to minimize.
[2024-05-28 15:32:41] [INFO ] Deduced a trap composed of 141 places in 221 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:32:45] [INFO ] Deduced a trap composed of 216 places in 218 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1764 variables, and 52 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:32:55] [INFO ] Deduced a trap composed of 182 places in 206 ms of which 2 ms to minimize.
[2024-05-28 15:33:06] [INFO ] Deduced a trap composed of 127 places in 210 ms of which 2 ms to minimize.
[2024-05-28 15:33:06] [INFO ] Deduced a trap composed of 132 places in 197 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:33:16] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 6 ms to minimize.
[2024-05-28 15:33:21] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 2 ms to minimize.
[2024-05-28 15:33:21] [INFO ] Deduced a trap composed of 57 places in 229 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1764 variables, and 58 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 18/18 constraints]
After SMT, in 64897ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 64916ms
Starting structural reductions in SI_LTL mode, iteration 1 : 416/600 places, 1372/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117194 ms. Remains : 416/600 places, 1372/1552 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-08
Stuttering criterion allowed to conclude after 26377 steps with 0 reset in 89 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-08 finished in 117352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 596 transition count 1516
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 560 transition count 1516
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 72 place count 560 transition count 1444
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 216 place count 488 transition count 1444
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 336 place count 428 transition count 1384
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 342 place count 422 transition count 1378
Iterating global reduction 2 with 6 rules applied. Total rules applied 348 place count 422 transition count 1378
Applied a total of 348 rules in 127 ms. Remains 422 /600 variables (removed 178) and now considering 1378/1552 (removed 174) transitions.
Running 1374 sub problems to find dead transitions.
[2024-05-28 15:33:23] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
// Phase 1: matrix 1354 rows 422 cols
[2024-05-28 15:33:23] [INFO ] Computed 44 invariants in 27 ms
[2024-05-28 15:33:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 15:33:35] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 0 ms to minimize.
[2024-05-28 15:33:35] [INFO ] Deduced a trap composed of 53 places in 585 ms of which 0 ms to minimize.
[2024-05-28 15:33:36] [INFO ] Deduced a trap composed of 53 places in 521 ms of which 0 ms to minimize.
[2024-05-28 15:33:36] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2024-05-28 15:33:36] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 0 ms to minimize.
[2024-05-28 15:33:36] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 2 ms to minimize.
[2024-05-28 15:33:36] [INFO ] Deduced a trap composed of 173 places in 221 ms of which 2 ms to minimize.
[2024-05-28 15:33:37] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:33:37] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 2 ms to minimize.
[2024-05-28 15:33:38] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 50 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 15:33:50] [INFO ] Deduced a trap composed of 222 places in 191 ms of which 2 ms to minimize.
[2024-05-28 15:33:51] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-28 15:34:00] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 2 ms to minimize.
[2024-05-28 15:34:00] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1776 variables, and 54 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 14/14 constraints]
After SMT, in 43873ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 43898ms
[2024-05-28 15:34:07] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-05-28 15:34:07] [INFO ] Invariant cache hit.
[2024-05-28 15:34:07] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-28 15:34:07] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-05-28 15:34:07] [INFO ] Invariant cache hit.
[2024-05-28 15:34:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:34:13] [INFO ] Implicit Places using invariants and state equation in 5422 ms returned []
Implicit Place search using SMT with State Equation took 5770 ms to find 0 implicit places.
[2024-05-28 15:34:13] [INFO ] Redundant transitions in 24 ms returned []
Running 1374 sub problems to find dead transitions.
[2024-05-28 15:34:13] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
[2024-05-28 15:34:13] [INFO ] Invariant cache hit.
[2024-05-28 15:34:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 15:34:26] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:34:26] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:34:26] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:34:26] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2024-05-28 15:34:26] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:34:27] [INFO ] Deduced a trap composed of 195 places in 289 ms of which 3 ms to minimize.
[2024-05-28 15:34:28] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:34:30] [INFO ] Deduced a trap composed of 222 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 15:34:42] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 49 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 15:34:59] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-05-28 15:35:01] [INFO ] Deduced a trap composed of 138 places in 219 ms of which 2 ms to minimize.
[2024-05-28 15:35:01] [INFO ] Deduced a trap composed of 146 places in 219 ms of which 3 ms to minimize.
[2024-05-28 15:35:01] [INFO ] Deduced a trap composed of 120 places in 233 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
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 TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 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
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 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
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 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
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 TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 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 TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/420 variables, 2/55 constraints. Problems are: Problem set: 174 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1776 variables, and 55 constraints, problems are : Problem set: 174 solved, 1200 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 13/13 constraints]
After SMT, in 64009ms problems are : Problem set: 174 solved, 1200 unsolved
Search for dead transitions found 174 dead transitions in 64028ms
Found 174 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 174 transitions
Dead transitions reduction (with SMT) removed 174 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 422/600 places, 1204/1552 transitions.
Applied a total of 0 rules in 16 ms. Remains 422 /422 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
[2024-05-28 15:35:17] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 113918 ms. Remains : 422/600 places, 1204/1552 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-09
Product exploration explored 100000 steps with 4418 reset in 488 ms.
Product exploration explored 100000 steps with 4436 reset in 445 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 1204/1204 transitions.
Applied a total of 0 rules in 18 ms. Remains 422 /422 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-28 15:35:18] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
// Phase 1: matrix 1180 rows 422 cols
[2024-05-28 15:35:18] [INFO ] Computed 44 invariants in 11 ms
[2024-05-28 15:35:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:35:29] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 0 ms to minimize.
[2024-05-28 15:35:29] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:35:29] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 0 ms to minimize.
[2024-05-28 15:35:29] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:35:29] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:35:29] [INFO ] Deduced a trap composed of 174 places in 212 ms of which 3 ms to minimize.
[2024-05-28 15:35:29] [INFO ] Deduced a trap composed of 179 places in 213 ms of which 2 ms to minimize.
[2024-05-28 15:35:30] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:35:31] [INFO ] Deduced a trap composed of 222 places in 198 ms of which 2 ms to minimize.
[2024-05-28 15:35:32] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 2 ms to minimize.
[2024-05-28 15:35:39] [INFO ] Deduced a trap composed of 174 places in 209 ms of which 3 ms to minimize.
[2024-05-28 15:35:40] [INFO ] Deduced a trap composed of 159 places in 960 ms of which 2 ms to minimize.
[2024-05-28 15:35:41] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 2 ms to minimize.
[2024-05-28 15:35:41] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1602 variables, and 54 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:35:46] [INFO ] Deduced a trap composed of 147 places in 232 ms of which 2 ms to minimize.
[2024-05-28 15:35:52] [INFO ] Deduced a trap composed of 237 places in 230 ms of which 2 ms to minimize.
[2024-05-28 15:35:53] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 2 ms to minimize.
[2024-05-28 15:35:54] [INFO ] Deduced a trap composed of 134 places in 190 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:35:55] [INFO ] Deduced a trap composed of 184 places in 199 ms of which 2 ms to minimize.
[2024-05-28 15:35:56] [INFO ] Deduced a trap composed of 201 places in 199 ms of which 2 ms to minimize.
[2024-05-28 15:35:56] [INFO ] Deduced a trap composed of 179 places in 232 ms of which 3 ms to minimize.
[2024-05-28 15:35:56] [INFO ] Deduced a trap composed of 180 places in 221 ms of which 3 ms to minimize.
[2024-05-28 15:35:56] [INFO ] Deduced a trap composed of 190 places in 222 ms of which 2 ms to minimize.
[2024-05-28 15:35:57] [INFO ] Deduced a trap composed of 185 places in 250 ms of which 3 ms to minimize.
[2024-05-28 15:35:57] [INFO ] Deduced a trap composed of 182 places in 219 ms of which 3 ms to minimize.
[2024-05-28 15:35:57] [INFO ] Deduced a trap composed of 181 places in 243 ms of which 3 ms to minimize.
[2024-05-28 15:35:57] [INFO ] Deduced a trap composed of 189 places in 258 ms of which 2 ms to minimize.
[2024-05-28 15:35:58] [INFO ] Deduced a trap composed of 179 places in 226 ms of which 3 ms to minimize.
[2024-05-28 15:35:58] [INFO ] Deduced a trap composed of 174 places in 206 ms of which 2 ms to minimize.
[2024-05-28 15:35:58] [INFO ] Deduced a trap composed of 170 places in 229 ms of which 2 ms to minimize.
[2024-05-28 15:35:58] [INFO ] Deduced a trap composed of 206 places in 194 ms of which 2 ms to minimize.
[2024-05-28 15:35:58] [INFO ] Deduced a trap composed of 182 places in 208 ms of which 3 ms to minimize.
[2024-05-28 15:35:59] [INFO ] Deduced a trap composed of 200 places in 200 ms of which 3 ms to minimize.
[2024-05-28 15:35:59] [INFO ] Deduced a trap composed of 174 places in 192 ms of which 2 ms to minimize.
[2024-05-28 15:35:59] [INFO ] Deduced a trap composed of 179 places in 201 ms of which 2 ms to minimize.
[2024-05-28 15:35:59] [INFO ] Deduced a trap composed of 167 places in 182 ms of which 2 ms to minimize.
[2024-05-28 15:36:00] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1602 variables, and 77 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 37/37 constraints]
After SMT, in 42635ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 42649ms
[2024-05-28 15:36:01] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-28 15:36:01] [INFO ] Invariant cache hit.
[2024-05-28 15:36:01] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-28 15:36:01] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-28 15:36:01] [INFO ] Invariant cache hit.
[2024-05-28 15:36:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:36:06] [INFO ] Implicit Places using invariants and state equation in 5188 ms returned []
Implicit Place search using SMT with State Equation took 5498 ms to find 0 implicit places.
[2024-05-28 15:36:06] [INFO ] Redundant transitions in 9 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-28 15:36:06] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-28 15:36:06] [INFO ] Invariant cache hit.
[2024-05-28 15:36:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:36:16] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:36:16] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:36:16] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:36:16] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 177 places in 206 ms of which 2 ms to minimize.
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 175 places in 180 ms of which 2 ms to minimize.
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 176 places in 212 ms of which 2 ms to minimize.
[2024-05-28 15:36:17] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 2 ms to minimize.
[2024-05-28 15:36:18] [INFO ] Deduced a trap composed of 197 places in 353 ms of which 2 ms to minimize.
[2024-05-28 15:36:18] [INFO ] Deduced a trap composed of 181 places in 369 ms of which 3 ms to minimize.
[2024-05-28 15:36:19] [INFO ] Deduced a trap composed of 187 places in 214 ms of which 2 ms to minimize.
[2024-05-28 15:36:19] [INFO ] Deduced a trap composed of 183 places in 221 ms of which 2 ms to minimize.
[2024-05-28 15:36:19] [INFO ] Deduced a trap composed of 167 places in 205 ms of which 2 ms to minimize.
[2024-05-28 15:36:19] [INFO ] Deduced a trap composed of 192 places in 230 ms of which 3 ms to minimize.
[2024-05-28 15:36:20] [INFO ] Deduced a trap composed of 172 places in 222 ms of which 2 ms to minimize.
[2024-05-28 15:36:20] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:36:20] [INFO ] Deduced a trap composed of 184 places in 223 ms of which 3 ms to minimize.
[2024-05-28 15:36:20] [INFO ] Deduced a trap composed of 190 places in 216 ms of which 2 ms to minimize.
[2024-05-28 15:36:21] [INFO ] Deduced a trap composed of 190 places in 202 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:36:21] [INFO ] Deduced a trap composed of 209 places in 217 ms of which 2 ms to minimize.
[2024-05-28 15:36:22] [INFO ] Deduced a trap composed of 182 places in 199 ms of which 2 ms to minimize.
[2024-05-28 15:36:22] [INFO ] Deduced a trap composed of 181 places in 229 ms of which 2 ms to minimize.
[2024-05-28 15:36:22] [INFO ] Deduced a trap composed of 182 places in 220 ms of which 3 ms to minimize.
[2024-05-28 15:36:22] [INFO ] Deduced a trap composed of 215 places in 220 ms of which 2 ms to minimize.
[2024-05-28 15:36:23] [INFO ] Deduced a trap composed of 179 places in 215 ms of which 2 ms to minimize.
[2024-05-28 15:36:23] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 2 ms to minimize.
[2024-05-28 15:36:23] [INFO ] Deduced a trap composed of 162 places in 257 ms of which 2 ms to minimize.
[2024-05-28 15:36:25] [INFO ] Deduced a trap composed of 237 places in 190 ms of which 3 ms to minimize.
[2024-05-28 15:36:34] [INFO ] Deduced a trap composed of 197 places in 196 ms of which 3 ms to minimize.
[2024-05-28 15:36:34] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 2 ms to minimize.
[2024-05-28 15:36:35] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 2 ms to minimize.
[2024-05-28 15:36:35] [INFO ] Deduced a trap composed of 169 places in 195 ms of which 2 ms to minimize.
[2024-05-28 15:36:35] [INFO ] Deduced a trap composed of 191 places in 175 ms of which 2 ms to minimize.
[2024-05-28 15:36:36] [INFO ] Deduced a trap composed of 167 places in 201 ms of which 2 ms to minimize.
[2024-05-28 15:36:36] [INFO ] Deduced a trap composed of 189 places in 191 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1602 variables, and 76 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 36/76 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:36:42] [INFO ] Deduced a trap composed of 158 places in 121 ms of which 1 ms to minimize.
[2024-05-28 15:36:42] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 1 ms to minimize.
[2024-05-28 15:36:45] [INFO ] Deduced a trap composed of 200 places in 208 ms of which 3 ms to minimize.
[2024-05-28 15:36:45] [INFO ] Deduced a trap composed of 210 places in 204 ms of which 2 ms to minimize.
[2024-05-28 15:36:45] [INFO ] Deduced a trap composed of 196 places in 199 ms of which 2 ms to minimize.
[2024-05-28 15:36:45] [INFO ] Deduced a trap composed of 196 places in 196 ms of which 2 ms to minimize.
[2024-05-28 15:36:45] [INFO ] Deduced a trap composed of 196 places in 202 ms of which 3 ms to minimize.
[2024-05-28 15:36:46] [INFO ] Deduced a trap composed of 206 places in 204 ms of which 2 ms to minimize.
[2024-05-28 15:36:46] [INFO ] Deduced a trap composed of 216 places in 210 ms of which 3 ms to minimize.
[2024-05-28 15:36:46] [INFO ] Deduced a trap composed of 220 places in 271 ms of which 2 ms to minimize.
[2024-05-28 15:36:46] [INFO ] Deduced a trap composed of 220 places in 252 ms of which 3 ms to minimize.
[2024-05-28 15:36:47] [INFO ] Deduced a trap composed of 230 places in 296 ms of which 3 ms to minimize.
[2024-05-28 15:36:47] [INFO ] Deduced a trap composed of 213 places in 250 ms of which 3 ms to minimize.
[2024-05-28 15:36:47] [INFO ] Deduced a trap composed of 223 places in 251 ms of which 2 ms to minimize.
[2024-05-28 15:36:48] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 2 ms to minimize.
[2024-05-28 15:36:48] [INFO ] Deduced a trap composed of 215 places in 222 ms of which 2 ms to minimize.
[2024-05-28 15:36:48] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 2 ms to minimize.
[2024-05-28 15:36:48] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 2 ms to minimize.
[2024-05-28 15:36:48] [INFO ] Deduced a trap composed of 206 places in 183 ms of which 3 ms to minimize.
[2024-05-28 15:36:49] [INFO ] Deduced a trap composed of 140 places in 252 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:36:52] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 2 ms to minimize.
[2024-05-28 15:36:52] [INFO ] Deduced a trap composed of 169 places in 179 ms of which 2 ms to minimize.
[2024-05-28 15:36:57] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2024-05-28 15:37:00] [INFO ] Deduced a trap composed of 246 places in 196 ms of which 2 ms to minimize.
[2024-05-28 15:37:01] [INFO ] Deduced a trap composed of 134 places in 197 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:37:03] [INFO ] Deduced a trap composed of 186 places in 167 ms of which 2 ms to minimize.
[2024-05-28 15:37:03] [INFO ] Deduced a trap composed of 169 places in 178 ms of which 2 ms to minimize.
[2024-05-28 15:37:03] [INFO ] Deduced a trap composed of 173 places in 186 ms of which 2 ms to minimize.
[2024-05-28 15:37:03] [INFO ] Deduced a trap composed of 163 places in 170 ms of which 2 ms to minimize.
[2024-05-28 15:37:03] [INFO ] Deduced a trap composed of 159 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1602 variables, and 106 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 66/66 constraints]
After SMT, in 62782ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 62799ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111001 ms. Remains : 422/422 places, 1204/1204 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 26 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4370 reset in 288 ms.
Product exploration explored 100000 steps with 4418 reset in 322 ms.
Built C files in :
/tmp/ltsmin2277396652373448191
[2024-05-28 15:37:10] [INFO ] Computing symmetric may disable matrix : 1204 transitions.
[2024-05-28 15:37:10] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:37:10] [INFO ] Computing symmetric may enable matrix : 1204 transitions.
[2024-05-28 15:37:10] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:37:11] [INFO ] Computing Do-Not-Accords matrix : 1204 transitions.
[2024-05-28 15:37:11] [INFO ] Computation of Completed DNA matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:37:11] [INFO ] Built C files in 436ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2277396652373448191
Running compilation step : cd /tmp/ltsmin2277396652373448191;'/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/ltsmin2277396652373448191;'/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/ltsmin2277396652373448191;'/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 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 1204/1204 transitions.
Applied a total of 0 rules in 31 ms. Remains 422 /422 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-28 15:37:14] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-28 15:37:14] [INFO ] Invariant cache hit.
[2024-05-28 15:37:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:37:23] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:37:23] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:37:23] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:37:23] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:37:23] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:37:24] [INFO ] Deduced a trap composed of 177 places in 224 ms of which 2 ms to minimize.
[2024-05-28 15:37:24] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 2 ms to minimize.
[2024-05-28 15:37:24] [INFO ] Deduced a trap composed of 176 places in 279 ms of which 2 ms to minimize.
[2024-05-28 15:37:24] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 2 ms to minimize.
[2024-05-28 15:37:25] [INFO ] Deduced a trap composed of 197 places in 202 ms of which 2 ms to minimize.
[2024-05-28 15:37:25] [INFO ] Deduced a trap composed of 181 places in 198 ms of which 2 ms to minimize.
[2024-05-28 15:37:25] [INFO ] Deduced a trap composed of 187 places in 190 ms of which 3 ms to minimize.
[2024-05-28 15:37:25] [INFO ] Deduced a trap composed of 183 places in 200 ms of which 2 ms to minimize.
[2024-05-28 15:37:25] [INFO ] Deduced a trap composed of 167 places in 224 ms of which 2 ms to minimize.
[2024-05-28 15:37:26] [INFO ] Deduced a trap composed of 192 places in 214 ms of which 2 ms to minimize.
[2024-05-28 15:37:26] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 2 ms to minimize.
[2024-05-28 15:37:26] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 0 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 184 places in 196 ms of which 2 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 190 places in 206 ms of which 2 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 190 places in 210 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:37:28] [INFO ] Deduced a trap composed of 209 places in 214 ms of which 2 ms to minimize.
[2024-05-28 15:37:28] [INFO ] Deduced a trap composed of 182 places in 189 ms of which 2 ms to minimize.
[2024-05-28 15:37:28] [INFO ] Deduced a trap composed of 181 places in 199 ms of which 2 ms to minimize.
[2024-05-28 15:37:28] [INFO ] Deduced a trap composed of 182 places in 190 ms of which 2 ms to minimize.
[2024-05-28 15:37:29] [INFO ] Deduced a trap composed of 215 places in 200 ms of which 2 ms to minimize.
[2024-05-28 15:37:29] [INFO ] Deduced a trap composed of 179 places in 192 ms of which 2 ms to minimize.
[2024-05-28 15:37:29] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 2 ms to minimize.
[2024-05-28 15:37:29] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
[2024-05-28 15:37:32] [INFO ] Deduced a trap composed of 237 places in 322 ms of which 2 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 418/1602 variables, and 69 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:37:39] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 2 ms to minimize.
[2024-05-28 15:37:39] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 3 ms to minimize.
[2024-05-28 15:37:41] [INFO ] Deduced a trap composed of 148 places in 186 ms of which 2 ms to minimize.
[2024-05-28 15:37:41] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 1 ms to minimize.
[2024-05-28 15:37:41] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:37:42] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:37:42] [INFO ] Deduced a trap composed of 205 places in 195 ms of which 2 ms to minimize.
[2024-05-28 15:37:43] [INFO ] Deduced a trap composed of 215 places in 205 ms of which 2 ms to minimize.
[2024-05-28 15:37:43] [INFO ] Deduced a trap composed of 215 places in 204 ms of which 2 ms to minimize.
[2024-05-28 15:37:43] [INFO ] Deduced a trap composed of 225 places in 213 ms of which 3 ms to minimize.
[2024-05-28 15:37:43] [INFO ] Deduced a trap composed of 215 places in 247 ms of which 2 ms to minimize.
[2024-05-28 15:37:43] [INFO ] Deduced a trap composed of 225 places in 235 ms of which 3 ms to minimize.
[2024-05-28 15:37:44] [INFO ] Deduced a trap composed of 225 places in 197 ms of which 2 ms to minimize.
[2024-05-28 15:37:44] [INFO ] Deduced a trap composed of 235 places in 212 ms of which 2 ms to minimize.
[2024-05-28 15:37:44] [INFO ] Deduced a trap composed of 215 places in 202 ms of which 3 ms to minimize.
[2024-05-28 15:37:44] [INFO ] Deduced a trap composed of 225 places in 263 ms of which 3 ms to minimize.
[2024-05-28 15:37:45] [INFO ] Deduced a trap composed of 225 places in 233 ms of which 2 ms to minimize.
[2024-05-28 15:37:45] [INFO ] Deduced a trap composed of 235 places in 226 ms of which 2 ms to minimize.
[2024-05-28 15:37:45] [INFO ] Deduced a trap composed of 205 places in 230 ms of which 2 ms to minimize.
[2024-05-28 15:37:45] [INFO ] Deduced a trap composed of 215 places in 227 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:37:46] [INFO ] Deduced a trap composed of 208 places in 236 ms of which 2 ms to minimize.
[2024-05-28 15:37:46] [INFO ] Deduced a trap composed of 165 places in 223 ms of which 2 ms to minimize.
[2024-05-28 15:37:47] [INFO ] Deduced a trap composed of 156 places in 219 ms of which 2 ms to minimize.
[2024-05-28 15:37:47] [INFO ] Deduced a trap composed of 185 places in 249 ms of which 2 ms to minimize.
[2024-05-28 15:37:47] [INFO ] Deduced a trap composed of 211 places in 224 ms of which 2 ms to minimize.
[2024-05-28 15:37:48] [INFO ] Deduced a trap composed of 177 places in 291 ms of which 2 ms to minimize.
[2024-05-28 15:37:48] [INFO ] Deduced a trap composed of 176 places in 358 ms of which 2 ms to minimize.
[2024-05-28 15:37:49] [INFO ] Deduced a trap composed of 176 places in 280 ms of which 2 ms to minimize.
[2024-05-28 15:37:49] [INFO ] Deduced a trap composed of 190 places in 197 ms of which 2 ms to minimize.
[2024-05-28 15:37:49] [INFO ] Deduced a trap composed of 180 places in 197 ms of which 3 ms to minimize.
[2024-05-28 15:37:49] [INFO ] Deduced a trap composed of 187 places in 203 ms of which 2 ms to minimize.
[2024-05-28 15:37:50] [INFO ] Deduced a trap composed of 191 places in 193 ms of which 2 ms to minimize.
[2024-05-28 15:37:50] [INFO ] Deduced a trap composed of 198 places in 201 ms of which 2 ms to minimize.
[2024-05-28 15:37:50] [INFO ] Deduced a trap composed of 188 places in 202 ms of which 2 ms to minimize.
[2024-05-28 15:37:50] [INFO ] Deduced a trap composed of 184 places in 221 ms of which 3 ms to minimize.
[2024-05-28 15:37:50] [INFO ] Deduced a trap composed of 195 places in 214 ms of which 3 ms to minimize.
[2024-05-28 15:37:51] [INFO ] Deduced a trap composed of 193 places in 204 ms of which 3 ms to minimize.
[2024-05-28 15:37:51] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 1 ms to minimize.
[2024-05-28 15:37:54] [INFO ] Deduced a trap composed of 215 places in 214 ms of which 3 ms to minimize.
[2024-05-28 15:37:54] [INFO ] Deduced a trap composed of 225 places in 270 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1602 variables, and 109 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20073 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 69/69 constraints]
After SMT, in 42944ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 42959ms
[2024-05-28 15:37:57] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-28 15:37:57] [INFO ] Invariant cache hit.
[2024-05-28 15:37:57] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-28 15:37:57] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-28 15:37:57] [INFO ] Invariant cache hit.
[2024-05-28 15:37:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:38:03] [INFO ] Implicit Places using invariants and state equation in 5940 ms returned []
Implicit Place search using SMT with State Equation took 6324 ms to find 0 implicit places.
[2024-05-28 15:38:03] [INFO ] Redundant transitions in 22 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-28 15:38:03] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-28 15:38:03] [INFO ] Invariant cache hit.
[2024-05-28 15:38:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:38:13] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:38:13] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:38:13] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
[2024-05-28 15:38:13] [INFO ] Deduced a trap composed of 53 places in 30 ms of which 0 ms to minimize.
[2024-05-28 15:38:13] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 0 ms to minimize.
[2024-05-28 15:38:13] [INFO ] Deduced a trap composed of 177 places in 199 ms of which 2 ms to minimize.
[2024-05-28 15:38:13] [INFO ] Deduced a trap composed of 175 places in 229 ms of which 2 ms to minimize.
[2024-05-28 15:38:14] [INFO ] Deduced a trap composed of 176 places in 200 ms of which 2 ms to minimize.
[2024-05-28 15:38:14] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 2 ms to minimize.
[2024-05-28 15:38:14] [INFO ] Deduced a trap composed of 197 places in 194 ms of which 2 ms to minimize.
[2024-05-28 15:38:14] [INFO ] Deduced a trap composed of 181 places in 194 ms of which 2 ms to minimize.
[2024-05-28 15:38:14] [INFO ] Deduced a trap composed of 187 places in 201 ms of which 2 ms to minimize.
[2024-05-28 15:38:15] [INFO ] Deduced a trap composed of 183 places in 200 ms of which 2 ms to minimize.
[2024-05-28 15:38:15] [INFO ] Deduced a trap composed of 167 places in 206 ms of which 2 ms to minimize.
[2024-05-28 15:38:15] [INFO ] Deduced a trap composed of 192 places in 195 ms of which 2 ms to minimize.
[2024-05-28 15:38:15] [INFO ] Deduced a trap composed of 172 places in 179 ms of which 2 ms to minimize.
[2024-05-28 15:38:15] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2024-05-28 15:38:16] [INFO ] Deduced a trap composed of 184 places in 218 ms of which 2 ms to minimize.
[2024-05-28 15:38:16] [INFO ] Deduced a trap composed of 190 places in 192 ms of which 2 ms to minimize.
[2024-05-28 15:38:16] [INFO ] Deduced a trap composed of 190 places in 202 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:38:17] [INFO ] Deduced a trap composed of 209 places in 205 ms of which 2 ms to minimize.
[2024-05-28 15:38:17] [INFO ] Deduced a trap composed of 182 places in 197 ms of which 2 ms to minimize.
[2024-05-28 15:38:18] [INFO ] Deduced a trap composed of 181 places in 202 ms of which 2 ms to minimize.
[2024-05-28 15:38:18] [INFO ] Deduced a trap composed of 182 places in 206 ms of which 2 ms to minimize.
[2024-05-28 15:38:18] [INFO ] Deduced a trap composed of 215 places in 212 ms of which 2 ms to minimize.
[2024-05-28 15:38:18] [INFO ] Deduced a trap composed of 179 places in 223 ms of which 2 ms to minimize.
[2024-05-28 15:38:18] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 3 ms to minimize.
[2024-05-28 15:38:19] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 2 ms to minimize.
[2024-05-28 15:38:22] [INFO ] Deduced a trap composed of 237 places in 742 ms of which 2 ms to minimize.
[2024-05-28 15:38:29] [INFO ] Deduced a trap composed of 197 places in 183 ms of which 2 ms to minimize.
[2024-05-28 15:38:29] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 2 ms to minimize.
[2024-05-28 15:38:30] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 3 ms to minimize.
[2024-05-28 15:38:31] [INFO ] Deduced a trap composed of 169 places in 233 ms of which 2 ms to minimize.
[2024-05-28 15:38:31] [INFO ] Deduced a trap composed of 191 places in 203 ms of which 2 ms to minimize.
[2024-05-28 15:38:31] [INFO ] Deduced a trap composed of 167 places in 217 ms of which 2 ms to minimize.
[2024-05-28 15:38:32] [INFO ] Deduced a trap composed of 189 places in 182 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1602 variables, and 76 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 36/76 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:38:38] [INFO ] Deduced a trap composed of 158 places in 146 ms of which 1 ms to minimize.
[2024-05-28 15:38:38] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 2 ms to minimize.
[2024-05-28 15:38:40] [INFO ] Deduced a trap composed of 200 places in 213 ms of which 3 ms to minimize.
[2024-05-28 15:38:41] [INFO ] Deduced a trap composed of 210 places in 214 ms of which 2 ms to minimize.
[2024-05-28 15:38:41] [INFO ] Deduced a trap composed of 196 places in 199 ms of which 2 ms to minimize.
[2024-05-28 15:38:41] [INFO ] Deduced a trap composed of 196 places in 195 ms of which 2 ms to minimize.
[2024-05-28 15:38:41] [INFO ] Deduced a trap composed of 196 places in 199 ms of which 2 ms to minimize.
[2024-05-28 15:38:41] [INFO ] Deduced a trap composed of 206 places in 226 ms of which 3 ms to minimize.
[2024-05-28 15:38:42] [INFO ] Deduced a trap composed of 216 places in 208 ms of which 2 ms to minimize.
[2024-05-28 15:38:42] [INFO ] Deduced a trap composed of 220 places in 209 ms of which 2 ms to minimize.
[2024-05-28 15:38:42] [INFO ] Deduced a trap composed of 220 places in 204 ms of which 2 ms to minimize.
[2024-05-28 15:38:42] [INFO ] Deduced a trap composed of 230 places in 208 ms of which 2 ms to minimize.
[2024-05-28 15:38:43] [INFO ] Deduced a trap composed of 213 places in 220 ms of which 2 ms to minimize.
[2024-05-28 15:38:43] [INFO ] Deduced a trap composed of 223 places in 204 ms of which 3 ms to minimize.
[2024-05-28 15:38:43] [INFO ] Deduced a trap composed of 230 places in 211 ms of which 2 ms to minimize.
[2024-05-28 15:38:43] [INFO ] Deduced a trap composed of 215 places in 214 ms of which 2 ms to minimize.
[2024-05-28 15:38:43] [INFO ] Deduced a trap composed of 196 places in 216 ms of which 3 ms to minimize.
[2024-05-28 15:38:44] [INFO ] Deduced a trap composed of 196 places in 200 ms of which 2 ms to minimize.
[2024-05-28 15:38:44] [INFO ] Deduced a trap composed of 206 places in 205 ms of which 2 ms to minimize.
[2024-05-28 15:38:44] [INFO ] Deduced a trap composed of 140 places in 220 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:38:47] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 2 ms to minimize.
[2024-05-28 15:38:48] [INFO ] Deduced a trap composed of 169 places in 167 ms of which 2 ms to minimize.
[2024-05-28 15:38:52] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2024-05-28 15:38:54] [INFO ] Deduced a trap composed of 246 places in 236 ms of which 2 ms to minimize.
[2024-05-28 15:38:56] [INFO ] Deduced a trap composed of 134 places in 190 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:38:57] [INFO ] Deduced a trap composed of 186 places in 172 ms of which 2 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 169 places in 192 ms of which 2 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 173 places in 179 ms of which 2 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 2 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 159 places in 197 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1602 variables, and 106 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 66/66 constraints]
After SMT, in 62595ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 62612ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111976 ms. Remains : 422/422 places, 1204/1204 transitions.
Built C files in :
/tmp/ltsmin6228191767002599659
[2024-05-28 15:39:06] [INFO ] Computing symmetric may disable matrix : 1204 transitions.
[2024-05-28 15:39:06] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:39:06] [INFO ] Computing symmetric may enable matrix : 1204 transitions.
[2024-05-28 15:39:06] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:39:06] [INFO ] Computing Do-Not-Accords matrix : 1204 transitions.
[2024-05-28 15:39:06] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:39:06] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6228191767002599659
Running compilation step : cd /tmp/ltsmin6228191767002599659;'/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/ltsmin6228191767002599659;'/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/ltsmin6228191767002599659;'/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 15:39:09] [INFO ] Flatten gal took : 201 ms
[2024-05-28 15:39:09] [INFO ] Flatten gal took : 146 ms
[2024-05-28 15:39:09] [INFO ] Time to serialize gal into /tmp/LTL3412763163048664726.gal : 8 ms
[2024-05-28 15:39:09] [INFO ] Time to serialize properties into /tmp/LTL12613795618476908122.prop : 13 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/LTL3412763163048664726.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8907029097729606911.hoa' '-atoms' '/tmp/LTL12613795618476908122.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/LTL12613795618476908122.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8907029097729606911.hoa
Detected timeout of ITS tools.
[2024-05-28 15:39:25] [INFO ] Flatten gal took : 43 ms
[2024-05-28 15:39:25] [INFO ] Flatten gal took : 100 ms
[2024-05-28 15:39:25] [INFO ] Time to serialize gal into /tmp/LTL11309197425651734374.gal : 42 ms
[2024-05-28 15:39:25] [INFO ] Time to serialize properties into /tmp/LTL6274696161459190190.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/LTL11309197425651734374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6274696161459190190.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(cSources>=1)"))))
Formula 0 simplified : FG!"(cSources>=1)"
Detected timeout of ITS tools.
[2024-05-28 15:39:40] [INFO ] Flatten gal took : 77 ms
[2024-05-28 15:39:40] [INFO ] Applying decomposition
[2024-05-28 15:39:40] [INFO ] Flatten gal took : 58 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/graph6310575294450866016.txt' '-o' '/tmp/graph6310575294450866016.bin' '-w' '/tmp/graph6310575294450866016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6310575294450866016.bin' '-l' '-1' '-v' '-w' '/tmp/graph6310575294450866016.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:39:40] [INFO ] Decomposing Gal with order
[2024-05-28 15:39:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:39:40] [INFO ] Removed a total of 788 redundant transitions.
[2024-05-28 15:39:40] [INFO ] Flatten gal took : 164 ms
[2024-05-28 15:39:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 18 ms.
[2024-05-28 15:39:40] [INFO ] Time to serialize gal into /tmp/LTL17459991487885602209.gal : 17 ms
[2024-05-28 15:39:40] [INFO ] Time to serialize properties into /tmp/LTL15741717123572607386.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/LTL17459991487885602209.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15741717123572607386.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(i10.u15.cSources>=1)"))))
Formula 0 simplified : FG!"(i10.u15.cSources>=1)"
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-09 finished in 392555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
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 2 with 120 rules applied. Total rules applied 348 place count 422 transition count 1378
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 354 place count 416 transition count 1372
Iterating global reduction 2 with 6 rules applied. Total rules applied 360 place count 416 transition count 1372
Applied a total of 360 rules in 58 ms. Remains 416 /600 variables (removed 184) and now considering 1372/1552 (removed 180) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-28 15:39:56] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 416 cols
[2024-05-28 15:39:56] [INFO ] Computed 44 invariants in 35 ms
[2024-05-28 15:39:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:40:09] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 2 ms to minimize.
[2024-05-28 15:40:09] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:40:09] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 1 ms to minimize.
[2024-05-28 15:40:09] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:40:09] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:40:10] [INFO ] Deduced a trap composed of 193 places in 316 ms of which 3 ms to minimize.
[2024-05-28 15:40:10] [INFO ] Deduced a trap composed of 173 places in 253 ms of which 3 ms to minimize.
[2024-05-28 15:40:11] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:40:13] [INFO ] Deduced a trap composed of 216 places in 313 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1764 variables, and 49 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:40:23] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 1 ms to minimize.
[2024-05-28 15:40:24] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2024-05-28 15:40:25] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 1 ms to minimize.
[2024-05-28 15:40:37] [INFO ] Deduced a trap composed of 132 places in 260 ms of which 3 ms to minimize.
[2024-05-28 15:40:38] [INFO ] Deduced a trap composed of 132 places in 221 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1764 variables, and 54 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 14/14 constraints]
After SMT, in 45946ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 45964ms
[2024-05-28 15:40:42] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 15:40:42] [INFO ] Invariant cache hit.
[2024-05-28 15:40:42] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-28 15:40:42] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 15:40:42] [INFO ] Invariant cache hit.
[2024-05-28 15:40:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:40:47] [INFO ] Implicit Places using invariants and state equation in 5399 ms returned []
Implicit Place search using SMT with State Equation took 5814 ms to find 0 implicit places.
[2024-05-28 15:40:47] [INFO ] Redundant transitions in 24 ms returned []
Running 1368 sub problems to find dead transitions.
[2024-05-28 15:40:47] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 15:40:47] [INFO ] Invariant cache hit.
[2024-05-28 15:40:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:41:00] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:41:00] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:41:00] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:41:00] [INFO ] Deduced a trap composed of 52 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:41:00] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:41:00] [INFO ] Deduced a trap composed of 205 places in 311 ms of which 2 ms to minimize.
[2024-05-28 15:41:01] [INFO ] Deduced a trap composed of 188 places in 215 ms of which 2 ms to minimize.
[2024-05-28 15:41:01] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:41:13] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 2 ms to minimize.
[2024-05-28 15:41:13] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 2 ms to minimize.
[2024-05-28 15:41:13] [INFO ] Deduced a trap composed of 141 places in 217 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:41:17] [INFO ] Deduced a trap composed of 216 places in 229 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1764 variables, and 52 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:41:24] [INFO ] Deduced a trap composed of 182 places in 301 ms of which 3 ms to minimize.
[2024-05-28 15:41:38] [INFO ] Deduced a trap composed of 127 places in 300 ms of which 3 ms to minimize.
[2024-05-28 15:41:39] [INFO ] Deduced a trap composed of 132 places in 256 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:41:49] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1764 variables, and 56 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 16/16 constraints]
After SMT, in 64934ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 64946ms
Starting structural reductions in SI_LTL mode, iteration 1 : 416/600 places, 1372/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116832 ms. Remains : 416/600 places, 1372/1552 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-10
Stuttering criterion allowed to conclude after 17314 steps with 68 reset in 68 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-10 finished in 116975 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 17 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 8 ms. Remains 596 /600 variables (removed 4) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:41:53] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 15:41:53] [INFO ] Computed 44 invariants in 41 ms
[2024-05-28 15:41:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:42:08] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 2 ms to minimize.
[2024-05-28 15:42:08] [INFO ] Deduced a trap composed of 82 places in 39 ms of which 0 ms to minimize.
[2024-05-28 15:42:08] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2024-05-28 15:42:08] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:42:08] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:42:08] [INFO ] Deduced a trap composed of 339 places in 343 ms of which 3 ms to minimize.
[2024-05-28 15:42:09] [INFO ] Deduced a trap composed of 351 places in 342 ms of which 4 ms to minimize.
[2024-05-28 15:42:09] [INFO ] Deduced a trap composed of 339 places in 326 ms of which 4 ms to minimize.
[2024-05-28 15:42:09] [INFO ] Deduced a trap composed of 108 places in 314 ms of which 4 ms to minimize.
[2024-05-28 15:42:10] [INFO ] Deduced a trap composed of 82 places in 217 ms of which 3 ms to minimize.
[2024-05-28 15:42:10] [INFO ] Deduced a trap composed of 139 places in 215 ms of which 3 ms to minimize.
[2024-05-28 15:42:11] [INFO ] Deduced a trap composed of 295 places in 350 ms of which 4 ms to minimize.
[2024-05-28 15:42:11] [INFO ] Deduced a trap composed of 315 places in 246 ms of which 3 ms to minimize.
[2024-05-28 15:42:12] [INFO ] Deduced a trap composed of 374 places in 259 ms of which 3 ms to minimize.
[2024-05-28 15:42:12] [INFO ] Deduced a trap composed of 343 places in 265 ms of which 3 ms to minimize.
[2024-05-28 15:42:12] [INFO ] Deduced a trap composed of 309 places in 297 ms of which 3 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 Real declared 592/2124 variables, and 56 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:42:20] [INFO ] Deduced a trap composed of 338 places in 283 ms of which 3 ms to minimize.
[2024-05-28 15:42:21] [INFO ] Deduced a trap composed of 322 places in 346 ms of which 4 ms to minimize.
[2024-05-28 15:42:27] [INFO ] Deduced a trap composed of 360 places in 246 ms of which 3 ms to minimize.
[2024-05-28 15:42:27] [INFO ] Deduced a trap composed of 300 places in 247 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 60 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 20/20 constraints]
After SMT, in 44820ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 44834ms
[2024-05-28 15:42:37] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:42:37] [INFO ] Invariant cache hit.
[2024-05-28 15:42:38] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-28 15:42:38] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:42:38] [INFO ] Invariant cache hit.
[2024-05-28 15:42:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:42:47] [INFO ] Implicit Places using invariants and state equation in 9389 ms returned []
Implicit Place search using SMT with State Equation took 9960 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:42:47] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:42:47] [INFO ] Invariant cache hit.
[2024-05-28 15:42:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:43:04] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:43:04] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:43:04] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:43:04] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:43:04] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:43:05] [INFO ] Deduced a trap composed of 360 places in 382 ms of which 4 ms to minimize.
[2024-05-28 15:43:05] [INFO ] Deduced a trap composed of 413 places in 340 ms of which 4 ms to minimize.
[2024-05-28 15:43:06] [INFO ] Deduced a trap composed of 351 places in 346 ms of which 4 ms to minimize.
[2024-05-28 15:43:06] [INFO ] Deduced a trap composed of 353 places in 301 ms of which 3 ms to minimize.
[2024-05-28 15:43:06] [INFO ] Deduced a trap composed of 363 places in 263 ms of which 3 ms to minimize.
[2024-05-28 15:43:07] [INFO ] Deduced a trap composed of 141 places in 235 ms of which 3 ms to minimize.
[2024-05-28 15:43:07] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:43:07] [INFO ] Deduced a trap composed of 304 places in 316 ms of which 4 ms to minimize.
[2024-05-28 15:43:08] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 2 ms to minimize.
[2024-05-28 15:43:09] [INFO ] Deduced a trap composed of 346 places in 391 ms of which 4 ms to minimize.
[2024-05-28 15:43:10] [INFO ] Deduced a trap composed of 328 places in 362 ms of which 3 ms to minimize.
[2024-05-28 15:43:10] [INFO ] Deduced a trap composed of 346 places in 266 ms of which 3 ms to minimize.
[2024-05-28 15:43:10] [INFO ] Deduced a trap composed of 92 places in 269 ms of which 3 ms to minimize.
[2024-05-28 15:43:10] [INFO ] Deduced a trap composed of 330 places in 271 ms of which 7 ms to minimize.
[2024-05-28 15:43:11] [INFO ] Deduced a trap composed of 315 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:43:12] [INFO ] Deduced a trap composed of 313 places in 339 ms of which 4 ms to minimize.
[2024-05-28 15:43:18] [INFO ] Deduced a trap composed of 360 places in 231 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 62 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:43:25] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:43:25] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 64 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 24/24 constraints]
After SMT, in 64887ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 64900ms
Starting structural reductions in LTL mode, iteration 1 : 596/600 places, 1552/1552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119709 ms. Remains : 596/600 places, 1552/1552 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-11 finished in 119869 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)))'
Support contains 6 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 11 ms. Remains 596 /600 variables (removed 4) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:43:52] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 15:43:52] [INFO ] Computed 44 invariants in 47 ms
[2024-05-28 15:43:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:44:08] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:44:08] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:44:08] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:44:08] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:44:08] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:44:09] [INFO ] Deduced a trap composed of 398 places in 314 ms of which 3 ms to minimize.
[2024-05-28 15:44:09] [INFO ] Deduced a trap composed of 359 places in 298 ms of which 3 ms to minimize.
[2024-05-28 15:44:10] [INFO ] Deduced a trap composed of 348 places in 299 ms of which 3 ms to minimize.
[2024-05-28 15:44:10] [INFO ] Deduced a trap composed of 139 places in 321 ms of which 3 ms to minimize.
[2024-05-28 15:44:10] [INFO ] Deduced a trap composed of 82 places in 255 ms of which 3 ms to minimize.
[2024-05-28 15:44:11] [INFO ] Deduced a trap composed of 160 places in 259 ms of which 4 ms to minimize.
[2024-05-28 15:44:12] [INFO ] Deduced a trap composed of 304 places in 408 ms of which 4 ms to minimize.
[2024-05-28 15:44:12] [INFO ] Deduced a trap composed of 328 places in 399 ms of which 5 ms to minimize.
[2024-05-28 15:44:13] [INFO ] Deduced a trap composed of 429 places in 371 ms of which 4 ms to minimize.
[2024-05-28 15:44:14] [INFO ] Deduced a trap composed of 366 places in 327 ms of which 3 ms to minimize.
[2024-05-28 15:44:14] [INFO ] Deduced a trap composed of 375 places in 296 ms of which 3 ms to minimize.
[2024-05-28 15:44:14] [INFO ] Deduced a trap composed of 355 places in 273 ms of which 3 ms to minimize.
[2024-05-28 15:44:15] [INFO ] Deduced a trap composed of 371 places in 300 ms of which 3 ms to minimize.
[2024-05-28 15:44:15] [INFO ] Deduced a trap composed of 340 places in 285 ms of which 3 ms to minimize.
[2024-05-28 15:44:15] [INFO ] Deduced a trap composed of 358 places in 258 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 60 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:44:20] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 2 ms to minimize.
[2024-05-28 15:44:26] [INFO ] Deduced a trap composed of 382 places in 306 ms of which 4 ms to minimize.
[2024-05-28 15:44:27] [INFO ] Deduced a trap composed of 362 places in 347 ms of which 5 ms to minimize.
[2024-05-28 15:44:30] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 64 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 24/24 constraints]
After SMT, in 44856ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 44873ms
[2024-05-28 15:44:37] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:44:37] [INFO ] Invariant cache hit.
[2024-05-28 15:44:38] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-28 15:44:38] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:44:38] [INFO ] Invariant cache hit.
[2024-05-28 15:44:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:44:47] [INFO ] Implicit Places using invariants and state equation in 9008 ms returned []
Implicit Place search using SMT with State Equation took 9549 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-05-28 15:44:47] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 15:44:47] [INFO ] Invariant cache hit.
[2024-05-28 15:44:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:45:05] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:45:05] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:45:05] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:45:05] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:45:05] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:45:06] [INFO ] Deduced a trap composed of 360 places in 341 ms of which 5 ms to minimize.
[2024-05-28 15:45:06] [INFO ] Deduced a trap composed of 359 places in 345 ms of which 5 ms to minimize.
[2024-05-28 15:45:07] [INFO ] Deduced a trap composed of 263 places in 349 ms of which 4 ms to minimize.
[2024-05-28 15:45:07] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:45:07] [INFO ] Deduced a trap composed of 288 places in 336 ms of which 4 ms to minimize.
[2024-05-28 15:45:09] [INFO ] Deduced a trap composed of 362 places in 412 ms of which 4 ms to minimize.
[2024-05-28 15:45:09] [INFO ] Deduced a trap composed of 362 places in 457 ms of which 4 ms to minimize.
[2024-05-28 15:45:10] [INFO ] Deduced a trap composed of 355 places in 446 ms of which 4 ms to minimize.
[2024-05-28 15:45:10] [INFO ] Deduced a trap composed of 350 places in 442 ms of which 4 ms to minimize.
[2024-05-28 15:45:10] [INFO ] Deduced a trap composed of 342 places in 409 ms of which 4 ms to minimize.
[2024-05-28 15:45:11] [INFO ] Deduced a trap composed of 330 places in 405 ms of which 5 ms to minimize.
[2024-05-28 15:45:11] [INFO ] Deduced a trap composed of 339 places in 384 ms of which 4 ms to minimize.
[2024-05-28 15:45:12] [INFO ] Deduced a trap composed of 305 places in 341 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 58 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 15:45:25] [INFO ] Deduced a trap composed of 334 places in 244 ms of which 3 ms to minimize.
[2024-05-28 15:45:26] [INFO ] Deduced a trap composed of 169 places in 149 ms of which 2 ms to minimize.
[2024-05-28 15:45:32] [INFO ] Deduced a trap composed of 366 places in 254 ms of which 3 ms to minimize.
[2024-05-28 15:45:32] [INFO ] Deduced a trap composed of 366 places in 257 ms of which 3 ms to minimize.
[2024-05-28 15:45:34] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-28 15:45:44] [INFO ] Deduced a trap composed of 414 places in 340 ms of which 4 ms to minimize.
[2024-05-28 15:45:45] [INFO ] Deduced a trap composed of 65 places in 343 ms of which 4 ms to minimize.
[2024-05-28 15:45:46] [INFO ] Deduced a trap composed of 42 places in 349 ms of which 3 ms to minimize.
[2024-05-28 15:45:51] [INFO ] Deduced a trap composed of 358 places in 341 ms of which 5 ms to minimize.
[2024-05-28 15:45:51] [INFO ] Deduced a trap composed of 313 places in 322 ms of which 5 ms to minimize.
[2024-05-28 15:45:52] [INFO ] Deduced a trap composed of 291 places in 370 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 69 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 29/29 constraints]
After SMT, in 66409ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 66423ms
Starting structural reductions in LTL mode, iteration 1 : 596/600 places, 1552/1552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120864 ms. Remains : 596/600 places, 1552/1552 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 737 ms.
Product exploration explored 100000 steps with 50000 reset in 754 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-13 finished in 122514 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&&F(G(!p0)))))'
Support contains 43 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 1552/1552 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 84 place count 554 transition count 1480
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 144 place count 524 transition count 1480
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 2 with 120 rules applied. Total rules applied 264 place count 464 transition count 1420
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 270 place count 458 transition count 1414
Iterating global reduction 2 with 6 rules applied. Total rules applied 276 place count 458 transition count 1414
Applied a total of 276 rules in 79 ms. Remains 458 /600 variables (removed 142) and now considering 1414/1552 (removed 138) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-28 15:45:55] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
// Phase 1: matrix 1390 rows 458 cols
[2024-05-28 15:45:55] [INFO ] Computed 44 invariants in 30 ms
[2024-05-28 15:45:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 15:46:09] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 1 ms to minimize.
[2024-05-28 15:46:09] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:46:09] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:46:09] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:46:09] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:46:09] [INFO ] Deduced a trap composed of 238 places in 283 ms of which 2 ms to minimize.
[2024-05-28 15:46:09] [INFO ] Deduced a trap composed of 232 places in 225 ms of which 3 ms to minimize.
[2024-05-28 15:46:10] [INFO ] Deduced a trap composed of 216 places in 241 ms of which 2 ms to minimize.
[2024-05-28 15:46:10] [INFO ] Deduced a trap composed of 250 places in 300 ms of which 2 ms to minimize.
[2024-05-28 15:46:10] [INFO ] Deduced a trap composed of 302 places in 233 ms of which 2 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 261 places in 326 ms of which 3 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 252 places in 378 ms of which 3 ms to minimize.
[2024-05-28 15:46:12] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:46:19] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1848 variables, and 54 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/458 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 15:46:24] [INFO ] Deduced a trap composed of 258 places in 257 ms of which 3 ms to minimize.
[2024-05-28 15:46:25] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 2 ms to minimize.
[2024-05-28 15:46:38] [INFO ] Deduced a trap composed of 174 places in 966 ms of which 4 ms to minimize.
[2024-05-28 15:46:38] [INFO ] Deduced a trap composed of 256 places in 289 ms of which 2 ms to minimize.
[2024-05-28 15:46:38] [INFO ] Deduced a trap composed of 175 places in 223 ms of which 2 ms to minimize.
[2024-05-28 15:46:39] [INFO ] Deduced a trap composed of 250 places in 240 ms of which 3 ms to minimize.
[2024-05-28 15:46:39] [INFO ] Deduced a trap composed of 272 places in 215 ms of which 2 ms to minimize.
[2024-05-28 15:46:39] [INFO ] Deduced a trap composed of 249 places in 213 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1848 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/458 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints]
After SMT, in 45094ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 45110ms
[2024-05-28 15:46:40] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
[2024-05-28 15:46:40] [INFO ] Invariant cache hit.
[2024-05-28 15:46:40] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-28 15:46:40] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
[2024-05-28 15:46:40] [INFO ] Invariant cache hit.
[2024-05-28 15:46:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:46:46] [INFO ] Implicit Places using invariants and state equation in 5830 ms returned []
Implicit Place search using SMT with State Equation took 6144 ms to find 0 implicit places.
[2024-05-28 15:46:46] [INFO ] Redundant transitions in 22 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-05-28 15:46:46] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
[2024-05-28 15:46:46] [INFO ] Invariant cache hit.
[2024-05-28 15:46:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 15:47:00] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:47:00] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:47:00] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 1 ms to minimize.
[2024-05-28 15:47:00] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:47:00] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 0 ms to minimize.
[2024-05-28 15:47:01] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 2 ms to minimize.
[2024-05-28 15:47:01] [INFO ] Deduced a trap composed of 241 places in 327 ms of which 4 ms to minimize.
[2024-05-28 15:47:01] [INFO ] Deduced a trap composed of 216 places in 258 ms of which 3 ms to minimize.
[2024-05-28 15:47:01] [INFO ] Deduced a trap composed of 258 places in 240 ms of which 2 ms to minimize.
[2024-05-28 15:47:02] [INFO ] Deduced a trap composed of 239 places in 231 ms of which 2 ms to minimize.
[2024-05-28 15:47:02] [INFO ] Deduced a trap composed of 246 places in 235 ms of which 2 ms to minimize.
[2024-05-28 15:47:02] [INFO ] Deduced a trap composed of 251 places in 229 ms of which 3 ms to minimize.
[2024-05-28 15:47:02] [INFO ] Deduced a trap composed of 219 places in 227 ms of which 2 ms to minimize.
[2024-05-28 15:47:03] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:47:13] [INFO ] Deduced a trap composed of 261 places in 201 ms of which 2 ms to minimize.
[2024-05-28 15:47:15] [INFO ] Deduced a trap composed of 146 places in 217 ms of which 2 ms to minimize.
[2024-05-28 15:47:16] [INFO ] Deduced a trap composed of 210 places in 209 ms of which 2 ms to minimize.
[2024-05-28 15:47:16] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1848 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/458 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 15:47:26] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:47:37] [INFO ] Deduced a trap composed of 174 places in 193 ms of which 3 ms to minimize.
[2024-05-28 15:47:37] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 15:47:41] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1848 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/458 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints]
After SMT, in 65002ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 65019ms
Starting structural reductions in SI_LTL mode, iteration 1 : 458/600 places, 1414/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116397 ms. Remains : 458/600 places, 1414/1552 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), p0]
Running random walk in product with property : PolyORBLF-COL-S04J06T06-LTLCardinality-14
Product exploration explored 100000 steps with 25 reset in 422 ms.
Stack based approach found an accepted trace after 6679 steps with 2 reset with depth 2422 and stack size 2422 in 32 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J06T06-LTLCardinality-14 finished in 116978 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)||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' '!(G(F(p0)))'
[2024-05-28 15:47:52] [INFO ] Flatten gal took : 92 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18166665596516811462
[2024-05-28 15:47:52] [INFO ] Too many transitions (1552) to apply POR reductions. Disabling POR matrices.
[2024-05-28 15:47:52] [INFO ] Applying decomposition
[2024-05-28 15:47:52] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18166665596516811462
Running compilation step : cd /tmp/ltsmin18166665596516811462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 15:47:52] [INFO ] Flatten gal took : 105 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/graph11901493253467941375.txt' '-o' '/tmp/graph11901493253467941375.bin' '-w' '/tmp/graph11901493253467941375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11901493253467941375.bin' '-l' '-1' '-v' '-w' '/tmp/graph11901493253467941375.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:47:53] [INFO ] Decomposing Gal with order
[2024-05-28 15:47:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:47:53] [INFO ] Removed a total of 1268 redundant transitions.
[2024-05-28 15:47:53] [INFO ] Flatten gal took : 165 ms
[2024-05-28 15:47:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 254 labels/synchronizations in 25 ms.
[2024-05-28 15:47:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality8750041352113654190.gal : 17 ms
[2024-05-28 15:47:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality12627701247283468310.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/LTLCardinality8750041352113654190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12627701247283468310.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 2 LTL properties
Checking formula 0 : !((X((F("((((gu89.ScheduleTaskE_Idle_0+gu89.ScheduleTaskE_Idle_1)+(gu89.ScheduleTaskE_Idle_2+gu89.ScheduleTaskE_Idle_3))+(gu89.Schedul...984
Formula 0 simplified : X(G!"((((gu89.ScheduleTaskE_Idle_0+gu89.ScheduleTaskE_Idle_1)+(gu89.ScheduleTaskE_Idle_2+gu89.ScheduleTaskE_Idle_3))+(gu89.ScheduleT...976
Compilation finished in 3775 ms.
Running link step : cd /tmp/ltsmin18166665596516811462;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 126 ms.
Running LTSmin : cd /tmp/ltsmin18166665596516811462;'/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((<>((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 4573 ms.
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin18166665596516811462;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin18166665596516811462;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin18166665596516811462;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-28 16:12:57] [INFO ] Applying decomposition
[2024-05-28 16:12:57] [INFO ] Flatten gal took : 146 ms
[2024-05-28 16:12:57] [INFO ] Decomposing Gal with order
[2024-05-28 16:12:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:12:57] [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],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[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, 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, 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, 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, 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, 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, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, P_1617_5, ScheduleTaskE_Idle_5],[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],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[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],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DataOnSrc_2, PlaceSources_2, ModifiedSrc_2, AbourtToModifySrc_2],[DataOnSrc_3, PlaceSources_3, ModifiedSrc_3, AbourtToModifySrc_3],[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],[DisablePollingE_20, DisablePollingB_20, Insert_Source_B_20, P_1119_20, P_2579_20],[DisablePollingE_21, DisablePollingB_21, Insert_Source_B_21, P_1119_21, P_2579_21],[DisablePollingE_22, DisablePollingB_22, Insert_Source_B_22, P_1119_22, P_2579_22],[DisablePollingE_23, DisablePollingB_23, Insert_Source_B_23, P_1119_23, P_2579_23],

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 16:12:58] [INFO ] Flatten gal took : 281 ms
[2024-05-28 16:12:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality2051901009132732080.gal : 33 ms
[2024-05-28 16:12:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality2238870856868611389.ltl : 13 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/LTLCardinality2051901009132732080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2238870856868611389.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...297
Read 1 LTL properties
Checking formula 0 : !((G(F("(cSources>=1)"))))
Formula 0 simplified : FG!"(cSources>=1)"

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-S04J06T06"
export BK_EXAMINATION="LTLCardinality"
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-S04J06T06, examination is LTLCardinality"
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-171654446500147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J06T06.tgz
mv PolyORBLF-COL-S04J06T06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;