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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.9K Apr 11 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 17:00 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.3K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 11K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716907685736

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 14:48:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 14:48:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:48:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 14:48:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:48:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 565 ms
[2024-05-28 14:48:07] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 14:48:07] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 14:48:07] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 703 steps (0 resets) in 54 ms. (12 steps per ms) remains 0/24 properties
[2024-05-28 14:48:07] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:48:07] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:48:07] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 67 ms.
[2024-05-28 14:48:07] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 226 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Applied a total of 4 rules in 51 ms. Remains 550 /554 variables (removed 4) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-28 14:48:08] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-05-28 14:48:08] [INFO ] Computed 46 invariants in 49 ms
[2024-05-28 14:48:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 18 ms to minimize.
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 3 ms to minimize.
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 75 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 313 places in 266 ms of which 4 ms to minimize.
[2024-05-28 14:48:24] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:48:25] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-05-28 14:48:25] [INFO ] Deduced a trap composed of 319 places in 299 ms of which 4 ms to minimize.
[2024-05-28 14:48:26] [INFO ] Deduced a trap composed of 320 places in 279 ms of which 3 ms to minimize.
[2024-05-28 14:48:26] [INFO ] Deduced a trap composed of 317 places in 331 ms of which 4 ms to minimize.
[2024-05-28 14:48:26] [INFO ] Deduced a trap composed of 323 places in 317 ms of which 3 ms to minimize.
[2024-05-28 14:48:27] [INFO ] Deduced a trap composed of 311 places in 310 ms of which 7 ms to minimize.
[2024-05-28 14:48:27] [INFO ] Deduced a trap composed of 322 places in 340 ms of which 4 ms to minimize.
[2024-05-28 14:48:27] [INFO ] Deduced a trap composed of 313 places in 345 ms of which 4 ms to minimize.
[2024-05-28 14:48:28] [INFO ] Deduced a trap composed of 307 places in 297 ms of which 4 ms to minimize.
[2024-05-28 14:48:28] [INFO ] Deduced a trap composed of 322 places in 281 ms of which 4 ms to minimize.
[2024-05-28 14:48:28] [INFO ] Deduced a trap composed of 311 places in 282 ms of which 4 ms to minimize.
[2024-05-28 14:48:29] [INFO ] Deduced a trap composed of 315 places in 329 ms of which 4 ms to minimize.
[2024-05-28 14:48:29] [INFO ] Deduced a trap composed of 292 places in 317 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 14:48:30] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:48:31] [INFO ] Deduced a trap composed of 265 places in 335 ms of which 4 ms to minimize.
[2024-05-28 14:48:31] [INFO ] Deduced a trap composed of 245 places in 367 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1898 variables, and 65 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20091 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 23/65 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 14:48:35] [INFO ] Deduced a trap composed of 272 places in 388 ms of which 4 ms to minimize.
[2024-05-28 14:48:40] [INFO ] Deduced a trap composed of 324 places in 299 ms of which 4 ms to minimize.
[2024-05-28 14:48:40] [INFO ] Deduced a trap composed of 313 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:48:50] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 2 ms to minimize.
[2024-05-28 14:48:50] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:48:51] [INFO ] Deduced a trap composed of 259 places in 325 ms of which 4 ms to minimize.
[2024-05-28 14:48:51] [INFO ] Deduced a trap composed of 291 places in 299 ms of which 4 ms to minimize.
[2024-05-28 14:48:52] [INFO ] Deduced a trap composed of 293 places in 301 ms of which 4 ms to minimize.
[2024-05-28 14:48:52] [INFO ] Deduced a trap composed of 300 places in 270 ms of which 4 ms to minimize.
[2024-05-28 14:48:52] [INFO ] Deduced a trap composed of 290 places in 308 ms of which 4 ms to minimize.
SMT process timed out in 44721ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 44757ms
[2024-05-28 14:48:52] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 14:48:52] [INFO ] Invariant cache hit.
[2024-05-28 14:48:53] [INFO ] Implicit Places using invariants in 344 ms returned [428, 429, 430, 431, 432, 433]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 352 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 544/554 places, 1372/1372 transitions.
Applied a total of 0 rules in 13 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45210 ms. Remains : 544/554 places, 1372/1372 transitions.
Support contains 226 out of 544 places after structural reductions.
[2024-05-28 14:48:53] [INFO ] Flatten gal took : 118 ms
[2024-05-28 14:48:53] [INFO ] Flatten gal took : 102 ms
[2024-05-28 14:48:53] [INFO ] Input system was already deterministic with 1372 transitions.
RANDOM walk for 1427 steps (0 resets) in 137 ms. (10 steps per ms) remains 0/24 properties
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((F(p1) U p2) U p3)))'
Support contains 52 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 544 transition count 1342
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 514 transition count 1336
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 508 transition count 1336
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 72 place count 508 transition count 1270
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 204 place count 442 transition count 1270
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 240 place count 424 transition count 1252
Applied a total of 240 rules in 142 ms. Remains 424 /544 variables (removed 120) and now considering 1252/1372 (removed 120) transitions.
Running 1248 sub problems to find dead transitions.
[2024-05-28 14:48:54] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
// Phase 1: matrix 1228 rows 424 cols
[2024-05-28 14:48:54] [INFO ] Computed 40 invariants in 50 ms
[2024-05-28 14:48:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 2 ms to minimize.
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 5 ms to minimize.
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 2 ms to minimize.
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-28 14:49:06] [INFO ] Deduced a trap composed of 194 places in 271 ms of which 3 ms to minimize.
[2024-05-28 14:49:06] [INFO ] Deduced a trap composed of 197 places in 325 ms of which 3 ms to minimize.
[2024-05-28 14:49:07] [INFO ] Deduced a trap composed of 209 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:49:08] [INFO ] Deduced a trap composed of 178 places in 261 ms of which 5 ms to minimize.
[2024-05-28 14:49:08] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:49:14] [INFO ] Deduced a trap composed of 115 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:49:15] [INFO ] Deduced a trap composed of 188 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:49:16] [INFO ] Deduced a trap composed of 68 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:49:16] [INFO ] Deduced a trap composed of 99 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:49:17] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 52 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:49:20] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 53 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 17/17 constraints]
After SMT, in 44310ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 44323ms
[2024-05-28 14:49:38] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-28 14:49:38] [INFO ] Invariant cache hit.
[2024-05-28 14:49:39] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-28 14:49:39] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-28 14:49:39] [INFO ] Invariant cache hit.
[2024-05-28 14:49:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:49:42] [INFO ] Implicit Places using invariants and state equation in 3909 ms returned []
Implicit Place search using SMT with State Equation took 4370 ms to find 0 implicit places.
[2024-05-28 14:49:43] [INFO ] Redundant transitions in 94 ms returned []
Running 1248 sub problems to find dead transitions.
[2024-05-28 14:49:43] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-28 14:49:43] [INFO ] Invariant cache hit.
[2024-05-28 14:49:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:49:55] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 2 ms to minimize.
[2024-05-28 14:49:56] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:49:56] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:49:56] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:49:56] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:49:56] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:50:03] [INFO ] Deduced a trap composed of 190 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:50:03] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 2 ms to minimize.
[2024-05-28 14:50:04] [INFO ] Deduced a trap composed of 171 places in 205 ms of which 2 ms to minimize.
[2024-05-28 14:50:05] [INFO ] Deduced a trap composed of 198 places in 221 ms of which 4 ms to minimize.
[2024-05-28 14:50:05] [INFO ] Deduced a trap composed of 74 places in 238 ms of which 2 ms to minimize.
[2024-05-28 14:50:05] [INFO ] Deduced a trap composed of 99 places in 178 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:50:09] [INFO ] Deduced a trap composed of 180 places in 193 ms of which 2 ms to minimize.
[2024-05-28 14:50:16] [INFO ] Deduced a trap composed of 168 places in 246 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 50 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:50:18] [INFO ] Deduced a trap composed of 191 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:50:21] [INFO ] Deduced a trap composed of 185 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:50:21] [INFO ] Deduced a trap composed of 176 places in 240 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:50:32] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:50:33] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:50:33] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:50:35] [INFO ] Deduced a trap composed of 252 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:50:42] [INFO ] Deduced a trap composed of 188 places in 224 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 9)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 0)
(s255 0)
(s256 2)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 58 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 22/22 constraints]
After SMT, in 64183ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 64199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 424/544 places, 1252/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113145 ms. Remains : 424/544 places, 1252/1372 transitions.
Stuttering acceptance computed with spot in 449 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-00
Product exploration explored 100000 steps with 1352 reset in 694 ms.
Product exploration explored 100000 steps with 1353 reset in 441 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p3)), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p3) (NOT p2))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p3) (NOT p2))), (X (AND p0 (NOT p3))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT p3))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (AND p0 (NOT p3)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 199 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 347 steps (0 resets) in 20 ms. (16 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p3)), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p3) (NOT p2))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p3) (NOT p2))), (X (AND p0 (NOT p3))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT p3))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (AND p0 (NOT p3)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F p1), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F p3), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR p0 p2 p3)))]
Knowledge based reduction with 39 factoid took 802 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 52 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 1252/1252 transitions.
Applied a total of 0 rules in 45 ms. Remains 424 /424 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Running 1248 sub problems to find dead transitions.
[2024-05-28 14:50:50] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-28 14:50:50] [INFO ] Invariant cache hit.
[2024-05-28 14:50:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:51:02] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:51:02] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:51:02] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:51:02] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:51:02] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 0 ms to minimize.
[2024-05-28 14:51:03] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 0 ms to minimize.
[2024-05-28 14:51:09] [INFO ] Deduced a trap composed of 190 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:51:09] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 1 ms to minimize.
[2024-05-28 14:51:10] [INFO ] Deduced a trap composed of 171 places in 262 ms of which 4 ms to minimize.
[2024-05-28 14:51:11] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:51:11] [INFO ] Deduced a trap composed of 74 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:51:11] [INFO ] Deduced a trap composed of 99 places in 205 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 48 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:51:16] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-28 14:51:24] [INFO ] Deduced a trap composed of 168 places in 237 ms of which 4 ms to minimize.
[2024-05-28 14:51:25] [INFO ] Deduced a trap composed of 189 places in 242 ms of which 3 ms to minimize.
[2024-05-28 14:51:29] [INFO ] Deduced a trap composed of 217 places in 275 ms of which 3 ms to minimize.
[2024-05-28 14:51:30] [INFO ] Deduced a trap composed of 235 places in 282 ms of which 3 ms to minimize.
[2024-05-28 14:51:30] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 3 ms to minimize.
[2024-05-28 14:51:30] [INFO ] Deduced a trap composed of 222 places in 282 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 3)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 9)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 55 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 19/19 constraints]
After SMT, in 44085ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 44103ms
[2024-05-28 14:51:34] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-28 14:51:34] [INFO ] Invariant cache hit.
[2024-05-28 14:51:35] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-28 14:51:35] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-28 14:51:35] [INFO ] Invariant cache hit.
[2024-05-28 14:51:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:51:38] [INFO ] Implicit Places using invariants and state equation in 3817 ms returned []
Implicit Place search using SMT with State Equation took 4134 ms to find 0 implicit places.
[2024-05-28 14:51:38] [INFO ] Redundant transitions in 54 ms returned []
Running 1248 sub problems to find dead transitions.
[2024-05-28 14:51:39] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-28 14:51:39] [INFO ] Invariant cache hit.
[2024-05-28 14:51:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:51:51] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:51:52] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:51:52] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:51:52] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:51:52] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 2 ms to minimize.
[2024-05-28 14:51:52] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:51:58] [INFO ] Deduced a trap composed of 190 places in 269 ms of which 3 ms to minimize.
[2024-05-28 14:51:59] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:52:00] [INFO ] Deduced a trap composed of 171 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:52:00] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:52:01] [INFO ] Deduced a trap composed of 74 places in 268 ms of which 3 ms to minimize.
[2024-05-28 14:52:01] [INFO ] Deduced a trap composed of 99 places in 259 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:52:05] [INFO ] Deduced a trap composed of 180 places in 231 ms of which 2 ms to minimize.
[2024-05-28 14:52:11] [INFO ] Deduced a trap composed of 168 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:52:12] [INFO ] Deduced a trap composed of 188 places in 259 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 51 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:52:15] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 3 ms to minimize.
[2024-05-28 14:52:17] [INFO ] Deduced a trap composed of 253 places in 240 ms of which 3 ms to minimize.
[2024-05-28 14:52:17] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 3 ms to minimize.
[2024-05-28 14:52:17] [INFO ] Deduced a trap composed of 235 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:52:18] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 3 ms to minimize.
[2024-05-28 14:52:28] [INFO ] Deduced a trap composed of 207 places in 278 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 21/21 constraints]
After SMT, in 64811ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 64825ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113175 ms. Remains : 424/424 places, 1252/1252 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1) (NOT p2) (NOT p3))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (AND p0 (NOT p3))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 119 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 358 steps (0 resets) in 14 ms. (23 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1) (NOT p2) (NOT p3))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (AND p0 (NOT p3))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR p0 p2 p3 p1))), (F p2), (F p1), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p3)))), (F p3), (F (NOT (OR p0 p2 p3))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 39 factoid took 952 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1360 reset in 507 ms.
Product exploration explored 100000 steps with 1357 reset in 496 ms.
Built C files in :
/tmp/ltsmin5133694910066459374
[2024-05-28 14:52:47] [INFO ] Computing symmetric may disable matrix : 1252 transitions.
[2024-05-28 14:52:47] [INFO ] Computation of Complete disable matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:52:47] [INFO ] Computing symmetric may enable matrix : 1252 transitions.
[2024-05-28 14:52:47] [INFO ] Computation of Complete enable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:52:47] [INFO ] Computing Do-Not-Accords matrix : 1252 transitions.
[2024-05-28 14:52:47] [INFO ] Computation of Completed DNA matrix. took 61 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:52:47] [INFO ] Built C files in 511ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5133694910066459374
Running compilation step : cd /tmp/ltsmin5133694910066459374;'/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/ltsmin5133694910066459374;'/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/ltsmin5133694910066459374;'/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 52 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 1252/1252 transitions.
Applied a total of 0 rules in 56 ms. Remains 424 /424 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Running 1248 sub problems to find dead transitions.
[2024-05-28 14:52:50] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-28 14:52:50] [INFO ] Invariant cache hit.
[2024-05-28 14:52:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:53:02] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:53:02] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:53:03] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:53:03] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:53:03] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:53:03] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:53:10] [INFO ] Deduced a trap composed of 190 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:53:10] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:53:11] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:53:11] [INFO ] Deduced a trap composed of 198 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:53:12] [INFO ] Deduced a trap composed of 74 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:53:12] [INFO ] Deduced a trap composed of 99 places in 233 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 48 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:53:16] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:53:24] [INFO ] Deduced a trap composed of 168 places in 253 ms of which 3 ms to minimize.
[2024-05-28 14:53:25] [INFO ] Deduced a trap composed of 189 places in 267 ms of which 4 ms to minimize.
[2024-05-28 14:53:28] [INFO ] Deduced a trap composed of 217 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:53:29] [INFO ] Deduced a trap composed of 235 places in 297 ms of which 3 ms to minimize.
[2024-05-28 14:53:29] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:53:30] [INFO ] Deduced a trap composed of 222 places in 308 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 55 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 19/19 constraints]
After SMT, in 44445ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 44465ms
[2024-05-28 14:53:35] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-28 14:53:35] [INFO ] Invariant cache hit.
[2024-05-28 14:53:35] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-28 14:53:35] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-28 14:53:35] [INFO ] Invariant cache hit.
[2024-05-28 14:53:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:53:39] [INFO ] Implicit Places using invariants and state equation in 4163 ms returned []
Implicit Place search using SMT with State Equation took 4502 ms to find 0 implicit places.
[2024-05-28 14:53:39] [INFO ] Redundant transitions in 16 ms returned []
Running 1248 sub problems to find dead transitions.
[2024-05-28 14:53:39] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
[2024-05-28 14:53:39] [INFO ] Invariant cache hit.
[2024-05-28 14:53:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:53:51] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:53:52] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:53:52] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:53:52] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:53:52] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:53:52] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:53:58] [INFO ] Deduced a trap composed of 190 places in 234 ms of which 3 ms to minimize.
[2024-05-28 14:53:58] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 1 ms to minimize.
[2024-05-28 14:54:00] [INFO ] Deduced a trap composed of 171 places in 257 ms of which 3 ms to minimize.
[2024-05-28 14:54:00] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 3 ms to minimize.
[2024-05-28 14:54:01] [INFO ] Deduced a trap composed of 74 places in 263 ms of which 3 ms to minimize.
[2024-05-28 14:54:01] [INFO ] Deduced a trap composed of 99 places in 234 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:54:06] [INFO ] Deduced a trap composed of 180 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:54:12] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 2 ms to minimize.
[2024-05-28 14:54:13] [INFO ] Deduced a trap composed of 188 places in 241 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 10.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 51 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 14:54:16] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-28 14:54:18] [INFO ] Deduced a trap composed of 253 places in 269 ms of which 3 ms to minimize.
[2024-05-28 14:54:18] [INFO ] Deduced a trap composed of 178 places in 243 ms of which 3 ms to minimize.
[2024-05-28 14:54:19] [INFO ] Deduced a trap composed of 235 places in 257 ms of which 3 ms to minimize.
[2024-05-28 14:54:19] [INFO ] Deduced a trap composed of 232 places in 271 ms of which 3 ms to minimize.
[2024-05-28 14:54:29] [INFO ] Deduced a trap composed of 207 places in 236 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 21/21 constraints]
After SMT, in 64671ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 64683ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113733 ms. Remains : 424/424 places, 1252/1252 transitions.
Built C files in :
/tmp/ltsmin8693203688845802178
[2024-05-28 14:54:44] [INFO ] Computing symmetric may disable matrix : 1252 transitions.
[2024-05-28 14:54:44] [INFO ] Computation of Complete disable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:54:44] [INFO ] Computing symmetric may enable matrix : 1252 transitions.
[2024-05-28 14:54:44] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:54:44] [INFO ] Computing Do-Not-Accords matrix : 1252 transitions.
[2024-05-28 14:54:44] [INFO ] Computation of Completed DNA matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:54:44] [INFO ] Built C files in 504ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8693203688845802178
Running compilation step : cd /tmp/ltsmin8693203688845802178;'/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/ltsmin8693203688845802178;'/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/ltsmin8693203688845802178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 14:54:48] [INFO ] Flatten gal took : 84 ms
[2024-05-28 14:54:48] [INFO ] Flatten gal took : 100 ms
[2024-05-28 14:54:48] [INFO ] Time to serialize gal into /tmp/LTL8442436576444849904.gal : 18 ms
[2024-05-28 14:54:48] [INFO ] Time to serialize properties into /tmp/LTL15657258558149950235.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/LTL8442436576444849904.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4771509223128767177.hoa' '-atoms' '/tmp/LTL15657258558149950235.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/LTL15657258558149950235.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4771509223128767177.hoa
Detected timeout of ITS tools.
[2024-05-28 14:55:03] [INFO ] Flatten gal took : 77 ms
[2024-05-28 14:55:03] [INFO ] Flatten gal took : 68 ms
[2024-05-28 14:55:03] [INFO ] Time to serialize gal into /tmp/LTL10496642706633355947.gal : 17 ms
[2024-05-28 14:55:03] [INFO ] Time to serialize properties into /tmp/LTL105723992440411116.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10496642706633355947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL105723992440411116.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 : !(((G("(((((EnablePollingB_5<1)||(cPollingAbort<1))&&((EnablePollingB_1<1)||(cPollingAbort<1)))&&(((EnablePollingB_4<1)||(cPollingAbor...2040
Formula 0 simplified : F!"(((((EnablePollingB_5<1)||(cPollingAbort<1))&&((EnablePollingB_1<1)||(cPollingAbort<1)))&&(((EnablePollingB_4<1)||(cPollingAbort<...2034
Detected timeout of ITS tools.
[2024-05-28 14:55:18] [INFO ] Flatten gal took : 91 ms
[2024-05-28 14:55:18] [INFO ] Applying decomposition
[2024-05-28 14:55:18] [INFO ] Flatten gal took : 66 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/graph3029151883862802162.txt' '-o' '/tmp/graph3029151883862802162.bin' '-w' '/tmp/graph3029151883862802162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3029151883862802162.bin' '-l' '-1' '-v' '-w' '/tmp/graph3029151883862802162.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:55:18] [INFO ] Decomposing Gal with order
[2024-05-28 14:55:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:55:19] [INFO ] Removed a total of 552 redundant transitions.
[2024-05-28 14:55:19] [INFO ] Flatten gal took : 286 ms
[2024-05-28 14:55:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 717 labels/synchronizations in 39 ms.
[2024-05-28 14:55:19] [INFO ] Time to serialize gal into /tmp/LTL9521838929348957500.gal : 10 ms
[2024-05-28 14:55:19] [INFO ] Time to serialize properties into /tmp/LTL985391428856056018.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/LTL9521838929348957500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL985391428856056018.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...253
Read 1 LTL properties
Checking formula 0 : !(((G("(((((i7.i2.u1.EnablePollingB_5<1)||(i7.i2.u1.cPollingAbort<1))&&((i7.i2.u1.EnablePollingB_1<1)||(i7.i2.u1.cPollingAbort<1)))&&(...2718
Formula 0 simplified : F!"(((((i7.i2.u1.EnablePollingB_5<1)||(i7.i2.u1.cPollingAbort<1))&&((i7.i2.u1.EnablePollingB_1<1)||(i7.i2.u1.cPollingAbort<1)))&&(((...2712
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-00 finished in 400419 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 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
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 228 place count 430 transition count 1258
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 424 transition count 1252
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 424 transition count 1252
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 360 place count 364 transition count 1192
Applied a total of 360 rules in 149 ms. Remains 364 /544 variables (removed 180) and now considering 1192/1372 (removed 180) transitions.
Running 1188 sub problems to find dead transitions.
[2024-05-28 14:55:34] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
// Phase 1: matrix 1168 rows 364 cols
[2024-05-28 14:55:34] [INFO ] Computed 40 invariants in 38 ms
[2024-05-28 14:55:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-28 14:55:44] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:55:44] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:55:44] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 3 ms to minimize.
[2024-05-28 14:55:44] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:55:44] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:55:45] [INFO ] Deduced a trap composed of 155 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:55:45] [INFO ] Deduced a trap composed of 165 places in 271 ms of which 2 ms to minimize.
[2024-05-28 14:55:45] [INFO ] Deduced a trap composed of 209 places in 291 ms of which 2 ms to minimize.
[2024-05-28 14:55:46] [INFO ] Deduced a trap composed of 151 places in 365 ms of which 2 ms to minimize.
[2024-05-28 14:55:46] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:55:47] [INFO ] Deduced a trap composed of 178 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:55:48] [INFO ] Deduced a trap composed of 170 places in 300 ms of which 3 ms to minimize.
[2024-05-28 14:55:48] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 3 ms to minimize.
[2024-05-28 14:55:53] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 1 ms to minimize.
[2024-05-28 14:55:55] [INFO ] Deduced a trap composed of 92 places in 219 ms of which 3 ms to minimize.
[2024-05-28 14:55:56] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 52 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-28 14:56:09] [INFO ] Deduced a trap composed of 120 places in 229 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1532 variables, and 53 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 17/17 constraints]
After SMT, in 44516ms problems are : Problem set: 0 solved, 1188 unsolved
Search for dead transitions found 0 dead transitions in 44530ms
[2024-05-28 14:56:19] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-28 14:56:19] [INFO ] Invariant cache hit.
[2024-05-28 14:56:19] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-28 14:56:19] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-28 14:56:19] [INFO ] Invariant cache hit.
[2024-05-28 14:56:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:56:32] [INFO ] Implicit Places using invariants and state equation in 13039 ms returned []
Implicit Place search using SMT with State Equation took 13426 ms to find 0 implicit places.
[2024-05-28 14:56:32] [INFO ] Redundant transitions in 20 ms returned []
Running 1188 sub problems to find dead transitions.
[2024-05-28 14:56:32] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-28 14:56:32] [INFO ] Invariant cache hit.
[2024-05-28 14:56:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-28 14:56:42] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:56:42] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:56:42] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:56:43] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:56:43] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 0 ms to minimize.
[2024-05-28 14:56:43] [INFO ] Deduced a trap composed of 168 places in 291 ms of which 3 ms to minimize.
[2024-05-28 14:56:43] [INFO ] Deduced a trap composed of 177 places in 293 ms of which 3 ms to minimize.
[2024-05-28 14:56:44] [INFO ] Deduced a trap composed of 183 places in 274 ms of which 3 ms to minimize.
[2024-05-28 14:56:44] [INFO ] Deduced a trap composed of 156 places in 238 ms of which 2 ms to minimize.
[2024-05-28 14:56:44] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:56:45] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:56:52] [INFO ] Deduced a trap composed of 145 places in 232 ms of which 2 ms to minimize.
[2024-05-28 14:56:52] [INFO ] Deduced a trap composed of 103 places in 228 ms of which 2 ms to minimize.
[2024-05-28 14:56:53] [INFO ] Deduced a trap composed of 153 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:56:53] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 3 ms to minimize.
[2024-05-28 14:56:54] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-28 14:56:56] [INFO ] Deduced a trap composed of 178 places in 221 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 53 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 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 TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 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 TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/54 constraints. Problems are: Problem set: 90 solved, 1098 unsolved
[2024-05-28 14:57:29] [INFO ] Deduced a trap composed of 120 places in 256 ms of which 3 ms to minimize.
[2024-05-28 14:57:30] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 3 ms to minimize.
[2024-05-28 14:57:30] [INFO ] Deduced a trap composed of 57 places in 253 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 3/57 constraints. Problems are: Problem set: 90 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1532 variables, and 57 constraints, problems are : Problem set: 90 solved, 1098 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 20/20 constraints]
After SMT, in 64365ms problems are : Problem set: 90 solved, 1098 unsolved
Search for dead transitions found 90 dead transitions in 64384ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 364/544 places, 1102/1372 transitions.
Applied a total of 0 rules in 16 ms. Remains 364 /364 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
[2024-05-28 14:57:36] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 122553 ms. Remains : 364/544 places, 1102/1372 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-02
Product exploration explored 100000 steps with 3052 reset in 552 ms.
Product exploration explored 100000 steps with 3073 reset in 602 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 123 steps (0 resets) in 6 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:57:38] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
// Phase 1: matrix 1078 rows 364 cols
[2024-05-28 14:57:38] [INFO ] Computed 40 invariants in 30 ms
[2024-05-28 14:57:39] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 14:57:39] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 130 ms returned sat
[2024-05-28 14:57:40] [INFO ] [Real]Absence check using state equation in 1073 ms returned sat
[2024-05-28 14:57:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:57:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-28 14:57:41] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 32 ms returned sat
[2024-05-28 14:57:42] [INFO ] [Nat]Absence check using state equation in 1576 ms returned sat
[2024-05-28 14:57:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:57:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:57:44] [INFO ] [Nat]Added 120 Read/Feed constraints in 1671 ms returned sat
[2024-05-28 14:57:44] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 2 ms to minimize.
[2024-05-28 14:57:45] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 2 ms to minimize.
[2024-05-28 14:57:45] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 2 ms to minimize.
[2024-05-28 14:57:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1358 ms
[2024-05-28 14:57:45] [INFO ] Computed and/alt/rep : 678/3031/660 causal constraints (skipped 414 transitions) in 115 ms.
[2024-05-28 14:57:48] [INFO ] Added : 106 causal constraints over 22 iterations in 2962 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 1102/1102 transitions.
Applied a total of 0 rules in 34 ms. Remains 364 /364 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-28 14:57:48] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-28 14:57:48] [INFO ] Invariant cache hit.
[2024-05-28 14:57:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 14:57:57] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
[2024-05-28 14:57:57] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:57:57] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:57:57] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 0 ms to minimize.
[2024-05-28 14:57:57] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:57:57] [INFO ] Deduced a trap composed of 151 places in 207 ms of which 2 ms to minimize.
[2024-05-28 14:57:57] [INFO ] Deduced a trap composed of 148 places in 283 ms of which 3 ms to minimize.
[2024-05-28 14:57:58] [INFO ] Deduced a trap composed of 202 places in 267 ms of which 2 ms to minimize.
[2024-05-28 14:57:58] [INFO ] Deduced a trap composed of 156 places in 251 ms of which 2 ms to minimize.
[2024-05-28 14:57:59] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:57:59] [INFO ] Deduced a trap composed of 138 places in 260 ms of which 2 ms to minimize.
[2024-05-28 14:58:01] [INFO ] Deduced a trap composed of 183 places in 241 ms of which 2 ms to minimize.
[2024-05-28 14:58:05] [INFO ] Deduced a trap composed of 186 places in 261 ms of which 3 ms to minimize.
[2024-05-28 14:58:06] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 2 ms to minimize.
[2024-05-28 14:58:06] [INFO ] Deduced a trap composed of 120 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:58:07] [INFO ] Deduced a trap composed of 104 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 14:58:09] [INFO ] Deduced a trap composed of 144 places in 273 ms of which 2 ms to minimize.
[2024-05-28 14:58:09] [INFO ] Deduced a trap composed of 132 places in 220 ms of which 2 ms to minimize.
[2024-05-28 14:58:09] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 2 ms to minimize.
[2024-05-28 14:58:10] [INFO ] Deduced a trap composed of 178 places in 241 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1442 variables, and 56 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 14:58:15] [INFO ] Deduced a trap composed of 182 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:58:15] [INFO ] Deduced a trap composed of 191 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:58:15] [INFO ] Deduced a trap composed of 191 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:58:16] [INFO ] Deduced a trap composed of 200 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:58:16] [INFO ] Deduced a trap composed of 182 places in 244 ms of which 2 ms to minimize.
[2024-05-28 14:58:16] [INFO ] Deduced a trap composed of 182 places in 287 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 14:58:31] [INFO ] Deduced a trap composed of 182 places in 272 ms of which 2 ms to minimize.
[2024-05-28 14:58:31] [INFO ] Deduced a trap composed of 191 places in 262 ms of which 2 ms to minimize.
[2024-05-28 14:58:31] [INFO ] Deduced a trap composed of 177 places in 260 ms of which 3 ms to minimize.
[2024-05-28 14:58:31] [INFO ] Deduced a trap composed of 189 places in 275 ms of which 3 ms to minimize.
SMT process timed out in 43123ms, After SMT, problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 43141ms
[2024-05-28 14:58:31] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-28 14:58:31] [INFO ] Invariant cache hit.
[2024-05-28 14:58:32] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-28 14:58:32] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-28 14:58:32] [INFO ] Invariant cache hit.
[2024-05-28 14:58:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:58:37] [INFO ] Implicit Places using invariants and state equation in 5594 ms returned []
Implicit Place search using SMT with State Equation took 5951 ms to find 0 implicit places.
[2024-05-28 14:58:37] [INFO ] Redundant transitions in 19 ms returned []
Running 1098 sub problems to find dead transitions.
[2024-05-28 14:58:37] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-28 14:58:37] [INFO ] Invariant cache hit.
[2024-05-28 14:58:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 14:58:46] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:58:46] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:58:47] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:58:47] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:58:47] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:58:47] [INFO ] Deduced a trap composed of 151 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:58:47] [INFO ] Deduced a trap composed of 148 places in 299 ms of which 3 ms to minimize.
[2024-05-28 14:58:48] [INFO ] Deduced a trap composed of 202 places in 270 ms of which 3 ms to minimize.
[2024-05-28 14:58:48] [INFO ] Deduced a trap composed of 156 places in 270 ms of which 3 ms to minimize.
[2024-05-28 14:58:48] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:58:49] [INFO ] Deduced a trap composed of 138 places in 246 ms of which 2 ms to minimize.
[2024-05-28 14:58:51] [INFO ] Deduced a trap composed of 183 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:58:56] [INFO ] Deduced a trap composed of 186 places in 267 ms of which 3 ms to minimize.
[2024-05-28 14:58:57] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:58:57] [INFO ] Deduced a trap composed of 120 places in 237 ms of which 2 ms to minimize.
[2024-05-28 14:58:58] [INFO ] Deduced a trap composed of 104 places in 218 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 14:58:59] [INFO ] Deduced a trap composed of 144 places in 225 ms of which 2 ms to minimize.
[2024-05-28 14:59:00] [INFO ] Deduced a trap composed of 132 places in 221 ms of which 2 ms to minimize.
[2024-05-28 14:59:00] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 2 ms to minimize.
[2024-05-28 14:59:01] [INFO ] Deduced a trap composed of 178 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1442 variables, and 56 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 14:59:14] [INFO ] Deduced a trap composed of 182 places in 265 ms of which 3 ms to minimize.
[2024-05-28 14:59:14] [INFO ] Deduced a trap composed of 191 places in 282 ms of which 3 ms to minimize.
[2024-05-28 14:59:14] [INFO ] Deduced a trap composed of 191 places in 266 ms of which 3 ms to minimize.
[2024-05-28 14:59:15] [INFO ] Deduced a trap composed of 200 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:59:15] [INFO ] Deduced a trap composed of 182 places in 263 ms of which 3 ms to minimize.
[2024-05-28 14:59:15] [INFO ] Deduced a trap composed of 182 places in 251 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 14:59:31] [INFO ] Deduced a trap composed of 182 places in 272 ms of which 3 ms to minimize.
[2024-05-28 14:59:31] [INFO ] Deduced a trap composed of 191 places in 275 ms of which 3 ms to minimize.
[2024-05-28 14:59:31] [INFO ] Deduced a trap composed of 177 places in 275 ms of which 2 ms to minimize.
[2024-05-28 14:59:31] [INFO ] Deduced a trap composed of 189 places in 248 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1442 variables, and 66 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 30/30 constraints]
After SMT, in 62954ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 62972ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112135 ms. Remains : 364/364 places, 1102/1102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 155 steps (0 resets) in 7 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:59:41] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-28 14:59:41] [INFO ] Invariant cache hit.
[2024-05-28 14:59:41] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 14:59:42] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 158 ms returned sat
[2024-05-28 14:59:43] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2024-05-28 14:59:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:59:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-28 14:59:43] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 37 ms returned sat
[2024-05-28 14:59:44] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2024-05-28 14:59:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:59:44] [INFO ] [Nat]Added 120 Read/Feed constraints in 105 ms returned sat
[2024-05-28 14:59:44] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:59:45] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 2 ms to minimize.
[2024-05-28 14:59:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 593 ms
[2024-05-28 14:59:45] [INFO ] Computed and/alt/rep : 678/3031/660 causal constraints (skipped 414 transitions) in 72 ms.
[2024-05-28 14:59:47] [INFO ] Added : 135 causal constraints over 27 iterations in 2681 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3081 reset in 582 ms.
Product exploration explored 100000 steps with 3091 reset in 570 ms.
Built C files in :
/tmp/ltsmin4327545610099341094
[2024-05-28 14:59:49] [INFO ] Computing symmetric may disable matrix : 1102 transitions.
[2024-05-28 14:59:49] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:59:49] [INFO ] Computing symmetric may enable matrix : 1102 transitions.
[2024-05-28 14:59:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:59:49] [INFO ] Computing Do-Not-Accords matrix : 1102 transitions.
[2024-05-28 14:59:49] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:59:49] [INFO ] Built C files in 235ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4327545610099341094
Running compilation step : cd /tmp/ltsmin4327545610099341094;'/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/ltsmin4327545610099341094;'/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/ltsmin4327545610099341094;'/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 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 1102/1102 transitions.
Applied a total of 0 rules in 38 ms. Remains 364 /364 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-28 14:59:52] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-28 14:59:52] [INFO ] Invariant cache hit.
[2024-05-28 14:59:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 15:00:01] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:00:01] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 5 ms to minimize.
[2024-05-28 15:00:01] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:00:01] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:00:01] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:00:01] [INFO ] Deduced a trap composed of 151 places in 245 ms of which 2 ms to minimize.
[2024-05-28 15:00:02] [INFO ] Deduced a trap composed of 148 places in 266 ms of which 3 ms to minimize.
[2024-05-28 15:00:02] [INFO ] Deduced a trap composed of 202 places in 243 ms of which 3 ms to minimize.
[2024-05-28 15:00:02] [INFO ] Deduced a trap composed of 156 places in 240 ms of which 2 ms to minimize.
[2024-05-28 15:00:03] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:00:03] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 2 ms to minimize.
[2024-05-28 15:00:05] [INFO ] Deduced a trap composed of 183 places in 205 ms of which 2 ms to minimize.
[2024-05-28 15:00:10] [INFO ] Deduced a trap composed of 186 places in 207 ms of which 3 ms to minimize.
[2024-05-28 15:00:11] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-05-28 15:00:11] [INFO ] Deduced a trap composed of 120 places in 173 ms of which 2 ms to minimize.
[2024-05-28 15:00:12] [INFO ] Deduced a trap composed of 104 places in 220 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 15:00:13] [INFO ] Deduced a trap composed of 144 places in 258 ms of which 3 ms to minimize.
[2024-05-28 15:00:14] [INFO ] Deduced a trap composed of 132 places in 239 ms of which 2 ms to minimize.
[2024-05-28 15:00:14] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1442 variables, and 55 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 6 (OVERLAPS) 3/364 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1442 variables, and 59 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 19/19 constraints]
After SMT, in 43109ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 43129ms
[2024-05-28 15:00:35] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-28 15:00:35] [INFO ] Invariant cache hit.
[2024-05-28 15:00:35] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-28 15:00:35] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-28 15:00:35] [INFO ] Invariant cache hit.
[2024-05-28 15:00:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:00:42] [INFO ] Implicit Places using invariants and state equation in 6468 ms returned []
Implicit Place search using SMT with State Equation took 6821 ms to find 0 implicit places.
[2024-05-28 15:00:42] [INFO ] Redundant transitions in 14 ms returned []
Running 1098 sub problems to find dead transitions.
[2024-05-28 15:00:42] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-28 15:00:42] [INFO ] Invariant cache hit.
[2024-05-28 15:00:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 15:00:51] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:00:51] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:00:51] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:00:51] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:00:51] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:00:51] [INFO ] Deduced a trap composed of 151 places in 270 ms of which 2 ms to minimize.
[2024-05-28 15:00:51] [INFO ] Deduced a trap composed of 148 places in 226 ms of which 3 ms to minimize.
[2024-05-28 15:00:52] [INFO ] Deduced a trap composed of 202 places in 249 ms of which 2 ms to minimize.
[2024-05-28 15:00:52] [INFO ] Deduced a trap composed of 156 places in 241 ms of which 3 ms to minimize.
[2024-05-28 15:00:52] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:00:53] [INFO ] Deduced a trap composed of 138 places in 233 ms of which 3 ms to minimize.
[2024-05-28 15:00:55] [INFO ] Deduced a trap composed of 183 places in 231 ms of which 3 ms to minimize.
[2024-05-28 15:01:00] [INFO ] Deduced a trap composed of 186 places in 284 ms of which 3 ms to minimize.
[2024-05-28 15:01:01] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 1 ms to minimize.
[2024-05-28 15:01:01] [INFO ] Deduced a trap composed of 120 places in 208 ms of which 3 ms to minimize.
[2024-05-28 15:01:02] [INFO ] Deduced a trap composed of 104 places in 212 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 15:01:03] [INFO ] Deduced a trap composed of 144 places in 243 ms of which 3 ms to minimize.
[2024-05-28 15:01:03] [INFO ] Deduced a trap composed of 132 places in 238 ms of which 2 ms to minimize.
[2024-05-28 15:01:03] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 2 ms to minimize.
[2024-05-28 15:01:05] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1442 variables, and 56 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 15:01:19] [INFO ] Deduced a trap composed of 182 places in 266 ms of which 2 ms to minimize.
[2024-05-28 15:01:19] [INFO ] Deduced a trap composed of 191 places in 244 ms of which 2 ms to minimize.
[2024-05-28 15:01:19] [INFO ] Deduced a trap composed of 191 places in 242 ms of which 2 ms to minimize.
[2024-05-28 15:01:20] [INFO ] Deduced a trap composed of 200 places in 217 ms of which 2 ms to minimize.
[2024-05-28 15:01:20] [INFO ] Deduced a trap composed of 182 places in 229 ms of which 2 ms to minimize.
[2024-05-28 15:01:20] [INFO ] Deduced a trap composed of 182 places in 248 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 15:01:36] [INFO ] Deduced a trap composed of 182 places in 276 ms of which 3 ms to minimize.
[2024-05-28 15:01:36] [INFO ] Deduced a trap composed of 191 places in 272 ms of which 2 ms to minimize.
[2024-05-28 15:01:36] [INFO ] Deduced a trap composed of 177 places in 225 ms of which 2 ms to minimize.
[2024-05-28 15:01:36] [INFO ] Deduced a trap composed of 189 places in 208 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1442 variables, and 66 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 30/30 constraints]
After SMT, in 63305ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 63319ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113338 ms. Remains : 364/364 places, 1102/1102 transitions.
Built C files in :
/tmp/ltsmin2177037665853717796
[2024-05-28 15:01:45] [INFO ] Computing symmetric may disable matrix : 1102 transitions.
[2024-05-28 15:01:45] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:01:45] [INFO ] Computing symmetric may enable matrix : 1102 transitions.
[2024-05-28 15:01:45] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:01:45] [INFO ] Computing Do-Not-Accords matrix : 1102 transitions.
[2024-05-28 15:01:45] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:01:45] [INFO ] Built C files in 339ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2177037665853717796
Running compilation step : cd /tmp/ltsmin2177037665853717796;'/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/ltsmin2177037665853717796;'/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/ltsmin2177037665853717796;'/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:01:49] [INFO ] Flatten gal took : 68 ms
[2024-05-28 15:01:49] [INFO ] Flatten gal took : 54 ms
[2024-05-28 15:01:49] [INFO ] Time to serialize gal into /tmp/LTL14006974366786395591.gal : 8 ms
[2024-05-28 15:01:49] [INFO ] Time to serialize properties into /tmp/LTL8281562774412625600.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/LTL14006974366786395591.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3586468236937635232.hoa' '-atoms' '/tmp/LTL8281562774412625600.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/LTL8281562774412625600.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3586468236937635232.hoa
Detected timeout of ITS tools.
[2024-05-28 15:02:04] [INFO ] Flatten gal took : 52 ms
[2024-05-28 15:02:04] [INFO ] Flatten gal took : 77 ms
[2024-05-28 15:02:04] [INFO ] Time to serialize gal into /tmp/LTL3826466042594133217.gal : 9 ms
[2024-05-28 15:02:04] [INFO ] Time to serialize properties into /tmp/LTL10604692942815104372.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/LTL3826466042594133217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10604692942815104372.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("((((((((P_1725_3>=1)&&(MarkerRead>=1))&&(FetchJobB_4>=1))||(((P_1725_3>=1)&&(MarkerRead>=1))&&(FetchJobB_3>=1)))||((((P_1725_3...1710
Formula 0 simplified : FG!"((((((((P_1725_3>=1)&&(MarkerRead>=1))&&(FetchJobB_4>=1))||(((P_1725_3>=1)&&(MarkerRead>=1))&&(FetchJobB_3>=1)))||((((P_1725_3>=...1704
Detected timeout of ITS tools.
[2024-05-28 15:02:19] [INFO ] Flatten gal took : 50 ms
[2024-05-28 15:02:19] [INFO ] Applying decomposition
[2024-05-28 15:02:19] [INFO ] Flatten gal took : 43 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/graph3189231352566562.txt' '-o' '/tmp/graph3189231352566562.bin' '-w' '/tmp/graph3189231352566562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3189231352566562.bin' '-l' '-1' '-v' '-w' '/tmp/graph3189231352566562.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:02:19] [INFO ] Decomposing Gal with order
[2024-05-28 15:02:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:02:19] [INFO ] Removed a total of 754 redundant transitions.
[2024-05-28 15:02:19] [INFO ] Flatten gal took : 79 ms
[2024-05-28 15:02:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 303 labels/synchronizations in 17 ms.
[2024-05-28 15:02:19] [INFO ] Time to serialize gal into /tmp/LTL5324545118913889413.gal : 8 ms
[2024-05-28 15:02:19] [INFO ] Time to serialize properties into /tmp/LTL1299018392932115248.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/LTL5324545118913889413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1299018392932115248.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((i1.u3.P_1725_3>=1)&&(i2.u4.MarkerRead>=1))&&(i2.u4.FetchJobB_4>=1))||(((i1.u3.P_1725_3>=1)&&(i2.u4.MarkerRead>=1))&&(i...2250
Formula 0 simplified : FG!"((((((((i1.u3.P_1725_3>=1)&&(i2.u4.MarkerRead>=1))&&(i2.u4.FetchJobB_4>=1))||(((i1.u3.P_1725_3>=1)&&(i2.u4.MarkerRead>=1))&&(i2....2244
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-02 finished in 420413 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' '!((p0 U G(!p1)))'
Support contains 13 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
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 544 transition count 1336
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 508 transition count 1330
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 502 transition count 1330
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 84 place count 502 transition count 1264
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 216 place count 436 transition count 1264
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 430 transition count 1258
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 430 transition count 1258
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 324 place count 382 transition count 1210
Applied a total of 324 rules in 94 ms. Remains 382 /544 variables (removed 162) and now considering 1210/1372 (removed 162) transitions.
Running 1206 sub problems to find dead transitions.
[2024-05-28 15:02:34] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
// Phase 1: matrix 1186 rows 382 cols
[2024-05-28 15:02:34] [INFO ] Computed 40 invariants in 25 ms
[2024-05-28 15:02:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:02:45] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:02:45] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:02:45] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:02:45] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:02:45] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:02:46] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 2 ms to minimize.
[2024-05-28 15:02:46] [INFO ] Deduced a trap composed of 169 places in 199 ms of which 2 ms to minimize.
[2024-05-28 15:02:46] [INFO ] Deduced a trap composed of 183 places in 192 ms of which 2 ms to minimize.
[2024-05-28 15:02:46] [INFO ] Deduced a trap composed of 163 places in 226 ms of which 3 ms to minimize.
[2024-05-28 15:02:47] [INFO ] Deduced a trap composed of 168 places in 297 ms of which 2 ms to minimize.
[2024-05-28 15:02:48] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 5 ms to minimize.
[2024-05-28 15:02:48] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:02:57] [INFO ] Deduced a trap composed of 155 places in 234 ms of which 3 ms to minimize.
[2024-05-28 15:02:57] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 3 ms to minimize.
[2024-05-28 15:02:58] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 51 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:03:03] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:03:03] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:03:15] [INFO ] Deduced a trap composed of 190 places in 211 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 54 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 18/18 constraints]
After SMT, in 44135ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 44150ms
[2024-05-28 15:03:19] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 15:03:19] [INFO ] Invariant cache hit.
[2024-05-28 15:03:19] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-28 15:03:19] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 15:03:19] [INFO ] Invariant cache hit.
[2024-05-28 15:03:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:03:23] [INFO ] Implicit Places using invariants and state equation in 4283 ms returned []
Implicit Place search using SMT with State Equation took 4596 ms to find 0 implicit places.
[2024-05-28 15:03:23] [INFO ] Redundant transitions in 22 ms returned []
Running 1206 sub problems to find dead transitions.
[2024-05-28 15:03:23] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 15:03:23] [INFO ] Invariant cache hit.
[2024-05-28 15:03:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:03:35] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2024-05-28 15:03:35] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2024-05-28 15:03:35] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:03:35] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:03:35] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:03:36] [INFO ] Deduced a trap composed of 167 places in 272 ms of which 3 ms to minimize.
[2024-05-28 15:03:36] [INFO ] Deduced a trap composed of 163 places in 295 ms of which 3 ms to minimize.
[2024-05-28 15:03:36] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 3 ms to minimize.
[2024-05-28 15:03:37] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 3 ms to minimize.
[2024-05-28 15:03:37] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 2 ms to minimize.
[2024-05-28 15:03:37] [INFO ] Deduced a trap composed of 154 places in 279 ms of which 3 ms to minimize.
[2024-05-28 15:03:38] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:03:46] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 49 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:04:01] [INFO ] Deduced a trap composed of 190 places in 224 ms of which 2 ms to minimize.
[2024-05-28 15:04:06] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 2 ms to minimize.
[2024-05-28 15:04:06] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
[2024-05-28 15:04:10] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:04:18] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 1 ms to minimize.
[2024-05-28 15:04:22] [INFO ] Deduced a trap composed of 71 places in 222 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 55 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 19/19 constraints]
After SMT, in 64118ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 64136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 382/544 places, 1210/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113013 ms. Remains : 382/544 places, 1210/1372 transitions.
Stuttering acceptance computed with spot in 98 ms :[p1, true, p1]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 65 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-04 finished in 113133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(!p1 U (p2||G(!p1)))))'
Support contains 20 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 31 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 15:04:28] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 15:04:28] [INFO ] Computed 40 invariants in 25 ms
[2024-05-28 15:04:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 15:04:41] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:04:41] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 1 ms to minimize.
[2024-05-28 15:04:42] [INFO ] Deduced a trap composed of 74 places in 298 ms of which 3 ms to minimize.
[2024-05-28 15:04:42] [INFO ] Deduced a trap composed of 157 places in 268 ms of which 4 ms to minimize.
[2024-05-28 15:04:43] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:04:44] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:04:45] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:04:48] [INFO ] Deduced a trap composed of 279 places in 273 ms of which 3 ms to minimize.
[2024-05-28 15:04:49] [INFO ] Deduced a trap composed of 315 places in 327 ms of which 4 ms to minimize.
[2024-05-28 15:04:49] [INFO ] Deduced a trap composed of 303 places in 330 ms of which 4 ms to minimize.
[2024-05-28 15:04:49] [INFO ] Deduced a trap composed of 301 places in 359 ms of which 4 ms to minimize.
[2024-05-28 15:04:50] [INFO ] Deduced a trap composed of 330 places in 349 ms of which 3 ms to minimize.
[2024-05-28 15:04:50] [INFO ] Deduced a trap composed of 326 places in 358 ms of which 4 ms to minimize.
[2024-05-28 15:04:50] [INFO ] Deduced a trap composed of 297 places in 372 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 50 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 15:04:54] [INFO ] Deduced a trap composed of 259 places in 241 ms of which 3 ms to minimize.
[2024-05-28 15:05:08] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-05-28 15:05:08] [INFO ] Deduced a trap composed of 61 places in 328 ms of which 3 ms to minimize.
[2024-05-28 15:05:09] [INFO ] Deduced a trap composed of 277 places in 318 ms of which 4 ms to minimize.
[2024-05-28 15:05:09] [INFO ] Deduced a trap composed of 41 places in 277 ms of which 4 ms to minimize.
[2024-05-28 15:05:10] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 56 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 20/20 constraints]
After SMT, in 44446ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44465ms
[2024-05-28 15:05:12] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 15:05:12] [INFO ] Invariant cache hit.
[2024-05-28 15:05:12] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-28 15:05:12] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 15:05:12] [INFO ] Invariant cache hit.
[2024-05-28 15:05:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:05:19] [INFO ] Implicit Places using invariants and state equation in 6315 ms returned []
Implicit Place search using SMT with State Equation took 6600 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-28 15:05:19] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 15:05:19] [INFO ] Invariant cache hit.
[2024-05-28 15:05:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 15:05:34] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:05:34] [INFO ] Deduced a trap composed of 74 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:05:34] [INFO ] Deduced a trap composed of 74 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:05:35] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 3 ms to minimize.
[2024-05-28 15:05:35] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:05:35] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:05:37] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:05:39] [INFO ] Deduced a trap composed of 279 places in 297 ms of which 4 ms to minimize.
[2024-05-28 15:05:39] [INFO ] Deduced a trap composed of 299 places in 286 ms of which 4 ms to minimize.
[2024-05-28 15:05:39] [INFO ] Deduced a trap composed of 369 places in 314 ms of which 4 ms to minimize.
[2024-05-28 15:05:40] [INFO ] Deduced a trap composed of 291 places in 238 ms of which 2 ms to minimize.
[2024-05-28 15:05:49] [INFO ] Deduced a trap composed of 149 places in 250 ms of which 4 ms to minimize.
[2024-05-28 15:05:52] [INFO ] Deduced a trap composed of 319 places in 227 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 49 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 15:06:00] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:06:07] [INFO ] Deduced a trap composed of 280 places in 292 ms of which 4 ms to minimize.
[2024-05-28 15:06:12] [INFO ] Deduced a trap composed of 98 places in 323 ms of which 4 ms to minimize.
[2024-05-28 15:06:12] [INFO ] Deduced a trap composed of 248 places in 233 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 15:06:16] [INFO ] Deduced a trap composed of 267 places in 290 ms of which 4 ms to minimize.
[2024-05-28 15:06:17] [INFO ] Deduced a trap composed of 305 places in 259 ms of which 3 ms to minimize.
[2024-05-28 15:06:17] [INFO ] Deduced a trap composed of 309 places in 251 ms of which 4 ms to minimize.
[2024-05-28 15:06:23] [INFO ] Deduced a trap composed of 312 places in 285 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 57 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 21/21 constraints]
After SMT, in 64395ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 64416ms
Starting structural reductions in LTL mode, iteration 1 : 532/544 places, 1360/1372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115522 ms. Remains : 532/544 places, 1360/1372 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-06 finished in 115643 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 6 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
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 544 transition count 1330
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 502 transition count 1330
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 502 transition count 1270
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 204 place count 442 transition count 1270
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 324 place count 382 transition count 1210
Applied a total of 324 rules in 40 ms. Remains 382 /544 variables (removed 162) and now considering 1210/1372 (removed 162) transitions.
Running 1206 sub problems to find dead transitions.
[2024-05-28 15:06:23] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
// Phase 1: matrix 1186 rows 382 cols
[2024-05-28 15:06:23] [INFO ] Computed 40 invariants in 13 ms
[2024-05-28 15:06:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:06:34] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:06:34] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:06:34] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:06:34] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:06:34] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:06:35] [INFO ] Deduced a trap composed of 192 places in 258 ms of which 3 ms to minimize.
[2024-05-28 15:06:35] [INFO ] Deduced a trap composed of 173 places in 253 ms of which 2 ms to minimize.
[2024-05-28 15:06:35] [INFO ] Deduced a trap composed of 176 places in 278 ms of which 3 ms to minimize.
[2024-05-28 15:06:36] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 2 ms to minimize.
[2024-05-28 15:06:36] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 46 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:06:49] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-28 15:06:59] [INFO ] Deduced a trap composed of 160 places in 248 ms of which 2 ms to minimize.
[2024-05-28 15:06:59] [INFO ] Deduced a trap composed of 128 places in 231 ms of which 3 ms to minimize.
[2024-05-28 15:06:59] [INFO ] Deduced a trap composed of 132 places in 217 ms of which 2 ms to minimize.
[2024-05-28 15:07:00] [INFO ] Deduced a trap composed of 110 places in 267 ms of which 3 ms to minimize.
[2024-05-28 15:07:00] [INFO ] Deduced a trap composed of 224 places in 226 ms of which 3 ms to minimize.
[2024-05-28 15:07:01] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:07:04] [INFO ] Deduced a trap composed of 190 places in 226 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 54 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 18/18 constraints]
After SMT, in 44495ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 44507ms
[2024-05-28 15:07:08] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 15:07:08] [INFO ] Invariant cache hit.
[2024-05-28 15:07:08] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-28 15:07:08] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 15:07:08] [INFO ] Invariant cache hit.
[2024-05-28 15:07:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:07:13] [INFO ] Implicit Places using invariants and state equation in 5475 ms returned []
Implicit Place search using SMT with State Equation took 5731 ms to find 0 implicit places.
[2024-05-28 15:07:13] [INFO ] Redundant transitions in 23 ms returned []
Running 1206 sub problems to find dead transitions.
[2024-05-28 15:07:13] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 15:07:13] [INFO ] Invariant cache hit.
[2024-05-28 15:07:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:07:24] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:07:24] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-05-28 15:07:24] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 0 ms to minimize.
[2024-05-28 15:07:25] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 0 ms to minimize.
[2024-05-28 15:07:25] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:07:25] [INFO ] Deduced a trap composed of 168 places in 246 ms of which 2 ms to minimize.
[2024-05-28 15:07:25] [INFO ] Deduced a trap composed of 157 places in 227 ms of which 2 ms to minimize.
[2024-05-28 15:07:25] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 3 ms to minimize.
[2024-05-28 15:07:26] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 2 ms to minimize.
[2024-05-28 15:07:26] [INFO ] Deduced a trap composed of 181 places in 255 ms of which 2 ms to minimize.
[2024-05-28 15:07:26] [INFO ] Deduced a trap composed of 163 places in 364 ms of which 3 ms to minimize.
[2024-05-28 15:07:27] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 1 ms to minimize.
[2024-05-28 15:07:37] [INFO ] Deduced a trap composed of 133 places in 280 ms of which 3 ms to minimize.
[2024-05-28 15:07:37] [INFO ] Deduced a trap composed of 197 places in 228 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:07:48] [INFO ] Deduced a trap composed of 167 places in 255 ms of which 3 ms to minimize.
SMT process timed out in 34385ms, After SMT, problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 34405ms
Starting structural reductions in SI_LTL mode, iteration 1 : 382/544 places, 1210/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84719 ms. Remains : 382/544 places, 1210/1372 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-07
Product exploration explored 100000 steps with 1473 reset in 437 ms.
Product exploration explored 100000 steps with 1480 reset in 350 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 277 steps (0 resets) in 7 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-28 15:07:49] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 15:07:49] [INFO ] Invariant cache hit.
[2024-05-28 15:07:50] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-28 15:07:50] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 75 ms returned sat
[2024-05-28 15:07:50] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2024-05-28 15:07:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:07:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-28 15:07:51] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 34 ms returned sat
[2024-05-28 15:07:52] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2024-05-28 15:07:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:07:52] [INFO ] [Nat]Added 120 Read/Feed constraints in 144 ms returned sat
[2024-05-28 15:07:52] [INFO ] Deduced a trap composed of 49 places in 283 ms of which 3 ms to minimize.
[2024-05-28 15:07:53] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 2 ms to minimize.
[2024-05-28 15:07:53] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:07:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1483 ms
[2024-05-28 15:07:54] [INFO ] Computed and/alt/rep : 786/3319/768 causal constraints (skipped 414 transitions) in 99 ms.
[2024-05-28 15:07:58] [INFO ] Added : 251 causal constraints over 51 iterations in 4601 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 1210/1210 transitions.
Applied a total of 0 rules in 23 ms. Remains 382 /382 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
Running 1206 sub problems to find dead transitions.
[2024-05-28 15:07:58] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 15:07:58] [INFO ] Invariant cache hit.
[2024-05-28 15:07:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:08:08] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:08:09] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:08:09] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:08:09] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:08:09] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:08:09] [INFO ] Deduced a trap composed of 168 places in 292 ms of which 3 ms to minimize.
[2024-05-28 15:08:09] [INFO ] Deduced a trap composed of 157 places in 288 ms of which 3 ms to minimize.
[2024-05-28 15:08:10] [INFO ] Deduced a trap composed of 49 places in 269 ms of which 2 ms to minimize.
[2024-05-28 15:08:10] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 3 ms to minimize.
[2024-05-28 15:08:10] [INFO ] Deduced a trap composed of 181 places in 220 ms of which 3 ms to minimize.
[2024-05-28 15:08:10] [INFO ] Deduced a trap composed of 163 places in 228 ms of which 3 ms to minimize.
[2024-05-28 15:08:11] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 2 ms to minimize.
[2024-05-28 15:08:21] [INFO ] Deduced a trap composed of 133 places in 234 ms of which 2 ms to minimize.
[2024-05-28 15:08:21] [INFO ] Deduced a trap composed of 197 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 50 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:08:31] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
[2024-05-28 15:08:35] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 3 ms to minimize.
[2024-05-28 15:08:35] [INFO ] Deduced a trap composed of 113 places in 208 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:08:37] [INFO ] Deduced a trap composed of 167 places in 268 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 54 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 18/18 constraints]
After SMT, in 44476ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 44493ms
[2024-05-28 15:08:43] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 15:08:43] [INFO ] Invariant cache hit.
[2024-05-28 15:08:43] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-28 15:08:43] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 15:08:43] [INFO ] Invariant cache hit.
[2024-05-28 15:08:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:08:48] [INFO ] Implicit Places using invariants and state equation in 5143 ms returned []
Implicit Place search using SMT with State Equation took 5540 ms to find 0 implicit places.
[2024-05-28 15:08:48] [INFO ] Redundant transitions in 23 ms returned []
Running 1206 sub problems to find dead transitions.
[2024-05-28 15:08:48] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 15:08:48] [INFO ] Invariant cache hit.
[2024-05-28 15:08:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:08:59] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:08:59] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:08:59] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:08:59] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 0 ms to minimize.
[2024-05-28 15:08:59] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:08:59] [INFO ] Deduced a trap composed of 168 places in 254 ms of which 3 ms to minimize.
[2024-05-28 15:08:59] [INFO ] Deduced a trap composed of 157 places in 260 ms of which 3 ms to minimize.
[2024-05-28 15:09:00] [INFO ] Deduced a trap composed of 49 places in 263 ms of which 2 ms to minimize.
[2024-05-28 15:09:00] [INFO ] Deduced a trap composed of 160 places in 285 ms of which 2 ms to minimize.
[2024-05-28 15:09:00] [INFO ] Deduced a trap composed of 181 places in 287 ms of which 3 ms to minimize.
[2024-05-28 15:09:01] [INFO ] Deduced a trap composed of 163 places in 263 ms of which 3 ms to minimize.
[2024-05-28 15:09:01] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2024-05-28 15:09:11] [INFO ] Deduced a trap composed of 133 places in 190 ms of which 2 ms to minimize.
[2024-05-28 15:09:12] [INFO ] Deduced a trap composed of 197 places in 204 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:09:22] [INFO ] Deduced a trap composed of 167 places in 185 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 51 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 15:09:26] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:09:34] [INFO ] Deduced a trap composed of 132 places in 211 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 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 TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 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 TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 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 TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 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 TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/380 variables, 2/55 constraints. Problems are: Problem set: 174 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1568 variables, and 55 constraints, problems are : Problem set: 174 solved, 1032 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 17/17 constraints]
After SMT, in 64400ms problems are : Problem set: 174 solved, 1032 unsolved
Search for dead transitions found 174 dead transitions in 64420ms
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 : 382/382 places, 1036/1210 transitions.
Applied a total of 0 rules in 28 ms. Remains 382 /382 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
[2024-05-28 15:09:53] [INFO ] Redundant transitions in 15 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 114560 ms. Remains : 382/382 places, 1036/1210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 262 steps (0 resets) in 8 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 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 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-05-28 15:09:53] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 382 cols
[2024-05-28 15:09:53] [INFO ] Computed 40 invariants in 19 ms
[2024-05-28 15:09:54] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 15:09:54] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 59 ms returned sat
[2024-05-28 15:09:54] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2024-05-28 15:09:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:09:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-28 15:09:55] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 38 ms returned sat
[2024-05-28 15:09:57] [INFO ] [Nat]Absence check using state equation in 1999 ms returned sat
[2024-05-28 15:09:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:09:57] [INFO ] [Nat]Added 120 Read/Feed constraints in 504 ms returned sat
[2024-05-28 15:09:58] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 3 ms to minimize.
[2024-05-28 15:09:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2024-05-28 15:09:58] [INFO ] Computed and/alt/rep : 612/2797/594 causal constraints (skipped 414 transitions) in 90 ms.
[2024-05-28 15:10:04] [INFO ] Added : 277 causal constraints over 56 iterations in 6021 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1469 reset in 391 ms.
Product exploration explored 100000 steps with 1473 reset in 411 ms.
Built C files in :
/tmp/ltsmin16935674366627543165
[2024-05-28 15:10:05] [INFO ] Computing symmetric may disable matrix : 1036 transitions.
[2024-05-28 15:10:05] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:10:05] [INFO ] Computing symmetric may enable matrix : 1036 transitions.
[2024-05-28 15:10:05] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:10:05] [INFO ] Computing Do-Not-Accords matrix : 1036 transitions.
[2024-05-28 15:10:05] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:10:05] [INFO ] Built C files in 294ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16935674366627543165
Running compilation step : cd /tmp/ltsmin16935674366627543165;'/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/ltsmin16935674366627543165;'/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/ltsmin16935674366627543165;'/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 6 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 1036/1036 transitions.
Applied a total of 0 rules in 12 ms. Remains 382 /382 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Running 1032 sub problems to find dead transitions.
[2024-05-28 15:10:08] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2024-05-28 15:10:08] [INFO ] Invariant cache hit.
[2024-05-28 15:10:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 15:10:16] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:10:16] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-28 15:10:16] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:10:16] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:10:16] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:10:16] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 2 ms to minimize.
[2024-05-28 15:10:16] [INFO ] Deduced a trap composed of 203 places in 220 ms of which 3 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 153 places in 221 ms of which 2 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 155 places in 206 ms of which 3 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 150 places in 255 ms of which 3 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 177 places in 224 ms of which 2 ms to minimize.
[2024-05-28 15:10:18] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 3 ms to minimize.
[2024-05-28 15:10:19] [INFO ] Deduced a trap composed of 151 places in 214 ms of which 2 ms to minimize.
[2024-05-28 15:10:24] [INFO ] Deduced a trap composed of 193 places in 232 ms of which 3 ms to minimize.
[2024-05-28 15:10:24] [INFO ] Deduced a trap composed of 144 places in 181 ms of which 2 ms to minimize.
[2024-05-28 15:10:24] [INFO ] Deduced a trap composed of 185 places in 229 ms of which 3 ms to minimize.
[2024-05-28 15:10:25] [INFO ] Deduced a trap composed of 140 places in 220 ms of which 3 ms to minimize.
[2024-05-28 15:10:26] [INFO ] Deduced a trap composed of 132 places in 246 ms of which 3 ms to minimize.
[2024-05-28 15:10:26] [INFO ] Deduced a trap composed of 133 places in 115 ms of which 1 ms to minimize.
[2024-05-28 15:10:26] [INFO ] Deduced a trap composed of 153 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1394 variables, and 56 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 15:10:31] [INFO ] Deduced a trap composed of 209 places in 245 ms of which 3 ms to minimize.
[2024-05-28 15:10:32] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 2 ms to minimize.
[2024-05-28 15:10:32] [INFO ] Deduced a trap composed of 166 places in 245 ms of which 3 ms to minimize.
[2024-05-28 15:10:32] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 3 ms to minimize.
[2024-05-28 15:10:32] [INFO ] Deduced a trap composed of 176 places in 228 ms of which 3 ms to minimize.
[2024-05-28 15:10:33] [INFO ] Deduced a trap composed of 165 places in 196 ms of which 3 ms to minimize.
[2024-05-28 15:10:33] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 3 ms to minimize.
[2024-05-28 15:10:33] [INFO ] Deduced a trap composed of 175 places in 198 ms of which 3 ms to minimize.
[2024-05-28 15:10:33] [INFO ] Deduced a trap composed of 155 places in 221 ms of which 2 ms to minimize.
[2024-05-28 15:10:34] [INFO ] Deduced a trap composed of 153 places in 189 ms of which 2 ms to minimize.
[2024-05-28 15:10:34] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 2 ms to minimize.
[2024-05-28 15:10:34] [INFO ] Deduced a trap composed of 153 places in 192 ms of which 3 ms to minimize.
[2024-05-28 15:10:35] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 3 ms to minimize.
[2024-05-28 15:10:36] [INFO ] Deduced a trap composed of 150 places in 218 ms of which 2 ms to minimize.
[2024-05-28 15:10:38] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 15:10:47] [INFO ] Deduced a trap composed of 155 places in 216 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1394 variables, and 72 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1032 constraints, Known Traps: 36/36 constraints]
After SMT, in 42073ms problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 42095ms
[2024-05-28 15:10:50] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2024-05-28 15:10:50] [INFO ] Invariant cache hit.
[2024-05-28 15:10:50] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-28 15:10:50] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2024-05-28 15:10:50] [INFO ] Invariant cache hit.
[2024-05-28 15:10:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:10:55] [INFO ] Implicit Places using invariants and state equation in 4434 ms returned []
Implicit Place search using SMT with State Equation took 4731 ms to find 0 implicit places.
[2024-05-28 15:10:55] [INFO ] Redundant transitions in 16 ms returned []
Running 1032 sub problems to find dead transitions.
[2024-05-28 15:10:55] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2024-05-28 15:10:55] [INFO ] Invariant cache hit.
[2024-05-28 15:10:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 15:11:02] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-05-28 15:11:02] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:11:02] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:11:02] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:11:02] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:11:03] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 3 ms to minimize.
[2024-05-28 15:11:03] [INFO ] Deduced a trap composed of 203 places in 248 ms of which 2 ms to minimize.
[2024-05-28 15:11:03] [INFO ] Deduced a trap composed of 153 places in 253 ms of which 2 ms to minimize.
[2024-05-28 15:11:03] [INFO ] Deduced a trap composed of 155 places in 221 ms of which 2 ms to minimize.
[2024-05-28 15:11:04] [INFO ] Deduced a trap composed of 150 places in 191 ms of which 3 ms to minimize.
[2024-05-28 15:11:04] [INFO ] Deduced a trap composed of 177 places in 187 ms of which 3 ms to minimize.
[2024-05-28 15:11:04] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 2 ms to minimize.
[2024-05-28 15:11:06] [INFO ] Deduced a trap composed of 151 places in 191 ms of which 2 ms to minimize.
[2024-05-28 15:11:10] [INFO ] Deduced a trap composed of 193 places in 245 ms of which 3 ms to minimize.
[2024-05-28 15:11:10] [INFO ] Deduced a trap composed of 144 places in 224 ms of which 2 ms to minimize.
[2024-05-28 15:11:11] [INFO ] Deduced a trap composed of 185 places in 224 ms of which 2 ms to minimize.
[2024-05-28 15:11:12] [INFO ] Deduced a trap composed of 140 places in 218 ms of which 3 ms to minimize.
[2024-05-28 15:11:12] [INFO ] Deduced a trap composed of 132 places in 239 ms of which 3 ms to minimize.
[2024-05-28 15:11:12] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:11:13] [INFO ] Deduced a trap composed of 153 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 15:11:20] [INFO ] Deduced a trap composed of 144 places in 217 ms of which 3 ms to minimize.
[2024-05-28 15:11:20] [INFO ] Deduced a trap composed of 154 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 15:11:26] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 7 ms to minimize.
[2024-05-28 15:11:26] [INFO ] Deduced a trap composed of 50 places in 255 ms of which 4 ms to minimize.
[2024-05-28 15:11:27] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 2 ms to minimize.
[2024-05-28 15:11:27] [INFO ] Deduced a trap composed of 151 places in 227 ms of which 2 ms to minimize.
SMT process timed out in 32511ms, After SMT, problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 32527ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79395 ms. Remains : 382/382 places, 1036/1036 transitions.
Built C files in :
/tmp/ltsmin6652008457786855918
[2024-05-28 15:11:27] [INFO ] Computing symmetric may disable matrix : 1036 transitions.
[2024-05-28 15:11:27] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:11:27] [INFO ] Computing symmetric may enable matrix : 1036 transitions.
[2024-05-28 15:11:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:11:28] [INFO ] Computing Do-Not-Accords matrix : 1036 transitions.
[2024-05-28 15:11:28] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:11:28] [INFO ] Built C files in 293ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6652008457786855918
Running compilation step : cd /tmp/ltsmin6652008457786855918;'/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/ltsmin6652008457786855918;'/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/ltsmin6652008457786855918;'/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:11:31] [INFO ] Flatten gal took : 32 ms
[2024-05-28 15:11:31] [INFO ] Flatten gal took : 32 ms
[2024-05-28 15:11:31] [INFO ] Time to serialize gal into /tmp/LTL1483746938250671346.gal : 5 ms
[2024-05-28 15:11:31] [INFO ] Time to serialize properties into /tmp/LTL1401019951701932209.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1483746938250671346.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1637564069330634359.hoa' '-atoms' '/tmp/LTL1401019951701932209.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1401019951701932209.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1637564069330634359.hoa
Detected timeout of ITS tools.
[2024-05-28 15:11:46] [INFO ] Flatten gal took : 60 ms
[2024-05-28 15:11:46] [INFO ] Flatten gal took : 47 ms
[2024-05-28 15:11:46] [INFO ] Time to serialize gal into /tmp/LTL5224404400467382398.gal : 6 ms
[2024-05-28 15:11:46] [INFO ] Time to serialize properties into /tmp/LTL13491916530448377806.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/LTL5224404400467382398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13491916530448377806.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("((((Perform_Work_E_5>=1)||(Perform_Work_E_4>=1))||((Perform_Work_E_3>=1)||(Perform_Work_E_2>=1)))||((Perform_Work_E_1>=1)||(Pe...180
Formula 0 simplified : FG!"((((Perform_Work_E_5>=1)||(Perform_Work_E_4>=1))||((Perform_Work_E_3>=1)||(Perform_Work_E_2>=1)))||((Perform_Work_E_1>=1)||(Perf...174
Detected timeout of ITS tools.
[2024-05-28 15:12:01] [INFO ] Flatten gal took : 72 ms
[2024-05-28 15:12:01] [INFO ] Applying decomposition
[2024-05-28 15:12:01] [INFO ] Flatten gal took : 53 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/graph8625788628994409843.txt' '-o' '/tmp/graph8625788628994409843.bin' '-w' '/tmp/graph8625788628994409843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8625788628994409843.bin' '-l' '-1' '-v' '-w' '/tmp/graph8625788628994409843.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:12:01] [INFO ] Decomposing Gal with order
[2024-05-28 15:12:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:12:01] [INFO ] Removed a total of 710 redundant transitions.
[2024-05-28 15:12:01] [INFO ] Flatten gal took : 92 ms
[2024-05-28 15:12:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 26 ms.
[2024-05-28 15:12:01] [INFO ] Time to serialize gal into /tmp/LTL15618270267489418379.gal : 10 ms
[2024-05-28 15:12:01] [INFO ] Time to serialize properties into /tmp/LTL530814052737731536.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/LTL15618270267489418379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL530814052737731536.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((((i8.i1.u28.Perform_Work_E_5>=1)||(i8.i2.u30.Perform_Work_E_4>=1))||((i8.i2.u27.Perform_Work_E_3>=1)||(i8.i2.u29.Perform_Wor...240
Formula 0 simplified : FG!"((((i8.i1.u28.Perform_Work_E_5>=1)||(i8.i2.u30.Perform_Work_E_4>=1))||((i8.i2.u27.Perform_Work_E_3>=1)||(i8.i2.u29.Perform_Work_...234
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-07 finished in 353389 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(F(p1))||p0)))'
Support contains 13 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
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 544 transition count 1330
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 502 transition count 1324
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 96 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 216 place count 436 transition count 1264
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 430 transition count 1258
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 430 transition count 1258
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 3 with 108 rules applied. Total rules applied 336 place count 376 transition count 1204
Applied a total of 336 rules in 92 ms. Remains 376 /544 variables (removed 168) and now considering 1204/1372 (removed 168) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-28 15:12:17] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
// Phase 1: matrix 1180 rows 376 cols
[2024-05-28 15:12:17] [INFO ] Computed 40 invariants in 31 ms
[2024-05-28 15:12:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:12:28] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 3 ms to minimize.
[2024-05-28 15:12:28] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:12:28] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:12:28] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2024-05-28 15:12:28] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:12:28] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 0 ms to minimize.
[2024-05-28 15:12:28] [INFO ] Deduced a trap composed of 168 places in 311 ms of which 4 ms to minimize.
[2024-05-28 15:12:29] [INFO ] Deduced a trap composed of 149 places in 291 ms of which 3 ms to minimize.
[2024-05-28 15:12:29] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:12:30] [INFO ] Deduced a trap composed of 190 places in 221 ms of which 3 ms to minimize.
[2024-05-28 15:12:38] [INFO ] Deduced a trap composed of 180 places in 205 ms of which 3 ms to minimize.
[2024-05-28 15:12:38] [INFO ] Deduced a trap composed of 120 places in 199 ms of which 3 ms to minimize.
[2024-05-28 15:12:38] [INFO ] Deduced a trap composed of 110 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1556 variables, and 49 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:12:43] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 2 ms to minimize.
[2024-05-28 15:12:45] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:12:58] [INFO ] Deduced a trap composed of 61 places in 210 ms of which 2 ms to minimize.
[2024-05-28 15:12:59] [INFO ] Deduced a trap composed of 153 places in 267 ms of which 3 ms to minimize.
[2024-05-28 15:12:59] [INFO ] Deduced a trap composed of 129 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1556 variables, and 54 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 18/18 constraints]
After SMT, in 44265ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 44281ms
[2024-05-28 15:13:01] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-28 15:13:01] [INFO ] Invariant cache hit.
[2024-05-28 15:13:01] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-28 15:13:01] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-28 15:13:01] [INFO ] Invariant cache hit.
[2024-05-28 15:13:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:13:04] [INFO ] Implicit Places using invariants and state equation in 3173 ms returned []
Implicit Place search using SMT with State Equation took 3479 ms to find 0 implicit places.
[2024-05-28 15:13:04] [INFO ] Redundant transitions in 22 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-28 15:13:04] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
[2024-05-28 15:13:04] [INFO ] Invariant cache hit.
[2024-05-28 15:13:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:13:15] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 1 ms to minimize.
[2024-05-28 15:13:15] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:13:16] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:13:16] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:13:16] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:13:16] [INFO ] Deduced a trap composed of 157 places in 291 ms of which 3 ms to minimize.
[2024-05-28 15:13:16] [INFO ] Deduced a trap composed of 147 places in 263 ms of which 3 ms to minimize.
[2024-05-28 15:13:17] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:13:24] [INFO ] Deduced a trap composed of 120 places in 221 ms of which 3 ms to minimize.
[2024-05-28 15:13:25] [INFO ] Deduced a trap composed of 133 places in 230 ms of which 2 ms to minimize.
[2024-05-28 15:13:25] [INFO ] Deduced a trap composed of 181 places in 272 ms of which 3 ms to minimize.
[2024-05-28 15:13:25] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:13:28] [INFO ] Deduced a trap composed of 210 places in 233 ms of which 3 ms to minimize.
[2024-05-28 15:13:32] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
[2024-05-28 15:13:36] [INFO ] Deduced a trap composed of 159 places in 224 ms of which 3 ms to minimize.
[2024-05-28 15:13:36] [INFO ] Deduced a trap composed of 40 places in 166 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/372 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1556 variables, and 52 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 15:13:42] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
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 TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 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 TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 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 TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
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 TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/374 variables, 2/55 constraints. Problems are: Problem set: 174 solved, 1026 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 1)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/1556 variables, and 55 constraints, problems are : Problem set: 174 solved, 1026 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 17/17 constraints]
After SMT, in 64392ms problems are : Problem set: 174 solved, 1026 unsolved
Search for dead transitions found 174 dead transitions in 64410ms
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 : 376/544 places, 1030/1372 transitions.
Applied a total of 0 rules in 16 ms. Remains 376 /376 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
[2024-05-28 15:14:09] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 112329 ms. Remains : 376/544 places, 1030/1372 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-08
Product exploration explored 100000 steps with 4008 reset in 499 ms.
Product exploration explored 100000 steps with 3984 reset in 442 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 450 steps (0 resets) in 9 ms. (45 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 15:14:10] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
// Phase 1: matrix 1006 rows 376 cols
[2024-05-28 15:14:10] [INFO ] Computed 40 invariants in 19 ms
[2024-05-28 15:14:11] [INFO ] [Real]Absence check using 16 positive place invariants in 27 ms returned sat
[2024-05-28 15:14:11] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 74 ms returned sat
[2024-05-28 15:14:12] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2024-05-28 15:14:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:14:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 60 ms returned sat
[2024-05-28 15:14:12] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 128 ms returned sat
[2024-05-28 15:14:16] [INFO ] [Nat]Absence check using state equation in 3492 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 13 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 1030/1030 transitions.
Applied a total of 0 rules in 28 ms. Remains 376 /376 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
Running 1026 sub problems to find dead transitions.
[2024-05-28 15:14:16] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
[2024-05-28 15:14:16] [INFO ] Invariant cache hit.
[2024-05-28 15:14:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:14:23] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
[2024-05-28 15:14:23] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-05-28 15:14:23] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:14:23] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:14:24] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:14:24] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:14:24] [INFO ] Deduced a trap composed of 186 places in 197 ms of which 2 ms to minimize.
[2024-05-28 15:14:24] [INFO ] Deduced a trap composed of 143 places in 182 ms of which 2 ms to minimize.
[2024-05-28 15:14:25] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:14:26] [INFO ] Deduced a trap composed of 190 places in 194 ms of which 2 ms to minimize.
[2024-05-28 15:14:29] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-05-28 15:14:29] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
[2024-05-28 15:14:31] [INFO ] Deduced a trap composed of 153 places in 203 ms of which 3 ms to minimize.
[2024-05-28 15:14:31] [INFO ] Deduced a trap composed of 180 places in 220 ms of which 3 ms to minimize.
[2024-05-28 15:14:32] [INFO ] Deduced a trap composed of 110 places in 190 ms of which 3 ms to minimize.
[2024-05-28 15:14:33] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 3 ms to minimize.
[2024-05-28 15:14:33] [INFO ] Deduced a trap composed of 159 places in 197 ms of which 3 ms to minimize.
[2024-05-28 15:14:34] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:14:35] [INFO ] Deduced a trap composed of 150 places in 243 ms of which 3 ms to minimize.
[2024-05-28 15:14:35] [INFO ] Deduced a trap composed of 145 places in 251 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1382 variables, and 56 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:14:39] [INFO ] Deduced a trap composed of 132 places in 204 ms of which 3 ms to minimize.
[2024-05-28 15:14:39] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2024-05-28 15:14:42] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:14:50] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 2 ms to minimize.
[2024-05-28 15:14:50] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:14:51] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 2 ms to minimize.
[2024-05-28 15:14:51] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-28 15:14:54] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:14:56] [INFO ] Deduced a trap composed of 115 places in 213 ms of which 3 ms to minimize.
[2024-05-28 15:14:56] [INFO ] Deduced a trap composed of 120 places in 247 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1382 variables, and 66 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 30/30 constraints]
After SMT, in 41970ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 41988ms
[2024-05-28 15:14:58] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
[2024-05-28 15:14:58] [INFO ] Invariant cache hit.
[2024-05-28 15:14:58] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-28 15:14:58] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
[2024-05-28 15:14:58] [INFO ] Invariant cache hit.
[2024-05-28 15:14:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:15:05] [INFO ] Implicit Places using invariants and state equation in 6571 ms returned []
Implicit Place search using SMT with State Equation took 6931 ms to find 0 implicit places.
[2024-05-28 15:15:05] [INFO ] Redundant transitions in 19 ms returned []
Running 1026 sub problems to find dead transitions.
[2024-05-28 15:15:05] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
[2024-05-28 15:15:05] [INFO ] Invariant cache hit.
[2024-05-28 15:15:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:15:12] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
[2024-05-28 15:15:12] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:15:12] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:15:12] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:15:12] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:15:12] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:15:13] [INFO ] Deduced a trap composed of 186 places in 227 ms of which 2 ms to minimize.
[2024-05-28 15:15:13] [INFO ] Deduced a trap composed of 143 places in 189 ms of which 3 ms to minimize.
[2024-05-28 15:15:14] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:15:15] [INFO ] Deduced a trap composed of 190 places in 223 ms of which 2 ms to minimize.
[2024-05-28 15:15:18] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 2 ms to minimize.
[2024-05-28 15:15:18] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 1 ms to minimize.
[2024-05-28 15:15:20] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 2 ms to minimize.
[2024-05-28 15:15:20] [INFO ] Deduced a trap composed of 180 places in 222 ms of which 3 ms to minimize.
[2024-05-28 15:15:21] [INFO ] Deduced a trap composed of 110 places in 206 ms of which 2 ms to minimize.
[2024-05-28 15:15:22] [INFO ] Deduced a trap composed of 162 places in 258 ms of which 3 ms to minimize.
[2024-05-28 15:15:23] [INFO ] Deduced a trap composed of 159 places in 222 ms of which 3 ms to minimize.
[2024-05-28 15:15:23] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:15:24] [INFO ] Deduced a trap composed of 150 places in 258 ms of which 3 ms to minimize.
[2024-05-28 15:15:24] [INFO ] Deduced a trap composed of 145 places in 253 ms of which 3 ms to minimize.
[2024-05-28 15:15:31] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 2 ms to minimize.
[2024-05-28 15:15:32] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 2 ms to minimize.
[2024-05-28 15:15:32] [INFO ] Deduced a trap composed of 149 places in 225 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1382 variables, and 59 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:15:39] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:15:42] [INFO ] Deduced a trap composed of 120 places in 194 ms of which 2 ms to minimize.
[2024-05-28 15:15:46] [INFO ] Deduced a trap composed of 144 places in 216 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:15:56] [INFO ] Deduced a trap composed of 160 places in 252 ms of which 3 ms to minimize.
[2024-05-28 15:15:56] [INFO ] Deduced a trap composed of 161 places in 254 ms of which 2 ms to minimize.
[2024-05-28 15:16:06] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1382 variables, and 65 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 29/29 constraints]
After SMT, in 61891ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 61910ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110891 ms. Remains : 376/376 places, 1030/1030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 572 steps (0 resets) in 9 ms. (57 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 15:16:07] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
[2024-05-28 15:16:07] [INFO ] Invariant cache hit.
[2024-05-28 15:16:08] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2024-05-28 15:16:08] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 83 ms returned sat
[2024-05-28 15:16:08] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2024-05-28 15:16:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:16:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 30 ms returned sat
[2024-05-28 15:16:09] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 98 ms returned sat
[2024-05-28 15:16:13] [INFO ] [Nat]Absence check using state equation in 3855 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3998 reset in 466 ms.
Product exploration explored 100000 steps with 4004 reset in 410 ms.
Built C files in :
/tmp/ltsmin2595061060781039441
[2024-05-28 15:16:14] [INFO ] Computing symmetric may disable matrix : 1030 transitions.
[2024-05-28 15:16:14] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:16:14] [INFO ] Computing symmetric may enable matrix : 1030 transitions.
[2024-05-28 15:16:14] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:16:14] [INFO ] Computing Do-Not-Accords matrix : 1030 transitions.
[2024-05-28 15:16:14] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:16:14] [INFO ] Built C files in 294ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2595061060781039441
Running compilation step : cd /tmp/ltsmin2595061060781039441;'/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/ltsmin2595061060781039441;'/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/ltsmin2595061060781039441;'/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 13 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 1030/1030 transitions.
Applied a total of 0 rules in 11 ms. Remains 376 /376 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
Running 1026 sub problems to find dead transitions.
[2024-05-28 15:16:17] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
[2024-05-28 15:16:17] [INFO ] Invariant cache hit.
[2024-05-28 15:16:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 2 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 0 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 186 places in 198 ms of which 2 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 143 places in 199 ms of which 2 ms to minimize.
[2024-05-28 15:16:26] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:16:27] [INFO ] Deduced a trap composed of 190 places in 195 ms of which 2 ms to minimize.
[2024-05-28 15:16:30] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 3 ms to minimize.
[2024-05-28 15:16:30] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 2 ms to minimize.
[2024-05-28 15:16:32] [INFO ] Deduced a trap composed of 153 places in 223 ms of which 3 ms to minimize.
[2024-05-28 15:16:33] [INFO ] Deduced a trap composed of 180 places in 202 ms of which 2 ms to minimize.
[2024-05-28 15:16:34] [INFO ] Deduced a trap composed of 110 places in 190 ms of which 3 ms to minimize.
[2024-05-28 15:16:35] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 3 ms to minimize.
[2024-05-28 15:16:35] [INFO ] Deduced a trap composed of 159 places in 201 ms of which 2 ms to minimize.
[2024-05-28 15:16:35] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:16:36] [INFO ] Deduced a trap composed of 150 places in 220 ms of which 3 ms to minimize.
[2024-05-28 15:16:37] [INFO ] Deduced a trap composed of 145 places in 260 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1382 variables, and 56 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:16:41] [INFO ] Deduced a trap composed of 132 places in 279 ms of which 3 ms to minimize.
[2024-05-28 15:16:41] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 3 ms to minimize.
[2024-05-28 15:16:43] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 2 ms to minimize.
[2024-05-28 15:16:47] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 4 ms to minimize.
[2024-05-28 15:16:54] [INFO ] Deduced a trap composed of 60 places in 242 ms of which 2 ms to minimize.
[2024-05-28 15:16:55] [INFO ] Deduced a trap composed of 55 places in 227 ms of which 3 ms to minimize.
[2024-05-28 15:16:58] [INFO ] Deduced a trap composed of 120 places in 235 ms of which 2 ms to minimize.
(s190 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 10)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1382 variables, and 63 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 27/27 constraints]
After SMT, in 41876ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 41885ms
[2024-05-28 15:16:59] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
[2024-05-28 15:16:59] [INFO ] Invariant cache hit.
[2024-05-28 15:16:59] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-28 15:16:59] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
[2024-05-28 15:16:59] [INFO ] Invariant cache hit.
[2024-05-28 15:16:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:17:06] [INFO ] Implicit Places using invariants and state equation in 6667 ms returned []
Implicit Place search using SMT with State Equation took 7036 ms to find 0 implicit places.
[2024-05-28 15:17:06] [INFO ] Redundant transitions in 15 ms returned []
Running 1026 sub problems to find dead transitions.
[2024-05-28 15:17:06] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
[2024-05-28 15:17:06] [INFO ] Invariant cache hit.
[2024-05-28 15:17:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:17:14] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 1 ms to minimize.
[2024-05-28 15:17:14] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:17:14] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:17:14] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:17:14] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:17:14] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:17:14] [INFO ] Deduced a trap composed of 186 places in 196 ms of which 3 ms to minimize.
[2024-05-28 15:17:14] [INFO ] Deduced a trap composed of 143 places in 179 ms of which 2 ms to minimize.
[2024-05-28 15:17:15] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:17:16] [INFO ] Deduced a trap composed of 190 places in 198 ms of which 2 ms to minimize.
[2024-05-28 15:17:19] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 3 ms to minimize.
[2024-05-28 15:17:20] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 2 ms to minimize.
[2024-05-28 15:17:22] [INFO ] Deduced a trap composed of 153 places in 216 ms of which 2 ms to minimize.
[2024-05-28 15:17:22] [INFO ] Deduced a trap composed of 180 places in 227 ms of which 2 ms to minimize.
[2024-05-28 15:17:23] [INFO ] Deduced a trap composed of 110 places in 206 ms of which 4 ms to minimize.
[2024-05-28 15:17:25] [INFO ] Deduced a trap composed of 162 places in 265 ms of which 2 ms to minimize.
[2024-05-28 15:17:25] [INFO ] Deduced a trap composed of 159 places in 211 ms of which 2 ms to minimize.
[2024-05-28 15:17:25] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:17:26] [INFO ] Deduced a trap composed of 150 places in 231 ms of which 2 ms to minimize.
[2024-05-28 15:17:27] [INFO ] Deduced a trap composed of 145 places in 241 ms of which 3 ms to minimize.
[2024-05-28 15:17:35] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 2 ms to minimize.
[2024-05-28 15:17:35] [INFO ] Deduced a trap composed of 156 places in 253 ms of which 2 ms to minimize.
[2024-05-28 15:17:35] [INFO ] Deduced a trap composed of 149 places in 253 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1382 variables, and 59 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:17:41] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-28 15:17:44] [INFO ] Deduced a trap composed of 120 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:17:48] [INFO ] Deduced a trap composed of 144 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-28 15:17:57] [INFO ] Deduced a trap composed of 161 places in 255 ms of which 2 ms to minimize.
[2024-05-28 15:17:57] [INFO ] Deduced a trap composed of 156 places in 250 ms of which 3 ms to minimize.
[2024-05-28 15:17:57] [INFO ] Deduced a trap composed of 162 places in 252 ms of which 3 ms to minimize.
[2024-05-28 15:18:03] [INFO ] Deduced a trap composed of 160 places in 258 ms of which 2 ms to minimize.
[2024-05-28 15:18:03] [INFO ] Deduced a trap composed of 144 places in 234 ms of which 2 ms to minimize.
[2024-05-28 15:18:04] [INFO ] Deduced a trap composed of 171 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1382 variables, and 68 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/376 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 32/32 constraints]
After SMT, in 61946ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 61962ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110923 ms. Remains : 376/376 places, 1030/1030 transitions.
Built C files in :
/tmp/ltsmin2307867016785120473
[2024-05-28 15:18:08] [INFO ] Computing symmetric may disable matrix : 1030 transitions.
[2024-05-28 15:18:08] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:18:08] [INFO ] Computing symmetric may enable matrix : 1030 transitions.
[2024-05-28 15:18:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:18:08] [INFO ] Computing Do-Not-Accords matrix : 1030 transitions.
[2024-05-28 15:18:08] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:18:08] [INFO ] Built C files in 277ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2307867016785120473
Running compilation step : cd /tmp/ltsmin2307867016785120473;'/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/ltsmin2307867016785120473;'/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/ltsmin2307867016785120473;'/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:18:11] [INFO ] Flatten gal took : 46 ms
[2024-05-28 15:18:11] [INFO ] Flatten gal took : 41 ms
[2024-05-28 15:18:11] [INFO ] Time to serialize gal into /tmp/LTL16538634892348105280.gal : 7 ms
[2024-05-28 15:18:11] [INFO ] Time to serialize properties into /tmp/LTL3980458931657305823.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16538634892348105280.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10142385922096958478.hoa' '-atoms' '/tmp/LTL3980458931657305823.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3980458931657305823.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10142385922096958478.hoa
Detected timeout of ITS tools.
[2024-05-28 15:18:26] [INFO ] Flatten gal took : 53 ms
[2024-05-28 15:18:26] [INFO ] Flatten gal took : 44 ms
[2024-05-28 15:18:26] [INFO ] Time to serialize gal into /tmp/LTL929271211358635019.gal : 6 ms
[2024-05-28 15:18:26] [INFO ] Time to serialize properties into /tmp/LTL3291821688698458251.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/LTL929271211358635019.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3291821688698458251.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F((("(((Try_Check_Sources_B_3>=1)||(Try_Check_Sources_B_2>=1))||((Try_Check_Sources_B_1>=1)||(Try_Check_Sources_B_0>=1)))")||(("((T...613
Formula 0 simplified : G(!"(((((P_1099>=1)&&(P_1113_4>=1))||((P_1099>=1)&&(P_1113_3>=1)))||(((P_1099>=1)&&(P_1113_1>=1))||((P_1099>=1)&&(P_1113_2>=1))))||(...599
Detected timeout of ITS tools.
[2024-05-28 15:18:42] [INFO ] Flatten gal took : 46 ms
[2024-05-28 15:18:42] [INFO ] Applying decomposition
[2024-05-28 15:18:42] [INFO ] Flatten gal took : 42 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/graph9271745106523842414.txt' '-o' '/tmp/graph9271745106523842414.bin' '-w' '/tmp/graph9271745106523842414.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9271745106523842414.bin' '-l' '-1' '-v' '-w' '/tmp/graph9271745106523842414.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:18:42] [INFO ] Decomposing Gal with order
[2024-05-28 15:18:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:18:42] [INFO ] Removed a total of 725 redundant transitions.
[2024-05-28 15:18:42] [INFO ] Flatten gal took : 98 ms
[2024-05-28 15:18:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 440 labels/synchronizations in 24 ms.
[2024-05-28 15:18:42] [INFO ] Time to serialize gal into /tmp/LTL9442898436374095215.gal : 10 ms
[2024-05-28 15:18:42] [INFO ] Time to serialize properties into /tmp/LTL9377519986923984272.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/LTL9442898436374095215.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9377519986923984272.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((("(((i1.i0.u30.Try_Check_Sources_B_3>=1)||(i1.i0.u30.Try_Check_Sources_B_2>=1))||((i1.i0.u30.Try_Check_Sources_B_1>=1)||(i1.i0.u...801
Formula 0 simplified : G(!"(((((u13.P_1099>=1)&&(i7.u16.P_1113_4>=1))||((u13.P_1099>=1)&&(i7.u15.P_1113_3>=1)))||(((u13.P_1099>=1)&&(i7.u2.P_1113_1>=1))||(...787
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-08 finished in 400436 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 U (G(!p0)||(!p0&&G(!p1))))))'
Support contains 36 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 544 transition count 1324
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 496 transition count 1324
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 96 place count 496 transition count 1294
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 156 place count 466 transition count 1294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 162 place count 460 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 168 place count 460 transition count 1288
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 276 place count 406 transition count 1234
Applied a total of 276 rules in 72 ms. Remains 406 /544 variables (removed 138) and now considering 1234/1372 (removed 138) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 15:18:57] [INFO ] Flow matrix only has 1210 transitions (discarded 24 similar events)
// Phase 1: matrix 1210 rows 406 cols
[2024-05-28 15:18:57] [INFO ] Computed 40 invariants in 33 ms
[2024-05-28 15:18:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 15:19:09] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:19:16] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1616 variables, and 33 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/406 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 15:19:27] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 2 ms to minimize.
[2024-05-28 15:19:27] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:19:27] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:19:28] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 2 ms to minimize.
[2024-05-28 15:19:28] [INFO ] Deduced a trap composed of 139 places in 183 ms of which 2 ms to minimize.
[2024-05-28 15:19:28] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 1 ms to minimize.
[2024-05-28 15:19:28] [INFO ] Deduced a trap composed of 125 places in 203 ms of which 2 ms to minimize.
[2024-05-28 15:19:29] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:19:29] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:19:30] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:19:32] [INFO ] Deduced a trap composed of 146 places in 183 ms of which 3 ms to minimize.
[2024-05-28 15:19:32] [INFO ] Deduced a trap composed of 149 places in 173 ms of which 3 ms to minimize.
[2024-05-28 15:19:32] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 2 ms to minimize.
[2024-05-28 15:19:32] [INFO ] Deduced a trap composed of 123 places in 219 ms of which 3 ms to minimize.
[2024-05-28 15:19:33] [INFO ] Deduced a trap composed of 136 places in 217 ms of which 2 ms to minimize.
[2024-05-28 15:19:33] [INFO ] Deduced a trap composed of 127 places in 224 ms of which 2 ms to minimize.
[2024-05-28 15:19:33] [INFO ] Deduced a trap composed of 146 places in 167 ms of which 2 ms to minimize.
[2024-05-28 15:19:33] [INFO ] Deduced a trap composed of 148 places in 185 ms of which 2 ms to minimize.
[2024-05-28 15:19:33] [INFO ] Deduced a trap composed of 133 places in 181 ms of which 3 ms to minimize.
[2024-05-28 15:19:33] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/1616 variables, and 53 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/406 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 22/22 constraints]
After SMT, in 43803ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43817ms
[2024-05-28 15:19:41] [INFO ] Flow matrix only has 1210 transitions (discarded 24 similar events)
[2024-05-28 15:19:41] [INFO ] Invariant cache hit.
[2024-05-28 15:19:41] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-28 15:19:41] [INFO ] Flow matrix only has 1210 transitions (discarded 24 similar events)
[2024-05-28 15:19:41] [INFO ] Invariant cache hit.
[2024-05-28 15:19:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:19:45] [INFO ] Implicit Places using invariants and state equation in 3979 ms returned []
Implicit Place search using SMT with State Equation took 4366 ms to find 0 implicit places.
[2024-05-28 15:19:45] [INFO ] Redundant transitions in 24 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-28 15:19:45] [INFO ] Flow matrix only has 1210 transitions (discarded 24 similar events)
[2024-05-28 15:19:45] [INFO ] Invariant cache hit.
[2024-05-28 15:19:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 15:19:58] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:20:04] [INFO ] Deduced a trap composed of 136 places in 141 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
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 TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 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 TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 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 TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 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 TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 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 TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
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 TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/405 variables, 3/36 constraints. Problems are: Problem set: 252 solved, 978 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 5/41 constraints. Problems are: Problem set: 252 solved, 978 unsolved
[2024-05-28 15:20:19] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:20:19] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:20:19] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:20:19] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:20:20] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:20:20] [INFO ] Deduced a trap composed of 207 places in 311 ms of which 3 ms to minimize.
SMT process timed out in 34660ms, After SMT, problems are : Problem set: 252 solved, 978 unsolved
Search for dead transitions found 252 dead transitions in 34680ms
Found 252 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 252 transitions
Dead transitions reduction (with SMT) removed 252 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 406/544 places, 982/1372 transitions.
Applied a total of 0 rules in 14 ms. Remains 406 /406 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-28 15:20:20] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 83003 ms. Remains : 406/544 places, 982/1372 transitions.
Stuttering acceptance computed with spot in 82 ms :[p0, (AND p1 p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-09
Product exploration explored 100000 steps with 11 reset in 834 ms.
Stack based approach found an accepted trace after 1098 steps with 0 reset with depth 1099 and stack size 1099 in 10 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-09 finished in 83948 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(((!p0&&X(X(X(G(p1))))) U X(!p2))))'
Support contains 36 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Applied a total of 0 rules in 9 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-28 15:20:21] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 544 cols
[2024-05-28 15:20:21] [INFO ] Computed 40 invariants in 37 ms
[2024-05-28 15:20:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:20:36] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:20:36] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:20:36] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:20:36] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:20:36] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:20:37] [INFO ] Deduced a trap composed of 376 places in 286 ms of which 3 ms to minimize.
[2024-05-28 15:20:37] [INFO ] Deduced a trap composed of 299 places in 279 ms of which 3 ms to minimize.
[2024-05-28 15:20:37] [INFO ] Deduced a trap composed of 312 places in 263 ms of which 4 ms to minimize.
[2024-05-28 15:20:38] [INFO ] Deduced a trap composed of 291 places in 244 ms of which 3 ms to minimize.
[2024-05-28 15:20:38] [INFO ] Deduced a trap composed of 137 places in 241 ms of which 4 ms to minimize.
[2024-05-28 15:20:38] [INFO ] Deduced a trap composed of 155 places in 231 ms of which 3 ms to minimize.
[2024-05-28 15:20:38] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:20:39] [INFO ] Deduced a trap composed of 319 places in 314 ms of which 4 ms to minimize.
[2024-05-28 15:20:40] [INFO ] Deduced a trap composed of 324 places in 308 ms of which 4 ms to minimize.
[2024-05-28 15:20:40] [INFO ] Deduced a trap composed of 323 places in 307 ms of which 4 ms to minimize.
[2024-05-28 15:20:41] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 (/ 5.0 3.0))
(s12 (/ 1.0 3.0))
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 (/ 1.0 3.0))
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 (/ 1.0 3.0))
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 (/ 1.0 3.0))
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 (/ 8.0 3.0))
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 (/ 2.0 3.0))
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1892 variables, and 52 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:20:51] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 2 ms to minimize.
[2024-05-28 15:20:53] [INFO ] Deduced a trap composed of 331 places in 308 ms of which 4 ms to minimize.
[2024-05-28 15:20:53] [INFO ] Deduced a trap composed of 267 places in 294 ms of which 5 ms to minimize.
[2024-05-28 15:20:54] [INFO ] Deduced a trap composed of 314 places in 243 ms of which 4 ms to minimize.
[2024-05-28 15:20:55] [INFO ] Deduced a trap composed of 243 places in 197 ms of which 3 ms to minimize.
[2024-05-28 15:21:04] [INFO ] Deduced a trap composed of 267 places in 268 ms of which 3 ms to minimize.
[2024-05-28 15:21:05] [INFO ] Deduced a trap composed of 280 places in 237 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1892 variables, and 59 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 23/23 constraints]
After SMT, in 44496ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 44515ms
[2024-05-28 15:21:05] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 15:21:05] [INFO ] Invariant cache hit.
[2024-05-28 15:21:06] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-28 15:21:06] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 15:21:06] [INFO ] Invariant cache hit.
[2024-05-28 15:21:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:21:15] [INFO ] Implicit Places using invariants and state equation in 9127 ms returned []
Implicit Place search using SMT with State Equation took 9575 ms to find 0 implicit places.
Running 1368 sub problems to find dead transitions.
[2024-05-28 15:21:15] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 15:21:15] [INFO ] Invariant cache hit.
[2024-05-28 15:21:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:21:30] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:21:32] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 2 ms to minimize.
[2024-05-28 15:21:32] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 2 ms to minimize.
[2024-05-28 15:21:32] [INFO ] Deduced a trap composed of 76 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:21:32] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:21:32] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:21:33] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:21:35] [INFO ] Deduced a trap composed of 336 places in 244 ms of which 3 ms to minimize.
[2024-05-28 15:21:35] [INFO ] Deduced a trap composed of 308 places in 297 ms of which 3 ms to minimize.
[2024-05-28 15:21:35] [INFO ] Deduced a trap composed of 335 places in 298 ms of which 3 ms to minimize.
[2024-05-28 15:21:36] [INFO ] Deduced a trap composed of 318 places in 303 ms of which 3 ms to minimize.
[2024-05-28 15:21:36] [INFO ] Deduced a trap composed of 329 places in 361 ms of which 4 ms to minimize.
[2024-05-28 15:21:36] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 3 ms to minimize.
[2024-05-28 15:21:45] [INFO ] Deduced a trap composed of 278 places in 320 ms of which 4 ms to minimize.
[2024-05-28 15:21:46] [INFO ] Deduced a trap composed of 273 places in 295 ms of which 4 ms to minimize.
[2024-05-28 15:21:46] [INFO ] Deduced a trap composed of 372 places in 252 ms of which 4 ms to minimize.
[2024-05-28 15:21:46] [INFO ] Deduced a trap composed of 278 places in 255 ms of which 4 ms to minimize.
[2024-05-28 15:21:47] [INFO ] Deduced a trap composed of 262 places in 321 ms of which 4 ms to minimize.
[2024-05-28 15:21:47] [INFO ] Deduced a trap composed of 165 places in 246 ms of which 3 ms to minimize.
[2024-05-28 15:21:49] [INFO ] Deduced a trap composed of 360 places in 224 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1892 variables, and 56 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 15:21:52] [INFO ] Deduced a trap composed of 321 places in 268 ms of which 4 ms to minimize.
[2024-05-28 15:21:57] [INFO ] Deduced a trap composed of 298 places in 229 ms of which 3 ms to minimize.
[2024-05-28 15:21:57] [INFO ] Deduced a trap composed of 306 places in 255 ms of which 3 ms to minimize.
[2024-05-28 15:21:59] [INFO ] Deduced a trap composed of 301 places in 353 ms of which 4 ms to minimize.
[2024-05-28 15:22:00] [INFO ] Deduced a trap composed of 317 places in 345 ms of which 4 ms to minimize.
[2024-05-28 15:22:00] [INFO ] Deduced a trap composed of 328 places in 309 ms of which 3 ms to minimize.
[2024-05-28 15:22:01] [INFO ] Deduced a trap composed of 303 places in 286 ms of which 3 ms to minimize.
[2024-05-28 15:22:10] [INFO ] Deduced a trap composed of 41 places in 295 ms of which 3 ms to minimize.
[2024-05-28 15:22:11] [INFO ] Deduced a trap composed of 298 places in 291 ms of which 4 ms to minimize.
[2024-05-28 15:22:11] [INFO ] Deduced a trap composed of 288 places in 275 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1892 variables, and 66 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 30/30 constraints]
After SMT, in 64477ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 64489ms
Finished structural reductions in LTL mode , in 1 iterations and 118595 ms. Remains : 544/544 places, 1372/1372 transitions.
Stuttering acceptance computed with spot in 330 ms :[p2, p2, p2, p2, true, (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 754 ms.
Product exploration explored 100000 steps with 33333 reset in 547 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 p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-10 finished in 120286 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(G(p0))&&F(p1))))'
Support contains 57 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 108 place count 490 transition count 1282
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 180 place count 454 transition count 1282
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 186 place count 448 transition count 1276
Iterating global reduction 2 with 6 rules applied. Total rules applied 192 place count 448 transition count 1276
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 312 place count 388 transition count 1216
Applied a total of 312 rules in 76 ms. Remains 388 /544 variables (removed 156) and now considering 1216/1372 (removed 156) transitions.
Running 1212 sub problems to find dead transitions.
[2024-05-28 15:22:21] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
// Phase 1: matrix 1192 rows 388 cols
[2024-05-28 15:22:21] [INFO ] Computed 40 invariants in 28 ms
[2024-05-28 15:22:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-28 15:22:33] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:22:33] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:22:33] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:22:33] [INFO ] Deduced a trap composed of 50 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:22:33] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:22:34] [INFO ] Deduced a trap composed of 182 places in 259 ms of which 3 ms to minimize.
[2024-05-28 15:22:34] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 2 ms to minimize.
[2024-05-28 15:22:35] [INFO ] Deduced a trap composed of 175 places in 323 ms of which 2 ms to minimize.
[2024-05-28 15:22:35] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:22:44] [INFO ] Deduced a trap composed of 141 places in 217 ms of which 3 ms to minimize.
[2024-05-28 15:22:45] [INFO ] Deduced a trap composed of 177 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 47 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-28 15:22:51] [INFO ] Deduced a trap composed of 178 places in 261 ms of which 3 ms to minimize.
[2024-05-28 15:22:52] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:23:01] [INFO ] Deduced a trap composed of 145 places in 229 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1580 variables, and 50 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 14/14 constraints]
After SMT, in 44426ms problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 44443ms
[2024-05-28 15:23:06] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-28 15:23:06] [INFO ] Invariant cache hit.
[2024-05-28 15:23:06] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-28 15:23:06] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-28 15:23:06] [INFO ] Invariant cache hit.
[2024-05-28 15:23:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:23:10] [INFO ] Implicit Places using invariants and state equation in 4424 ms returned []
Implicit Place search using SMT with State Equation took 4771 ms to find 0 implicit places.
[2024-05-28 15:23:10] [INFO ] Redundant transitions in 12 ms returned []
Running 1212 sub problems to find dead transitions.
[2024-05-28 15:23:11] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-28 15:23:11] [INFO ] Invariant cache hit.
[2024-05-28 15:23:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-28 15:23:22] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2024-05-28 15:23:23] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:23:23] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:23:23] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:23:23] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:23:23] [INFO ] Deduced a trap composed of 172 places in 222 ms of which 2 ms to minimize.
[2024-05-28 15:23:24] [INFO ] Deduced a trap composed of 182 places in 206 ms of which 2 ms to minimize.
[2024-05-28 15:23:24] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:23:32] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 2 ms to minimize.
[2024-05-28 15:23:32] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2024-05-28 15:23:32] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 3 ms to minimize.
[2024-05-28 15:23:33] [INFO ] Deduced a trap composed of 144 places in 242 ms of which 3 ms to minimize.
[2024-05-28 15:23:33] [INFO ] Deduced a trap composed of 140 places in 204 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-28 15:23:36] [INFO ] Deduced a trap composed of 178 places in 229 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 50 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 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 TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 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 TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem 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 TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 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 TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 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 TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/387 variables, 3/53 constraints. Problems are: Problem set: 252 solved, 960 unsolved
[2024-05-28 15:24:08] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 3 ms to minimize.
[2024-05-28 15:24:10] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 2/55 constraints. Problems are: Problem set: 252 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/1580 variables, and 55 constraints, problems are : Problem set: 252 solved, 960 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 16/16 constraints]
After SMT, in 64526ms problems are : Problem set: 252 solved, 960 unsolved
Search for dead transitions found 252 dead transitions in 64541ms
Found 252 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 252 transitions
Dead transitions reduction (with SMT) removed 252 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 388/544 places, 964/1372 transitions.
Applied a total of 0 rules in 20 ms. Remains 388 /388 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2024-05-28 15:24:15] [INFO ] Redundant transitions in 11 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 113892 ms. Remains : 388/544 places, 964/1372 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-11
Stuttering criterion allowed to conclude after 3531 steps with 2 reset in 21 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-11 finished in 114071 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(p1)||p0)))'
Support contains 17 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
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 544 transition count 1330
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 502 transition count 1324
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 96 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 216 place count 436 transition count 1264
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 430 transition count 1258
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 430 transition count 1258
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 312 place count 388 transition count 1216
Applied a total of 312 rules in 61 ms. Remains 388 /544 variables (removed 156) and now considering 1216/1372 (removed 156) transitions.
Running 1212 sub problems to find dead transitions.
[2024-05-28 15:24:15] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
// Phase 1: matrix 1192 rows 388 cols
[2024-05-28 15:24:15] [INFO ] Computed 40 invariants in 37 ms
[2024-05-28 15:24:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-28 15:24:33] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 2 ms to minimize.
[2024-05-28 15:24:33] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 3 ms to minimize.
[2024-05-28 15:24:36] [INFO ] Deduced a trap composed of 110 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 38 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-28 15:24:42] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 1 ms to minimize.
[2024-05-28 15:24:42] [INFO ] Deduced a trap composed of 89 places in 190 ms of which 3 ms to minimize.
[2024-05-28 15:24:42] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:24:42] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 2 ms to minimize.
[2024-05-28 15:24:43] [INFO ] Deduced a trap composed of 144 places in 128 ms of which 1 ms to minimize.
[2024-05-28 15:24:44] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:24:44] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:24:44] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:24:50] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1580 variables, and 47 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 12/12 constraints]
After SMT, in 44968ms problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 44983ms
[2024-05-28 15:25:00] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-28 15:25:00] [INFO ] Invariant cache hit.
[2024-05-28 15:25:01] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-28 15:25:01] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-28 15:25:01] [INFO ] Invariant cache hit.
[2024-05-28 15:25:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:25:04] [INFO ] Implicit Places using invariants and state equation in 3051 ms returned []
Implicit Place search using SMT with State Equation took 3422 ms to find 0 implicit places.
[2024-05-28 15:25:04] [INFO ] Redundant transitions in 23 ms returned []
Running 1212 sub problems to find dead transitions.
[2024-05-28 15:25:04] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-28 15:25:04] [INFO ] Invariant cache hit.
[2024-05-28 15:25:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-28 15:25:21] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 3 ms to minimize.
[2024-05-28 15:25:24] [INFO ] Deduced a trap composed of 110 places in 188 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-28 15:25:26] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 2 ms to minimize.
[2024-05-28 15:25:32] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 2 ms to minimize.
[2024-05-28 15:25:32] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 40 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-28 15:25:41] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:25:41] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 2 ms to minimize.
[2024-05-28 15:25:41] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-28 15:25:52] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-28 15:26:03] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1580 variables, and 45 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 10/10 constraints]
After SMT, in 64454ms problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 64473ms
Starting structural reductions in SI_LTL mode, iteration 1 : 388/544 places, 1216/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112976 ms. Remains : 388/544 places, 1216/1372 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 765 ms.
Product exploration explored 100000 steps with 50000 reset in 531 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-12 finished in 114356 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 31 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
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 228 place count 430 transition count 1258
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 424 transition count 1252
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 424 transition count 1252
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 360 place count 364 transition count 1192
Applied a total of 360 rules in 38 ms. Remains 364 /544 variables (removed 180) and now considering 1192/1372 (removed 180) transitions.
Running 1188 sub problems to find dead transitions.
[2024-05-28 15:26:10] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
// Phase 1: matrix 1168 rows 364 cols
[2024-05-28 15:26:10] [INFO ] Computed 40 invariants in 34 ms
[2024-05-28 15:26:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-28 15:26:20] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:26:20] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:26:21] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:26:21] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:26:21] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:26:21] [INFO ] Deduced a trap composed of 155 places in 215 ms of which 3 ms to minimize.
[2024-05-28 15:26:21] [INFO ] Deduced a trap composed of 165 places in 262 ms of which 3 ms to minimize.
[2024-05-28 15:26:21] [INFO ] Deduced a trap composed of 209 places in 239 ms of which 2 ms to minimize.
[2024-05-28 15:26:22] [INFO ] Deduced a trap composed of 151 places in 268 ms of which 2 ms to minimize.
[2024-05-28 15:26:22] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:26:23] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 2 ms to minimize.
[2024-05-28 15:26:24] [INFO ] Deduced a trap composed of 170 places in 310 ms of which 2 ms to minimize.
[2024-05-28 15:26:24] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 2 ms to minimize.
[2024-05-28 15:26:29] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 2 ms to minimize.
[2024-05-28 15:26:32] [INFO ] Deduced a trap composed of 92 places in 212 ms of which 2 ms to minimize.
[2024-05-28 15:26:33] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 9.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 (/ 1.0 3.0))
(s112 (/ 1.0 3.0))
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 (/ 2.0 3.0))
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 (/ 2.0 3.0))
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 52 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-28 15:26:44] [INFO ] Deduced a trap composed of 120 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1532 variables, and 53 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 17/17 constraints]
After SMT, in 44269ms problems are : Problem set: 0 solved, 1188 unsolved
Search for dead transitions found 0 dead transitions in 44280ms
[2024-05-28 15:26:54] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-28 15:26:54] [INFO ] Invariant cache hit.
[2024-05-28 15:26:54] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-28 15:26:54] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-28 15:26:54] [INFO ] Invariant cache hit.
[2024-05-28 15:26:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:27:00] [INFO ] Implicit Places using invariants and state equation in 6230 ms returned []
Implicit Place search using SMT with State Equation took 6495 ms to find 0 implicit places.
[2024-05-28 15:27:00] [INFO ] Redundant transitions in 9 ms returned []
Running 1188 sub problems to find dead transitions.
[2024-05-28 15:27:00] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-28 15:27:00] [INFO ] Invariant cache hit.
[2024-05-28 15:27:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-28 15:27:11] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:27:11] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:27:11] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:27:12] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:27:12] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:27:12] [INFO ] Deduced a trap composed of 168 places in 265 ms of which 3 ms to minimize.
[2024-05-28 15:27:12] [INFO ] Deduced a trap composed of 177 places in 232 ms of which 2 ms to minimize.
[2024-05-28 15:27:12] [INFO ] Deduced a trap composed of 183 places in 221 ms of which 2 ms to minimize.
[2024-05-28 15:27:13] [INFO ] Deduced a trap composed of 156 places in 265 ms of which 2 ms to minimize.
[2024-05-28 15:27:13] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:27:14] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 2 ms to minimize.
[2024-05-28 15:27:22] [INFO ] Deduced a trap composed of 145 places in 187 ms of which 2 ms to minimize.
[2024-05-28 15:27:23] [INFO ] Deduced a trap composed of 103 places in 212 ms of which 2 ms to minimize.
[2024-05-28 15:27:24] [INFO ] Deduced a trap composed of 153 places in 196 ms of which 2 ms to minimize.
[2024-05-28 15:27:24] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 3 ms to minimize.
[2024-05-28 15:27:24] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-28 15:27:26] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 53 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 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 TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 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 TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/54 constraints. Problems are: Problem set: 90 solved, 1098 unsolved
[2024-05-28 15:28:01] [INFO ] Deduced a trap composed of 120 places in 233 ms of which 3 ms to minimize.
[2024-05-28 15:28:02] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 3 ms to minimize.
[2024-05-28 15:28:02] [INFO ] Deduced a trap composed of 57 places in 229 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 3/57 constraints. Problems are: Problem set: 90 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1532 variables, and 57 constraints, problems are : Problem set: 90 solved, 1098 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 20/20 constraints]
After SMT, in 64460ms problems are : Problem set: 90 solved, 1098 unsolved
Search for dead transitions found 90 dead transitions in 64472ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 364/544 places, 1102/1372 transitions.
Applied a total of 0 rules in 11 ms. Remains 364 /364 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
[2024-05-28 15:28:05] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 115333 ms. Remains : 364/544 places, 1102/1372 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-13
Stuttering criterion allowed to conclude after 219 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-13 finished in 115392 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 12 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 544 transition count 1324
Reduce places removed 48 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 496 transition count 1318
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 228 place count 430 transition count 1258
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 234 place count 424 transition count 1252
Iterating global reduction 3 with 6 rules applied. Total rules applied 240 place count 424 transition count 1252
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 3 with 108 rules applied. Total rules applied 348 place count 370 transition count 1198
Applied a total of 348 rules in 41 ms. Remains 370 /544 variables (removed 174) and now considering 1198/1372 (removed 174) transitions.
Running 1194 sub problems to find dead transitions.
[2024-05-28 15:28:05] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
// Phase 1: matrix 1174 rows 370 cols
[2024-05-28 15:28:05] [INFO ] Computed 40 invariants in 12 ms
[2024-05-28 15:28:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:28:17] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2024-05-28 15:28:17] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:28:17] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:28:17] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:28:17] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:28:17] [INFO ] Deduced a trap composed of 155 places in 219 ms of which 2 ms to minimize.
[2024-05-28 15:28:18] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:28:20] [INFO ] Deduced a trap composed of 177 places in 278 ms of which 2 ms to minimize.
[2024-05-28 15:28:27] [INFO ] Deduced a trap composed of 120 places in 178 ms of which 2 ms to minimize.
[2024-05-28 15:28:27] [INFO ] Deduced a trap composed of 118 places in 167 ms of which 2 ms to minimize.
[2024-05-28 15:28:28] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 2 ms to minimize.
[2024-05-28 15:28:28] [INFO ] Deduced a trap composed of 159 places in 223 ms of which 3 ms to minimize.
[2024-05-28 15:28:28] [INFO ] Deduced a trap composed of 142 places in 194 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 49 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:28:36] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 3 ms to minimize.
[2024-05-28 15:28:47] [INFO ] Deduced a trap composed of 184 places in 225 ms of which 2 ms to minimize.
[2024-05-28 15:28:49] [INFO ] Deduced a trap composed of 57 places in 253 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 52 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 16/16 constraints]
After SMT, in 44719ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 44730ms
[2024-05-28 15:28:50] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:28:50] [INFO ] Invariant cache hit.
[2024-05-28 15:28:50] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-28 15:28:50] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:28:50] [INFO ] Invariant cache hit.
[2024-05-28 15:28:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:28:54] [INFO ] Implicit Places using invariants and state equation in 4064 ms returned []
Implicit Place search using SMT with State Equation took 4390 ms to find 0 implicit places.
[2024-05-28 15:28:54] [INFO ] Redundant transitions in 10 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-05-28 15:28:54] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:28:54] [INFO ] Invariant cache hit.
[2024-05-28 15:28:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:29:06] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:29:06] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:29:06] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:29:06] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:29:06] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:29:06] [INFO ] Deduced a trap composed of 143 places in 223 ms of which 2 ms to minimize.
[2024-05-28 15:29:06] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 2 ms to minimize.
[2024-05-28 15:29:07] [INFO ] Deduced a trap composed of 186 places in 245 ms of which 2 ms to minimize.
[2024-05-28 15:29:16] [INFO ] Deduced a trap composed of 120 places in 246 ms of which 3 ms to minimize.
[2024-05-28 15:29:17] [INFO ] Deduced a trap composed of 126 places in 246 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:29:26] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 47 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:29:32] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-28 15:29:39] [INFO ] Deduced a trap composed of 184 places in 237 ms of which 2 ms to minimize.
[2024-05-28 15:29:41] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 5 (OVERLAPS) 3/369 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/1544 variables, and 53 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 14/14 constraints]
After SMT, in 64121ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 64132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 370/544 places, 1198/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113312 ms. Remains : 370/544 places, 1198/1372 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-14
Product exploration explored 100000 steps with 6768 reset in 433 ms.
Product exploration explored 100000 steps with 6770 reset in 413 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 57 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-28 15:30:00] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:30:00] [INFO ] Invariant cache hit.
[2024-05-28 15:30:00] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2024-05-28 15:30:00] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 46 ms returned sat
[2024-05-28 15:30:01] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2024-05-28 15:30:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:30:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-28 15:30:02] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 62 ms returned sat
[2024-05-28 15:30:04] [INFO ] [Nat]Absence check using state equation in 2037 ms returned sat
[2024-05-28 15:30:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:30:04] [INFO ] [Nat]Added 120 Read/Feed constraints in 315 ms returned sat
[2024-05-28 15:30:04] [INFO ] Computed and/alt/rep : 810/3427/792 causal constraints (skipped 378 transitions) in 104 ms.
[2024-05-28 15:30:09] [INFO ] Added : 220 causal constraints over 44 iterations in 5183 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 1198/1198 transitions.
Applied a total of 0 rules in 24 ms. Remains 370 /370 variables (removed 0) and now considering 1198/1198 (removed 0) transitions.
Running 1194 sub problems to find dead transitions.
[2024-05-28 15:30:09] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:30:09] [INFO ] Invariant cache hit.
[2024-05-28 15:30:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:30:21] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:30:21] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:30:21] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:30:21] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:30:21] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:30:22] [INFO ] Deduced a trap composed of 143 places in 302 ms of which 3 ms to minimize.
[2024-05-28 15:30:22] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 2 ms to minimize.
[2024-05-28 15:30:22] [INFO ] Deduced a trap composed of 186 places in 245 ms of which 3 ms to minimize.
[2024-05-28 15:30:31] [INFO ] Deduced a trap composed of 120 places in 219 ms of which 2 ms to minimize.
[2024-05-28 15:30:31] [INFO ] Deduced a trap composed of 126 places in 222 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 46 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:30:39] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-28 15:30:44] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 2 ms to minimize.
[2024-05-28 15:30:46] [INFO ] Deduced a trap composed of 184 places in 246 ms of which 3 ms to minimize.
[2024-05-28 15:30:48] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 3 ms to minimize.
[2024-05-28 15:30:48] [INFO ] Deduced a trap composed of 57 places in 246 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 51 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 15/15 constraints]
After SMT, in 44488ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 44505ms
[2024-05-28 15:30:54] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:30:54] [INFO ] Invariant cache hit.
[2024-05-28 15:30:54] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-28 15:30:54] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:30:54] [INFO ] Invariant cache hit.
[2024-05-28 15:30:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:30:58] [INFO ] Implicit Places using invariants and state equation in 4067 ms returned []
Implicit Place search using SMT with State Equation took 4416 ms to find 0 implicit places.
[2024-05-28 15:30:58] [INFO ] Redundant transitions in 22 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-05-28 15:30:58] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:30:58] [INFO ] Invariant cache hit.
[2024-05-28 15:30:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:31:10] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:31:10] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:31:10] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 3 ms to minimize.
[2024-05-28 15:31:10] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:31:10] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:31:10] [INFO ] Deduced a trap composed of 143 places in 315 ms of which 3 ms to minimize.
[2024-05-28 15:31:11] [INFO ] Deduced a trap composed of 47 places in 299 ms of which 3 ms to minimize.
[2024-05-28 15:31:11] [INFO ] Deduced a trap composed of 186 places in 263 ms of which 2 ms to minimize.
[2024-05-28 15:31:20] [INFO ] Deduced a trap composed of 120 places in 232 ms of which 3 ms to minimize.
[2024-05-28 15:31:20] [INFO ] Deduced a trap composed of 126 places in 219 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:31:29] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 2 ms to minimize.
[2024-05-28 15:31:31] [INFO ] Deduced a trap composed of 165 places in 236 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 48 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:31:37] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:31:57] [INFO ] Deduced a trap composed of 204 places in 217 ms of which 2 ms to minimize.
[2024-05-28 15:31:58] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 51 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 15/15 constraints]
After SMT, in 64744ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 64762ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113744 ms. Remains : 370/370 places, 1198/1198 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 68 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-28 15:32:03] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:32:03] [INFO ] Invariant cache hit.
[2024-05-28 15:32:04] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2024-05-28 15:32:04] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 46 ms returned sat
[2024-05-28 15:32:05] [INFO ] [Real]Absence check using state equation in 1118 ms returned sat
[2024-05-28 15:32:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:32:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-28 15:32:06] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 62 ms returned sat
[2024-05-28 15:32:08] [INFO ] [Nat]Absence check using state equation in 2026 ms returned sat
[2024-05-28 15:32:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:32:08] [INFO ] [Nat]Added 120 Read/Feed constraints in 319 ms returned sat
[2024-05-28 15:32:08] [INFO ] Computed and/alt/rep : 810/3427/792 causal constraints (skipped 378 transitions) in 98 ms.
[2024-05-28 15:32:13] [INFO ] Added : 220 causal constraints over 44 iterations in 5192 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6742 reset in 435 ms.
Product exploration explored 100000 steps with 6787 reset in 404 ms.
Built C files in :
/tmp/ltsmin16870890950244594009
[2024-05-28 15:32:14] [INFO ] Computing symmetric may disable matrix : 1198 transitions.
[2024-05-28 15:32:14] [INFO ] Computation of Complete disable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:32:14] [INFO ] Computing symmetric may enable matrix : 1198 transitions.
[2024-05-28 15:32:14] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:32:14] [INFO ] Computing Do-Not-Accords matrix : 1198 transitions.
[2024-05-28 15:32:14] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:32:15] [INFO ] Built C files in 422ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16870890950244594009
Running compilation step : cd /tmp/ltsmin16870890950244594009;'/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/ltsmin16870890950244594009;'/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/ltsmin16870890950244594009;'/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 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 1198/1198 transitions.
Applied a total of 0 rules in 32 ms. Remains 370 /370 variables (removed 0) and now considering 1198/1198 (removed 0) transitions.
Running 1194 sub problems to find dead transitions.
[2024-05-28 15:32:18] [INFO ] Flow matrix only has 1174 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/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 143 places in 242 ms of which 2 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 47 places in 277 ms of which 3 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 186 places in 265 ms of which 3 ms to minimize.
[2024-05-28 15:32:39] [INFO ] Deduced a trap composed of 120 places in 237 ms of which 3 ms to minimize.
[2024-05-28 15:32:40] [INFO ] Deduced a trap composed of 126 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 46 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:32:47] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-28 15:32:52] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 1 ms to minimize.
[2024-05-28 15:32:55] [INFO ] Deduced a trap composed of 184 places in 267 ms of which 3 ms to minimize.
[2024-05-28 15:32:56] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 3 ms to minimize.
[2024-05-28 15:32:56] [INFO ] Deduced a trap composed of 57 places in 245 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 51 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 15/15 constraints]
After SMT, in 44674ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 44696ms
[2024-05-28 15:33:02] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:33:02] [INFO ] Invariant cache hit.
[2024-05-28 15:33:03] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-28 15:33:03] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:33:03] [INFO ] Invariant cache hit.
[2024-05-28 15:33:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 15:33:06] [INFO ] Implicit Places using invariants and state equation in 3726 ms returned []
Implicit Place search using SMT with State Equation took 4005 ms to find 0 implicit places.
[2024-05-28 15:33:06] [INFO ] Redundant transitions in 25 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-05-28 15:33:06] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 15:33:06] [INFO ] Invariant cache hit.
[2024-05-28 15:33:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:33:17] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 1 ms to minimize.
[2024-05-28 15:33:17] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 2 ms to minimize.
[2024-05-28 15:33:17] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:33:17] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:33:17] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:33:18] [INFO ] Deduced a trap composed of 143 places in 288 ms of which 3 ms to minimize.
[2024-05-28 15:33:18] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 3 ms to minimize.
[2024-05-28 15:33:18] [INFO ] Deduced a trap composed of 186 places in 272 ms of which 2 ms to minimize.
[2024-05-28 15:33:28] [INFO ] Deduced a trap composed of 120 places in 230 ms of which 2 ms to minimize.
[2024-05-28 15:33:28] [INFO ] Deduced a trap composed of 126 places in 210 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:33:37] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 1 ms to minimize.
[2024-05-28 15:33:39] [INFO ] Deduced a trap composed of 165 places in 234 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 48 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:33:45] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 15:34:03] [INFO ] Deduced a trap composed of 204 places in 239 ms of which 3 ms to minimize.
[2024-05-28 15:34:04] [INFO ] Deduced a trap composed of 55 places in 267 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 51 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 15/15 constraints]
After SMT, in 64424ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 64444ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113218 ms. Remains : 370/370 places, 1198/1198 transitions.
Built C files in :
/tmp/ltsmin11180816565701515796
[2024-05-28 15:34:11] [INFO ] Computing symmetric may disable matrix : 1198 transitions.
[2024-05-28 15:34:11] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:34:11] [INFO ] Computing symmetric may enable matrix : 1198 transitions.
[2024-05-28 15:34:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:34:11] [INFO ] Computing Do-Not-Accords matrix : 1198 transitions.
[2024-05-28 15:34:11] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:34:11] [INFO ] Built C files in 266ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11180816565701515796
Running compilation step : cd /tmp/ltsmin11180816565701515796;'/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/ltsmin11180816565701515796;'/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/ltsmin11180816565701515796;'/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:34:14] [INFO ] Flatten gal took : 50 ms
[2024-05-28 15:34:14] [INFO ] Flatten gal took : 40 ms
[2024-05-28 15:34:14] [INFO ] Time to serialize gal into /tmp/LTL3764232283556901482.gal : 5 ms
[2024-05-28 15:34:14] [INFO ] Time to serialize properties into /tmp/LTL17279190924347687762.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3764232283556901482.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9139898063307240490.hoa' '-atoms' '/tmp/LTL17279190924347687762.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/LTL17279190924347687762.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9139898063307240490.hoa
Detected timeout of ITS tools.
[2024-05-28 15:34:29] [INFO ] Flatten gal took : 63 ms
[2024-05-28 15:34:29] [INFO ] Flatten gal took : 54 ms
[2024-05-28 15:34:29] [INFO ] Time to serialize gal into /tmp/LTL10559557614181264354.gal : 8 ms
[2024-05-28 15:34:29] [INFO ] Time to serialize properties into /tmp/LTL4864998138580651704.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/LTL10559557614181264354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4864998138580651704.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(((((TryAllocateOneTaskE_0>=1)&&(P_2318_0>=1))||((TryAllocateOneTaskE_1>=1)&&(P_2318_1>=1)))||(((TryAllocateOneTaskE_4>=1)&&(P_2...309
Formula 0 simplified : G!"(((((TryAllocateOneTaskE_0>=1)&&(P_2318_0>=1))||((TryAllocateOneTaskE_1>=1)&&(P_2318_1>=1)))||(((TryAllocateOneTaskE_4>=1)&&(P_23...305
Detected timeout of ITS tools.
[2024-05-28 15:34:45] [INFO ] Flatten gal took : 81 ms
[2024-05-28 15:34:45] [INFO ] Applying decomposition
[2024-05-28 15:34:45] [INFO ] Flatten gal took : 81 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/graph16857959684053039152.txt' '-o' '/tmp/graph16857959684053039152.bin' '-w' '/tmp/graph16857959684053039152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16857959684053039152.bin' '-l' '-1' '-v' '-w' '/tmp/graph16857959684053039152.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:34:45] [INFO ] Decomposing Gal with order
[2024-05-28 15:34:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:34:45] [INFO ] Removed a total of 696 redundant transitions.
[2024-05-28 15:34:45] [INFO ] Flatten gal took : 111 ms
[2024-05-28 15:34:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 171 labels/synchronizations in 8 ms.
[2024-05-28 15:34:45] [INFO ] Time to serialize gal into /tmp/LTL3598241373134063001.gal : 12 ms
[2024-05-28 15:34:45] [INFO ] Time to serialize properties into /tmp/LTL13013108717751589032.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/LTL3598241373134063001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13013108717751589032.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F("(((((i7.u29.TryAllocateOneTaskE_0>=1)&&(i6.u13.P_2318_0>=1))||((i7.u29.TryAllocateOneTaskE_1>=1)&&(i6.u18.P_2318_1>=1)))||(((i7....392
Formula 0 simplified : G!"(((((i7.u29.TryAllocateOneTaskE_0>=1)&&(i6.u13.P_2318_0>=1))||((i7.u29.TryAllocateOneTaskE_1>=1)&&(i6.u18.P_2318_1>=1)))||(((i7.u...388
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-14 finished in 414954 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)||((F(p1) U p2) U p3)))'
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)))'
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)))'
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(F(p1))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-28 15:35:01] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16439753764052868447
[2024-05-28 15:35:01] [INFO ] Computing symmetric may disable matrix : 1372 transitions.
[2024-05-28 15:35:01] [INFO ] Applying decomposition
[2024-05-28 15:35:01] [INFO ] Computation of Complete disable matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:35:01] [INFO ] Computing symmetric may enable matrix : 1372 transitions.
[2024-05-28 15:35:01] [INFO ] Flatten gal took : 59 ms
[2024-05-28 15:35:01] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph6386770711143644855.txt' '-o' '/tmp/graph6386770711143644855.bin' '-w' '/tmp/graph6386770711143644855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6386770711143644855.bin' '-l' '-1' '-v' '-w' '/tmp/graph6386770711143644855.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:35:01] [INFO ] Decomposing Gal with order
[2024-05-28 15:35:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:35:01] [INFO ] Removed a total of 1073 redundant transitions.
[2024-05-28 15:35:01] [INFO ] Flatten gal took : 91 ms
[2024-05-28 15:35:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 181 labels/synchronizations in 13 ms.
[2024-05-28 15:35:01] [INFO ] Time to serialize gal into /tmp/LTLFireability15662965462148590649.gal : 12 ms
[2024-05-28 15:35:01] [INFO ] Time to serialize properties into /tmp/LTLFireability4579039669005436244.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/LTLFireability15662965462148590649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4579039669005436244.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...277
Read 5 LTL properties
[2024-05-28 15:35:01] [INFO ] Computing Do-Not-Accords matrix : 1372 transitions.
[2024-05-28 15:35:01] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:35:01] [INFO ] Built C files in 561ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16439753764052868447
Running compilation step : cd /tmp/ltsmin16439753764052868447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !(((G("(((((i2.i3.u17.EnablePollingB_5<1)||(i2.i3.u109.cPollingAbort<1))&&((i2.i3.u17.EnablePollingB_1<1)||(i2.i3.u109.cPollingAbort<1...2846
Formula 0 simplified : F!"(((((i2.i3.u17.EnablePollingB_5<1)||(i2.i3.u109.cPollingAbort<1))&&((i2.i3.u17.EnablePollingB_1<1)||(i2.i3.u109.cPollingAbort<1))...2840
Compilation finished in 5826 ms.
Running link step : cd /tmp/ltsmin16439753764052868447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 116 ms.
Running LTSmin : cd /tmp/ltsmin16439753764052868447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp0==true))||((<>((LTLAPp1==true)) U (LTLAPp2==true)) U (LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16439753764052868447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp0==true))||((<>((LTLAPp1==true)) U (LTLAPp2==true)) U (LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16439753764052868447;'/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' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16439753764052868447;'/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' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16439753764052868447;'/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' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16439753764052868447;'/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' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16439753764052868447;'/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' '<>(([](<>((LTLAPp6==true)))||(LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16439753764052868447;'/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' '<>(([](<>((LTLAPp6==true)))||(LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16439753764052868447;'/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' '<>((LTLAPp7==true))' '--buchi-type=spotba'
LTSmin run took 123035 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin16439753764052868447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp0==true))||((<>((LTLAPp1==true)) U (LTLAPp2==true)) U (LTLAPp3==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S04J04T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S04J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446400124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J04T06.tgz
mv PolyORBLF-COL-S04J04T06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;