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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 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 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.6M 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-PT-S04J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716918354993

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 17:45:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:45:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:45:56] [INFO ] Load time of PNML (sax parser for PT used): 392 ms
[2024-05-28 17:45:57] [INFO ] Transformed 618 places.
[2024-05-28 17:45:57] [INFO ] Transformed 3190 transitions.
[2024-05-28 17:45:57] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 598 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1564
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 160 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 17:45:57] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 602 cols
[2024-05-28 17:45:57] [INFO ] Computed 50 invariants in 111 ms
[2024-05-28 17:45:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 17:46:19] [INFO ] Deduced a trap composed of 98 places in 257 ms of which 48 ms to minimize.
[2024-05-28 17:46:19] [INFO ] Deduced a trap composed of 134 places in 421 ms of which 4 ms to minimize.
[2024-05-28 17:46:20] [INFO ] Deduced a trap composed of 133 places in 248 ms of which 3 ms to minimize.
[2024-05-28 17:46:20] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 3 ms to minimize.
[2024-05-28 17:46:22] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 2 ms to minimize.
[2024-05-28 17:46:23] [INFO ] Deduced a trap composed of 288 places in 252 ms of which 10 ms to minimize.
[2024-05-28 17:46:23] [INFO ] Deduced a trap composed of 277 places in 237 ms of which 2 ms to minimize.
[2024-05-28 17:46:24] [INFO ] Deduced a trap composed of 282 places in 286 ms of which 8 ms to minimize.
SMT process timed out in 26279ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 26359ms
[2024-05-28 17:46:24] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 17:46:24] [INFO ] Invariant cache hit.
[2024-05-28 17:46:25] [INFO ] Implicit Places using invariants in 980 ms returned [135, 200, 326, 361, 478, 545]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 995 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/618 places, 1552/1564 transitions.
Applied a total of 0 rules in 31 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27634 ms. Remains : 596/618 places, 1552/1564 transitions.
Support contains 136 out of 596 places after structural reductions.
[2024-05-28 17:46:25] [INFO ] Flatten gal took : 227 ms
[2024-05-28 17:46:25] [INFO ] Flatten gal took : 152 ms
[2024-05-28 17:46:25] [INFO ] Input system was already deterministic with 1552 transitions.
Support contains 132 out of 596 places (down from 136) after GAL structural reductions.
RANDOM walk for 40001 steps (9 resets) in 2515 ms. (15 steps per ms) remains 9/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 271 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 290 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 263 ms. (151 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 385 ms. (103 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (9 resets) in 218 ms. (182 steps per ms) remains 9/9 properties
[2024-05-28 17:46:27] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 17:46:27] [INFO ] Computed 44 invariants in 49 ms
[2024-05-28 17:46:27] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 292/315 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 114/429 variables, 9/14 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 15/444 variables, 5/19 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 596/2124 variables, and 44 constraints, problems are : Problem set: 9 solved, 0 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 374ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1))&&F(G(p2)))))'
Support contains 60 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 21 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 17:46:28] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 17:46:28] [INFO ] Invariant cache hit.
[2024-05-28 17:46:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 17:46:48] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-05-28 17:46:48] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 45978ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 46005ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 17:47:14] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 17:47:14] [INFO ] Computed 44 invariants in 27 ms
[2024-05-28 17:47:15] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-28 17:47:15] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:47:15] [INFO ] Invariant cache hit.
[2024-05-28 17:47:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:47:30] [INFO ] Implicit Places using invariants and state equation in 14874 ms returned []
Implicit Place search using SMT with State Equation took 15485 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 transitions.
Applied a total of 0 rules in 52 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61571 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-02
Stuttering criterion allowed to conclude after 5886 steps with 0 reset in 50 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-02 finished in 62135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 31 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 12 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 17:47:30] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 17:47:30] [INFO ] Computed 44 invariants in 27 ms
[2024-05-28 17:47:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 17:47:47] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-28 17:47:47] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 17:48:13] [INFO ] Deduced a trap composed of 47 places in 320 ms of which 3 ms to minimize.
[2024-05-28 17:48:14] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 4 ms to minimize.
[2024-05-28 17:48:14] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:48:14] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(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 1)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(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 1)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(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 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(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 0)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 3)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 42 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 6/6 constraints]
After SMT, in 44728ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 44748ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 17:48:15] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 17:48:15] [INFO ] Computed 44 invariants in 26 ms
[2024-05-28 17:48:15] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-28 17:48:15] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:48:15] [INFO ] Invariant cache hit.
[2024-05-28 17:48:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:48:28] [INFO ] Implicit Places using invariants and state equation in 12936 ms returned []
Implicit Place search using SMT with State Equation took 13469 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58242 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-03
Product exploration explored 100000 steps with 731 reset in 631 ms.
Product exploration explored 100000 steps with 721 reset in 539 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 648 steps (0 resets) in 12 ms. (49 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 171 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 17:48:31] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:48:31] [INFO ] Invariant cache hit.
[2024-05-28 17:48:31] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2024-05-28 17:48:31] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 82 ms returned sat
[2024-05-28 17:48:33] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2024-05-28 17:48:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:48:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2024-05-28 17:48:34] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 73 ms returned sat
[2024-05-28 17:48:38] [INFO ] [Nat]Absence check using state equation in 4552 ms returned sat
[2024-05-28 17:48:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:48:40] [INFO ] [Nat]Added 120 Read/Feed constraints in 1403 ms returned sat
[2024-05-28 17:48:40] [INFO ] Deduced a trap composed of 82 places in 343 ms of which 4 ms to minimize.
[2024-05-28 17:48:41] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 3 ms to minimize.
[2024-05-28 17:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 3090 ms
Could not prove EG (NOT p0)
Support contains 12 out of 596 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Applied a total of 0 rules in 20 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-05-28 17:48:43] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:48:43] [INFO ] Invariant cache hit.
[2024-05-28 17:48:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:48:58] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-05-28 17:48:59] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:49:26] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 3 ms to minimize.
[2024-05-28 17:49:26] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:49:26] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
SMT process timed out in 43516ms, After SMT, problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 43544ms
[2024-05-28 17:49:26] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:49:26] [INFO ] Invariant cache hit.
[2024-05-28 17:49:27] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-28 17:49:27] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:49:27] [INFO ] Invariant cache hit.
[2024-05-28 17:49:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:49:41] [INFO ] Implicit Places using invariants and state equation in 14714 ms returned []
Implicit Place search using SMT with State Equation took 15231 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-05-28 17:49:41] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:49:41] [INFO ] Invariant cache hit.
[2024-05-28 17:49:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:49:56] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-28 17:49:56] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:50:34] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 4 ms to minimize.
[2024-05-28 17:50:34] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:50:34] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:50:34] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:50:34] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 2 ms to minimize.
[2024-05-28 17:50:34] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 3 ms to minimize.
(s90 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2034 variables, and 44 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 8/8 constraints]
After SMT, in 63195ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 63209ms
Finished structural reductions in LTL mode , in 1 iterations and 122015 ms. Remains : 596/596 places, 1462/1462 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 51 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 710 steps (0 resets) in 9 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 17:50:45] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:50:45] [INFO ] Invariant cache hit.
[2024-05-28 17:50:46] [INFO ] [Real]Absence check using 19 positive place invariants in 29 ms returned sat
[2024-05-28 17:50:46] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 88 ms returned sat
[2024-05-28 17:50:47] [INFO ] [Real]Absence check using state equation in 1301 ms returned sat
[2024-05-28 17:50:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:50:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2024-05-28 17:50:48] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 75 ms returned sat
[2024-05-28 17:50:52] [INFO ] [Nat]Absence check using state equation in 3969 ms returned sat
[2024-05-28 17:50:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:50:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 17:50:54] [INFO ] [Nat]Added 120 Read/Feed constraints in 1614 ms returned sat
[2024-05-28 17:50:54] [INFO ] Deduced a trap composed of 82 places in 336 ms of which 4 ms to minimize.
[2024-05-28 17:50:55] [INFO ] Deduced a trap composed of 39 places in 276 ms of which 3 ms to minimize.
[2024-05-28 17:50:55] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 3 ms to minimize.
[2024-05-28 17:50:57] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 3102 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 725 reset in 367 ms.
Product exploration explored 100000 steps with 717 reset in 364 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1462
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 30 place count 596 transition count 1510
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 66 place count 596 transition count 1510
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 584 transition count 1498
Deduced a syphon composed of 54 places in 2 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 584 transition count 1498
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 3 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 186 place count 584 transition count 1498
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 207 place count 563 transition count 1477
Deduced a syphon composed of 132 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 228 place count 563 transition count 1477
Deduced a syphon composed of 132 places in 2 ms
Applied a total of 228 rules in 262 ms. Remains 563 /596 variables (removed 33) and now considering 1477/1462 (removed -15) transitions.
Running 1473 sub problems to find dead transitions.
[2024-05-28 17:50:59] [INFO ] Flow matrix only has 1453 transitions (discarded 24 similar events)
// Phase 1: matrix 1453 rows 563 cols
[2024-05-28 17:50:59] [INFO ] Computed 44 invariants in 56 ms
[2024-05-28 17:50:59] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/559 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/559 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1473 unsolved
[2024-05-28 17:51:14] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 6 ms to minimize.
[2024-05-28 17:51:15] [INFO ] Deduced a trap composed of 144 places in 231 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-28 17:51:15] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-28 17:51:15] [INFO ] Deduced a trap composed of 150 places in 199 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
[2024-05-28 17:51:16] [INFO ] Deduced a trap composed of 27 places in 254 ms of which 3 ms to minimize.
[2024-05-28 17:51:17] [INFO ] Deduced a trap composed of 63 places in 236 ms of which 4 ms to minimize.
[2024-05-28 17:51:17] [INFO ] Deduced a trap composed of 61 places in 229 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-28 17:51:17] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.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 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 2.0)
(s69 1.0)
(s70 1.0)
(s71 1.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 1.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 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.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 1.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.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 2.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 1.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 6.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 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 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 559/2016 variables, and 47 constraints, problems are : Problem set: 99 solved, 1374 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1473/1473 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 99 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 11/11 constraints. Problems are: Problem set: 99 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/497 variables, 9/20 constraints. Problems are: Problem set: 99 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 8/28 constraints. Problems are: Problem set: 99 solved, 1374 unsolved
[2024-05-28 17:51:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 1/29 constraints. Problems are: Problem set: 99 solved, 1374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/497 variables, 0/29 constraints. Problems are: Problem set: 99 solved, 1374 unsolved
At refinement iteration 5 (OVERLAPS) 30/527 variables, 6/35 constraints. Problems are: Problem set: 99 solved, 1374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 2/37 constraints. Problems are: Problem set: 99 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/2016 variables, and 37 constraints, problems are : Problem set: 99 solved, 1374 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/1473 constraints, Known Traps: 9/9 constraints]
After SMT, in 43938ms problems are : Problem set: 99 solved, 1374 unsolved
Search for dead transitions found 99 dead transitions in 43961ms
Found 99 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 99 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 99 transitions.
[2024-05-28 17:51:43] [INFO ] Redundant transitions in 79 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 563/596 places, 1378/1462 transitions.
Graph (complete) has 3170 edges and 563 vertex of which 501 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.6 ms
Discarding 62 places :
Also discarding 0 output transitions
Deduced a syphon composed of 70 places in 2 ms
Applied a total of 1 rules in 46 ms. Remains 501 /563 variables (removed 62) and now considering 1378/1378 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 501/596 places, 1378/1462 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44361 ms. Remains : 501/596 places, 1378/1462 transitions.
Built C files in :
/tmp/ltsmin8985585374763374663
[2024-05-28 17:51:43] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8985585374763374663
Running compilation step : cd /tmp/ltsmin8985585374763374663;'/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/ltsmin8985585374763374663;'/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/ltsmin8985585374763374663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 12 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Applied a total of 0 rules in 17 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-05-28 17:51:46] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 17:51:46] [INFO ] Computed 44 invariants in 25 ms
[2024-05-28 17:51:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:51:59] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 2 ms to minimize.
[2024-05-28 17:52:00] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:52:14] [INFO ] Deduced a trap composed of 82 places in 300 ms of which 4 ms to minimize.
[2024-05-28 17:52:14] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 2 ms to minimize.
[2024-05-28 17:52:14] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 0 ms to minimize.
[2024-05-28 17:52:14] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 41 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 6/6 constraints]
After SMT, in 43641ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 43655ms
[2024-05-28 17:52:29] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:52:29] [INFO ] Invariant cache hit.
[2024-05-28 17:52:30] [INFO ] Implicit Places using invariants in 513 ms returned []
[2024-05-28 17:52:30] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:52:30] [INFO ] Invariant cache hit.
[2024-05-28 17:52:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:52:44] [INFO ] Implicit Places using invariants and state equation in 14409 ms returned []
Implicit Place search using SMT with State Equation took 14937 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-05-28 17:52:44] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:52:44] [INFO ] Invariant cache hit.
[2024-05-28 17:52:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:52:58] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 2 ms to minimize.
[2024-05-28 17:52:59] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:53:37] [INFO ] Deduced a trap composed of 33 places in 331 ms of which 3 ms to minimize.
[2024-05-28 17:53:37] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:53:38] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:53:38] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 1 ms to minimize.
[2024-05-28 17:53:38] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:53:38] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 11 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2034 variables, and 44 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 8/8 constraints]
After SMT, in 63827ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 63840ms
Finished structural reductions in LTL mode , in 1 iterations and 122455 ms. Remains : 596/596 places, 1462/1462 transitions.
Built C files in :
/tmp/ltsmin9721143441411932683
[2024-05-28 17:53:48] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9721143441411932683
Running compilation step : cd /tmp/ltsmin9721143441411932683;'/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/ltsmin9721143441411932683;'/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/ltsmin9721143441411932683;'/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 17:53:52] [INFO ] Flatten gal took : 140 ms
[2024-05-28 17:53:52] [INFO ] Flatten gal took : 80 ms
[2024-05-28 17:53:52] [INFO ] Time to serialize gal into /tmp/LTL1815673637982262973.gal : 38 ms
[2024-05-28 17:53:52] [INFO ] Time to serialize properties into /tmp/LTL8391100337182897210.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/LTL1815673637982262973.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11986288342493243148.hoa' '-atoms' '/tmp/LTL8391100337182897210.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/LTL8391100337182897210.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11986288342493243148.hoa
Detected timeout of ITS tools.
[2024-05-28 17:54:07] [INFO ] Flatten gal took : 119 ms
[2024-05-28 17:54:07] [INFO ] Flatten gal took : 92 ms
[2024-05-28 17:54:07] [INFO ] Time to serialize gal into /tmp/LTL1287357083263062722.gal : 36 ms
[2024-05-28 17:54:07] [INFO ] Time to serialize properties into /tmp/LTL11572593689835509780.ltl : 23 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/LTL1287357083263062722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11572593689835509780.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 : !((X((F("((((ScheduleTaskE_Idle_3+ScheduleTaskE_Idle_4)+(ScheduleTaskE_Idle_1+ScheduleTaskE_Idle_2))+(ScheduleTaskE_Idle_5+ScheduleTas...699
Formula 0 simplified : X(G!"((((ScheduleTaskE_Idle_3+ScheduleTaskE_Idle_4)+(ScheduleTaskE_Idle_1+ScheduleTaskE_Idle_2))+(ScheduleTaskE_Idle_5+ScheduleTaskE...691
Detected timeout of ITS tools.
[2024-05-28 17:54:22] [INFO ] Flatten gal took : 83 ms
[2024-05-28 17:54:22] [INFO ] Applying decomposition
[2024-05-28 17:54:22] [INFO ] Flatten gal took : 63 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/graph9016214253948824429.txt' '-o' '/tmp/graph9016214253948824429.bin' '-w' '/tmp/graph9016214253948824429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9016214253948824429.bin' '-l' '-1' '-v' '-w' '/tmp/graph9016214253948824429.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:54:23] [INFO ] Decomposing Gal with order
[2024-05-28 17:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:54:23] [INFO ] Removed a total of 1238 redundant transitions.
[2024-05-28 17:54:23] [INFO ] Flatten gal took : 313 ms
[2024-05-28 17:54:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 404 labels/synchronizations in 106 ms.
[2024-05-28 17:54:24] [INFO ] Time to serialize gal into /tmp/LTL14378596565933983520.gal : 13 ms
[2024-05-28 17:54:24] [INFO ] Time to serialize properties into /tmp/LTL18332968126388575620.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/LTL14378596565933983520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18332968126388575620.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...277
Read 1 LTL properties
Checking formula 0 : !((X((F("((((gu12.ScheduleTaskE_Idle_3+gu12.ScheduleTaskE_Idle_4)+(gu12.ScheduleTaskE_Idle_1+gu12.ScheduleTaskE_Idle_2))+(gu12.Schedul...859
Formula 0 simplified : X(G!"((((gu12.ScheduleTaskE_Idle_3+gu12.ScheduleTaskE_Idle_4)+(gu12.ScheduleTaskE_Idle_1+gu12.ScheduleTaskE_Idle_2))+(gu12.ScheduleT...851
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-03 finished in 428765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 48 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 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 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 336 place count 428 transition count 1384
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 339 place count 425 transition count 1381
Iterating global reduction 2 with 3 rules applied. Total rules applied 342 place count 425 transition count 1381
Applied a total of 342 rules in 135 ms. Remains 425 /596 variables (removed 171) and now considering 1381/1552 (removed 171) transitions.
Running 1377 sub problems to find dead transitions.
[2024-05-28 17:54:39] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
// Phase 1: matrix 1357 rows 425 cols
[2024-05-28 17:54:39] [INFO ] Computed 44 invariants in 22 ms
[2024-05-28 17:54:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 17:54:54] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 9 ms to minimize.
[2024-05-28 17:54:54] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 1 ms to minimize.
[2024-05-28 17:54:54] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 1 ms to minimize.
[2024-05-28 17:54:54] [INFO ] Deduced a trap composed of 151 places in 209 ms of which 2 ms to minimize.
[2024-05-28 17:54:54] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 2 ms to minimize.
[2024-05-28 17:54:54] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:54:55] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 0 ms to minimize.
[2024-05-28 17:54:55] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2024-05-28 17:54:55] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:54:55] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-28 17:54:55] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:54:55] [INFO ] Deduced a trap composed of 55 places in 322 ms of which 3 ms to minimize.
[2024-05-28 17:54:56] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 2 ms to minimize.
[2024-05-28 17:54:58] [INFO ] Deduced a trap composed of 132 places in 272 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 54 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 54 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 14/14 constraints]
After SMT, in 46671ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 46692ms
[2024-05-28 17:55:26] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 17:55:26] [INFO ] Invariant cache hit.
[2024-05-28 17:55:26] [INFO ] Implicit Places using invariants in 513 ms returned []
[2024-05-28 17:55:26] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 17:55:26] [INFO ] Invariant cache hit.
[2024-05-28 17:55:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:55:38] [INFO ] Implicit Places using invariants and state equation in 11713 ms returned []
Implicit Place search using SMT with State Equation took 12248 ms to find 0 implicit places.
[2024-05-28 17:55:38] [INFO ] Redundant transitions in 84 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-05-28 17:55:38] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 17:55:38] [INFO ] Invariant cache hit.
[2024-05-28 17:55:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 17:55:51] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:55:51] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 0 ms to minimize.
[2024-05-28 17:55:51] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:55:51] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:55:51] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:55:51] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:55:51] [INFO ] Deduced a trap composed of 151 places in 221 ms of which 3 ms to minimize.
[2024-05-28 17:55:52] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 2 ms to minimize.
[2024-05-28 17:55:52] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 2 ms to minimize.
[2024-05-28 17:55:52] [INFO ] Deduced a trap composed of 53 places in 30 ms of which 1 ms to minimize.
[2024-05-28 17:55:52] [INFO ] Deduced a trap composed of 132 places in 212 ms of which 2 ms to minimize.
[2024-05-28 17:55:54] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 1 ms to minimize.
[2024-05-28 17:56:02] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 2 ms to minimize.
[2024-05-28 17:56:03] [INFO ] Deduced a trap composed of 195 places in 208 ms of which 2 ms to minimize.
[2024-05-28 17:56:03] [INFO ] Deduced a trap composed of 235 places in 231 ms of which 2 ms to minimize.
[2024-05-28 17:56:03] [INFO ] Deduced a trap composed of 238 places in 243 ms of which 2 ms to minimize.
[2024-05-28 17:56:04] [INFO ] Deduced a trap composed of 211 places in 239 ms of which 2 ms to minimize.
[2024-05-28 17:56:04] [INFO ] Deduced a trap composed of 223 places in 241 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 58 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 58 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 18/18 constraints]
After SMT, in 65167ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 65181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 425/596 places, 1381/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124370 ms. Remains : 425/596 places, 1381/1552 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-04
Stuttering criterion allowed to conclude after 2755 steps with 0 reset in 13 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-04 finished in 124496 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 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 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 596 transition count 1522
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 566 transition count 1522
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 60 place count 566 transition count 1444
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 216 place count 488 transition count 1444
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 324 place count 434 transition count 1390
Applied a total of 324 rules in 66 ms. Remains 434 /596 variables (removed 162) and now considering 1390/1552 (removed 162) transitions.
Running 1386 sub problems to find dead transitions.
[2024-05-28 17:56:43] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
// Phase 1: matrix 1366 rows 434 cols
[2024-05-28 17:56:44] [INFO ] Computed 44 invariants in 18 ms
[2024-05-28 17:56:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 17:56:57] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-28 17:56:57] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 2 ms to minimize.
[2024-05-28 17:56:57] [INFO ] Deduced a trap composed of 62 places in 214 ms of which 2 ms to minimize.
[2024-05-28 17:56:58] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2024-05-28 17:57:06] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 2 ms to minimize.
[2024-05-28 17:57:06] [INFO ] Deduced a trap composed of 140 places in 207 ms of which 2 ms to minimize.
[2024-05-28 17:57:06] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 2 ms to minimize.
[2024-05-28 17:57:07] [INFO ] Deduced a trap composed of 133 places in 235 ms of which 2 ms to minimize.
[2024-05-28 17:57:07] [INFO ] Deduced a trap composed of 127 places in 238 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1800 variables, and 48 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 17:57:19] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:57:20] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:57:20] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:57:20] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1800 variables, and 52 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 13/13 constraints]
After SMT, in 44986ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 44999ms
[2024-05-28 17:57:28] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 17:57:28] [INFO ] Invariant cache hit.
[2024-05-28 17:57:29] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-05-28 17:57:29] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 17:57:29] [INFO ] Invariant cache hit.
[2024-05-28 17:57:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:57:38] [INFO ] Implicit Places using invariants and state equation in 9105 ms returned []
Implicit Place search using SMT with State Equation took 9690 ms to find 0 implicit places.
[2024-05-28 17:57:38] [INFO ] Redundant transitions in 30 ms returned []
Running 1386 sub problems to find dead transitions.
[2024-05-28 17:57:38] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 17:57:38] [INFO ] Invariant cache hit.
[2024-05-28 17:57:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 17:57:53] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-28 17:57:53] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 3 ms to minimize.
[2024-05-28 17:57:53] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 3 ms to minimize.
[2024-05-28 17:57:54] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 2 ms to minimize.
[2024-05-28 17:57:54] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 2 ms to minimize.
[2024-05-28 17:57:55] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-05-28 17:58:03] [INFO ] Deduced a trap composed of 140 places in 198 ms of which 2 ms to minimize.
[2024-05-28 17:58:04] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 1 ms to minimize.
[2024-05-28 17:58:04] [INFO ] Deduced a trap composed of 130 places in 175 ms of which 2 ms to minimize.
[2024-05-28 17:58:04] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 2 ms to minimize.
[2024-05-28 17:58:04] [INFO ] Deduced a trap composed of 128 places in 177 ms of which 2 ms to minimize.
[2024-05-28 17:58:05] [INFO ] Deduced a trap composed of 122 places in 204 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1800 variables, and 51 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 17:58:18] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:58:18] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:58:19] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 0 ms to minimize.
[2024-05-28 17:58:19] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:58:19] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1800 variables, and 56 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 17/17 constraints]
After SMT, in 66435ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 66446ms
Starting structural reductions in SI_LTL mode, iteration 1 : 434/596 places, 1390/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121245 ms. Remains : 434/596 places, 1390/1552 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-07
Product exploration explored 100000 steps with 5 reset in 415 ms.
Product exploration explored 100000 steps with 11 reset in 548 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 40000 steps (13 resets) in 460 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 169296 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 169296 steps, saw 113620 distinct states, run finished after 3007 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-28 17:58:49] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 17:58:49] [INFO ] Invariant cache hit.
[2024-05-28 17:58:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 293/305 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/373 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 432/1800 variables, and 43 constraints, problems are : Problem set: 1 solved, 0 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-07 finished in 125870 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) U (X(p1) U p2))&&p3)))'
Support contains 7 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 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 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 336 place count 428 transition count 1384
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 339 place count 425 transition count 1381
Iterating global reduction 2 with 3 rules applied. Total rules applied 342 place count 425 transition count 1381
Applied a total of 342 rules in 80 ms. Remains 425 /596 variables (removed 171) and now considering 1381/1552 (removed 171) transitions.
Running 1377 sub problems to find dead transitions.
[2024-05-28 17:58:49] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
// Phase 1: matrix 1357 rows 425 cols
[2024-05-28 17:58:49] [INFO ] Computed 44 invariants in 36 ms
[2024-05-28 17:58:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 17:59:02] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 2 ms to minimize.
[2024-05-28 17:59:02] [INFO ] Deduced a trap composed of 41 places in 365 ms of which 3 ms to minimize.
[2024-05-28 17:59:03] [INFO ] Deduced a trap composed of 52 places in 421 ms of which 2 ms to minimize.
[2024-05-28 17:59:03] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
[2024-05-28 17:59:03] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:59:03] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:59:03] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:59:03] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 0 ms to minimize.
[2024-05-28 17:59:04] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2024-05-28 17:59:04] [INFO ] Deduced a trap composed of 145 places in 216 ms of which 2 ms to minimize.
[2024-05-28 17:59:06] [INFO ] Deduced a trap composed of 82 places in 238 ms of which 2 ms to minimize.
[2024-05-28 17:59:06] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 2 ms to minimize.
[2024-05-28 17:59:06] [INFO ] Deduced a trap composed of 140 places in 226 ms of which 2 ms to minimize.
[2024-05-28 17:59:06] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 2 ms to minimize.
[2024-05-28 17:59:08] [INFO ] Deduced a trap composed of 206 places in 235 ms of which 2 ms to minimize.
[2024-05-28 17:59:15] [INFO ] Deduced a trap composed of 242 places in 220 ms of which 2 ms to minimize.
SMT process timed out in 25252ms, After SMT, problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 25268ms
[2024-05-28 17:59:15] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 17:59:15] [INFO ] Invariant cache hit.
[2024-05-28 17:59:15] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-28 17:59:15] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 17:59:15] [INFO ] Invariant cache hit.
[2024-05-28 17:59:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:59:26] [INFO ] Implicit Places using invariants and state equation in 11028 ms returned []
Implicit Place search using SMT with State Equation took 11448 ms to find 0 implicit places.
[2024-05-28 17:59:26] [INFO ] Redundant transitions in 29 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-05-28 17:59:26] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 17:59:26] [INFO ] Invariant cache hit.
[2024-05-28 17:59:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 17:59:39] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-05-28 17:59:39] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-05-28 17:59:39] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:59:39] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 0 ms to minimize.
[2024-05-28 17:59:40] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 3 ms to minimize.
[2024-05-28 17:59:40] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 2 ms to minimize.
[2024-05-28 17:59:40] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:59:40] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 1 ms to minimize.
[2024-05-28 17:59:40] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 17:59:40] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:59:40] [INFO ] Deduced a trap composed of 61 places in 229 ms of which 2 ms to minimize.
[2024-05-28 17:59:41] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2024-05-28 17:59:41] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 2 ms to minimize.
[2024-05-28 17:59:42] [INFO ] Deduced a trap composed of 143 places in 214 ms of which 2 ms to minimize.
[2024-05-28 17:59:42] [INFO ] Deduced a trap composed of 215 places in 238 ms of which 3 ms to minimize.
[2024-05-28 17:59:42] [INFO ] Deduced a trap composed of 253 places in 239 ms of which 3 ms to minimize.
[2024-05-28 17:59:43] [INFO ] Deduced a trap composed of 242 places in 235 ms of which 3 ms to minimize.
[2024-05-28 17:59:43] [INFO ] Deduced a trap composed of 200 places in 309 ms of which 2 ms to minimize.
[2024-05-28 17:59:43] [INFO ] Deduced a trap composed of 203 places in 242 ms of which 2 ms to minimize.
[2024-05-28 17:59:45] [INFO ] Deduced a trap composed of 194 places in 231 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 17:59:56] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 2 ms to minimize.
[2024-05-28 17:59:57] [INFO ] Deduced a trap composed of 210 places in 247 ms of which 2 ms to minimize.
[2024-05-28 17:59:57] [INFO ] Deduced a trap composed of 260 places in 222 ms of which 3 ms to minimize.
[2024-05-28 17:59:58] [INFO ] Deduced a trap composed of 258 places in 223 ms of which 3 ms to minimize.
[2024-05-28 17:59:58] [INFO ] Deduced a trap composed of 213 places in 265 ms of which 3 ms to minimize.
[2024-05-28 17:59:59] [INFO ] Deduced a trap composed of 184 places in 240 ms of which 2 ms to minimize.
[2024-05-28 18:00:00] [INFO ] Deduced a trap composed of 202 places in 210 ms of which 2 ms to minimize.
[2024-05-28 18:00:00] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 68 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 18:00:22] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 69 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 29/29 constraints]
After SMT, in 65440ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 65453ms
Starting structural reductions in SI_LTL mode, iteration 1 : 425/596 places, 1381/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102304 ms. Remains : 425/596 places, 1381/1552 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-08
Product exploration explored 100000 steps with 1908 reset in 627 ms.
Product exploration explored 100000 steps with 1937 reset in 525 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 p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1))), (X (NOT (AND p3 (NOT p2) p0))), (X (AND (NOT p2) p0)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT p3)), (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p3) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 168 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter insensitive) to 5 states, 21 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (10 resets) in 569 ms. (70 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40003 steps (10 resets) in 628 ms. (63 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 397 ms. (100 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 403 ms. (99 steps per ms) remains 3/3 properties
[2024-05-28 18:00:34] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:00:34] [INFO ] Invariant cache hit.
[2024-05-28 18:00:34] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem apf3 is UNSAT
Problem apf9 is UNSAT
Problem apf14 is UNSAT
After SMT solving in domain Real declared 7/1782 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 0/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1))), (X (NOT (AND p3 (NOT p2) p0))), (X (AND (NOT p2) p0)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT p3)), (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p3) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1)), (G (OR p0 p2 p3 p1)), (G (OR p0 p2 (NOT p3))), (G (AND (OR p0 p2 (NOT p3)) (OR p0 p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p2) p3) (AND p0 (NOT p2) p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (OR (NOT p0) p2 p3 p1))), (F (NOT (OR p3 p1))), (F (NOT (OR p0 p3))), (F (NOT p0)), (F (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p2) (NOT p3) p1)))), (F p2), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT p1)), (F (NOT (OR p0 p3 p1))), (F p3), (F (NOT (AND p0 (NOT p3))))]
Knowledge based reduction with 34 factoid took 772 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter insensitive) to 4 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
[2024-05-28 18:00:35] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:00:35] [INFO ] Invariant cache hit.
[2024-05-28 18:00:36] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 18:00:36] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 142 ms returned sat
[2024-05-28 18:00:38] [INFO ] [Real]Absence check using state equation in 2031 ms returned sat
[2024-05-28 18:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:00:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 20 ms returned sat
[2024-05-28 18:00:39] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 58 ms returned sat
[2024-05-28 18:00:44] [INFO ] [Nat]Absence check using state equation in 4675 ms returned unknown
Could not prove EG (NOT p3)
[2024-05-28 18:00:44] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:00:44] [INFO ] Invariant cache hit.
[2024-05-28 18:00:44] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-28 18:00:44] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 116 ms returned sat
[2024-05-28 18:00:45] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2024-05-28 18:00:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:00:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-28 18:00:46] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 36 ms returned sat
[2024-05-28 18:00:48] [INFO ] [Nat]Absence check using state equation in 1994 ms returned sat
[2024-05-28 18:00:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:00:48] [INFO ] [Nat]Added 120 Read/Feed constraints in 249 ms returned sat
[2024-05-28 18:00:48] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:00:49] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:00:49] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-28 18:00:49] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-28 18:00:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1223 ms
[2024-05-28 18:00:50] [INFO ] Computed and/alt/rep : 868/3966/850 causal constraints (skipped 503 transitions) in 170 ms.
[2024-05-28 18:00:59] [INFO ] Added : 302 causal constraints over 61 iterations in 9422 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 1381/1381 transitions.
Applied a total of 0 rules in 42 ms. Remains 425 /425 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Running 1377 sub problems to find dead transitions.
[2024-05-28 18:00:59] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:00:59] [INFO ] Invariant cache hit.
[2024-05-28 18:00:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 18:01:11] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-05-28 18:01:11] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-28 18:01:11] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:01:11] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:01:12] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 2 ms to minimize.
[2024-05-28 18:01:12] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 2 ms to minimize.
[2024-05-28 18:01:12] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 0 ms to minimize.
[2024-05-28 18:01:12] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 2 ms to minimize.
[2024-05-28 18:01:12] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-28 18:01:12] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 0 ms to minimize.
[2024-05-28 18:01:12] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 2 ms to minimize.
[2024-05-28 18:01:13] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
[2024-05-28 18:01:13] [INFO ] Deduced a trap composed of 137 places in 283 ms of which 3 ms to minimize.
[2024-05-28 18:01:14] [INFO ] Deduced a trap composed of 143 places in 328 ms of which 3 ms to minimize.
[2024-05-28 18:01:15] [INFO ] Deduced a trap composed of 215 places in 309 ms of which 3 ms to minimize.
[2024-05-28 18:01:15] [INFO ] Deduced a trap composed of 253 places in 264 ms of which 2 ms to minimize.
[2024-05-28 18:01:15] [INFO ] Deduced a trap composed of 242 places in 285 ms of which 2 ms to minimize.
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 200 places in 276 ms of which 2 ms to minimize.
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 203 places in 236 ms of which 3 ms to minimize.
[2024-05-28 18:01:18] [INFO ] Deduced a trap composed of 194 places in 230 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 (/ 2.0 3.0))
(s3 0.0)
(s4 0.0)
(s5 (/ 113.0 12.0))
(s6 0.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 (/ 7.0 12.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 1.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 (/ 5.0 12.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 (/ 7.0 12.0))
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.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 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.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 (/ 25.0 6.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 (/ 2.0 3.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 1.0)
(s190 (/ 5.0 12.0))
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 (/ 17.0 12.0))
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 (/ 5.0 12.0))
(s212 (/ 67.0 12.0))
(s213 0.0)
(s214 0.0)
(s215 (/ 7.0 12.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 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.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 (/ 1.0 3.0))
(s242 0.0)
(s243 1.0)
(s244 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 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.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 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 (/ 53.0 12.0))
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(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 (/ 1.0 3.0))
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 60 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 18:01:33] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 3 ms to minimize.
[2024-05-28 18:01:34] [INFO ] Deduced a trap composed of 207 places in 276 ms of which 2 ms to minimize.
[2024-05-28 18:01:37] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 2 ms to minimize.
[2024-05-28 18:01:43] [INFO ] Deduced a trap composed of 206 places in 198 ms of which 2 ms to minimize.
[2024-05-28 18:01:43] [INFO ] Deduced a trap composed of 203 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 65 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 25/25 constraints]
After SMT, in 44959ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 44978ms
[2024-05-28 18:01:44] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:01:44] [INFO ] Invariant cache hit.
[2024-05-28 18:01:44] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-28 18:01:44] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:01:44] [INFO ] Invariant cache hit.
[2024-05-28 18:01:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:01:55] [INFO ] Implicit Places using invariants and state equation in 10475 ms returned []
Implicit Place search using SMT with State Equation took 10978 ms to find 0 implicit places.
[2024-05-28 18:01:55] [INFO ] Redundant transitions in 49 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-05-28 18:01:55] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:01:55] [INFO ] Invariant cache hit.
[2024-05-28 18:01:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 18:02:07] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 1 ms to minimize.
[2024-05-28 18:02:07] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2024-05-28 18:02:08] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:02:08] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
[2024-05-28 18:02:08] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 3 ms to minimize.
[2024-05-28 18:02:08] [INFO ] Deduced a trap composed of 156 places in 245 ms of which 3 ms to minimize.
[2024-05-28 18:02:08] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:02:08] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2024-05-28 18:02:09] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-28 18:02:09] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 0 ms to minimize.
[2024-05-28 18:02:09] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 2 ms to minimize.
[2024-05-28 18:02:09] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 1 ms to minimize.
[2024-05-28 18:02:10] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 2 ms to minimize.
[2024-05-28 18:02:10] [INFO ] Deduced a trap composed of 143 places in 235 ms of which 2 ms to minimize.
[2024-05-28 18:02:11] [INFO ] Deduced a trap composed of 215 places in 283 ms of which 2 ms to minimize.
[2024-05-28 18:02:11] [INFO ] Deduced a trap composed of 253 places in 271 ms of which 2 ms to minimize.
[2024-05-28 18:02:11] [INFO ] Deduced a trap composed of 242 places in 250 ms of which 2 ms to minimize.
[2024-05-28 18:02:12] [INFO ] Deduced a trap composed of 200 places in 253 ms of which 2 ms to minimize.
[2024-05-28 18:02:12] [INFO ] Deduced a trap composed of 203 places in 248 ms of which 2 ms to minimize.
[2024-05-28 18:02:14] [INFO ] Deduced a trap composed of 194 places in 234 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 18:02:24] [INFO ] Deduced a trap composed of 222 places in 230 ms of which 2 ms to minimize.
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 210 places in 197 ms of which 3 ms to minimize.
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 260 places in 208 ms of which 2 ms to minimize.
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 258 places in 208 ms of which 2 ms to minimize.
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 213 places in 231 ms of which 3 ms to minimize.
[2024-05-28 18:02:26] [INFO ] Deduced a trap composed of 184 places in 228 ms of which 2 ms to minimize.
[2024-05-28 18:02:27] [INFO ] Deduced a trap composed of 202 places in 249 ms of which 2 ms to minimize.
[2024-05-28 18:02:27] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.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 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.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 1.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 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s80 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 68 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 18:02:49] [INFO ] Deduced a trap composed of 67 places in 187 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 69 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 29/29 constraints]
After SMT, in 65105ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 65122ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121200 ms. Remains : 425/425 places, 1381/1381 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 p3) (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p3))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT p3)), (X p0), (X p1), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 143 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter insensitive) to 4 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40002 steps (10 resets) in 323 ms. (123 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
[2024-05-28 18:03:00] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:03:00] [INFO ] Invariant cache hit.
[2024-05-28 18:03:00] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem apf5 is UNSAT
After SMT solving in domain Real declared 7/1782 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 12 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 0/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p3))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT p3)), (X p0), (X p1), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (G (OR p2 p3 p0 p1))]
False Knowledge obtained : [(F (NOT (OR p3 p0 p1))), (F (NOT (OR p2 p3 (NOT p0) p1))), (F (NOT (OR p3 p0))), (F (NOT (OR p3 (NOT p0) p1))), (F (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p3) p0))), (F (NOT p1)), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p1)))), (F p2), (F (NOT p0)), (F p3)]
Knowledge based reduction with 26 factoid took 530 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter insensitive) to 4 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
[2024-05-28 18:03:01] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:03:01] [INFO ] Invariant cache hit.
[2024-05-28 18:03:02] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 18:03:02] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 162 ms returned sat
[2024-05-28 18:03:04] [INFO ] [Real]Absence check using state equation in 2323 ms returned sat
[2024-05-28 18:03:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:03:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-28 18:03:05] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 58 ms returned sat
[2024-05-28 18:03:08] [INFO ] [Nat]Absence check using state equation in 3287 ms returned sat
[2024-05-28 18:03:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:03:09] [INFO ] [Nat]Added 120 Read/Feed constraints in 824 ms returned sat
[2024-05-28 18:03:09] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-28 18:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2024-05-28 18:03:10] [INFO ] Computed and/alt/rep : 868/3966/850 causal constraints (skipped 503 transitions) in 122 ms.
[2024-05-28 18:03:16] [INFO ] Added : 255 causal constraints over 51 iterations in 6913 ms. Result :sat
Could not prove EG (NOT p3)
[2024-05-28 18:03:16] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:03:16] [INFO ] Invariant cache hit.
[2024-05-28 18:03:17] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-28 18:03:18] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 116 ms returned sat
[2024-05-28 18:03:18] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2024-05-28 18:03:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:03:19] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-28 18:03:19] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 35 ms returned sat
[2024-05-28 18:03:21] [INFO ] [Nat]Absence check using state equation in 1995 ms returned sat
[2024-05-28 18:03:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:03:21] [INFO ] [Nat]Added 120 Read/Feed constraints in 258 ms returned sat
[2024-05-28 18:03:21] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 0 ms to minimize.
[2024-05-28 18:03:22] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 0 ms to minimize.
[2024-05-28 18:03:22] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-05-28 18:03:22] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:03:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1374 ms
[2024-05-28 18:03:23] [INFO ] Computed and/alt/rep : 868/3966/850 causal constraints (skipped 503 transitions) in 87 ms.
[2024-05-28 18:03:31] [INFO ] Added : 302 causal constraints over 61 iterations in 8807 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 1922 reset in 675 ms.
Product exploration explored 100000 steps with 1965 reset in 551 ms.
Built C files in :
/tmp/ltsmin16901826785144462732
[2024-05-28 18:03:33] [INFO ] Computing symmetric may disable matrix : 1381 transitions.
[2024-05-28 18:03:33] [INFO ] Computation of Complete disable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:03:33] [INFO ] Computing symmetric may enable matrix : 1381 transitions.
[2024-05-28 18:03:33] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:03:33] [INFO ] Computing Do-Not-Accords matrix : 1381 transitions.
[2024-05-28 18:03:33] [INFO ] Computation of Completed DNA matrix. took 120 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:03:33] [INFO ] Built C files in 623ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16901826785144462732
Running compilation step : cd /tmp/ltsmin16901826785144462732;'/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/ltsmin16901826785144462732;'/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/ltsmin16901826785144462732;'/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 7 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 1381/1381 transitions.
Applied a total of 0 rules in 35 ms. Remains 425 /425 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Running 1377 sub problems to find dead transitions.
[2024-05-28 18:03:37] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:03:37] [INFO ] Invariant cache hit.
[2024-05-28 18:03:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 18:03:48] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-28 18:03:48] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:03:48] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-28 18:03:49] [INFO ] Deduced a trap composed of 53 places in 30 ms of which 0 ms to minimize.
[2024-05-28 18:03:49] [INFO ] Deduced a trap composed of 52 places in 298 ms of which 3 ms to minimize.
[2024-05-28 18:03:49] [INFO ] Deduced a trap composed of 156 places in 259 ms of which 2 ms to minimize.
[2024-05-28 18:03:49] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-28 18:03:49] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2024-05-28 18:03:49] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 18:03:50] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-05-28 18:03:50] [INFO ] Deduced a trap composed of 61 places in 292 ms of which 3 ms to minimize.
[2024-05-28 18:03:50] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2024-05-28 18:03:51] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 2 ms to minimize.
[2024-05-28 18:03:51] [INFO ] Deduced a trap composed of 143 places in 206 ms of which 2 ms to minimize.
[2024-05-28 18:03:51] [INFO ] Deduced a trap composed of 215 places in 241 ms of which 2 ms to minimize.
[2024-05-28 18:03:52] [INFO ] Deduced a trap composed of 253 places in 268 ms of which 19 ms to minimize.
[2024-05-28 18:03:52] [INFO ] Deduced a trap composed of 242 places in 238 ms of which 2 ms to minimize.
[2024-05-28 18:03:52] [INFO ] Deduced a trap composed of 200 places in 233 ms of which 3 ms to minimize.
[2024-05-28 18:03:52] [INFO ] Deduced a trap composed of 203 places in 231 ms of which 2 ms to minimize.
[2024-05-28 18:03:54] [INFO ] Deduced a trap composed of 194 places in 250 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 60 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 18:04:11] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 14 ms to minimize.
[2024-05-28 18:04:12] [INFO ] Deduced a trap composed of 207 places in 256 ms of which 2 ms to minimize.
[2024-05-28 18:04:15] [INFO ] Deduced a trap composed of 242 places in 188 ms of which 2 ms to minimize.
[2024-05-28 18:04:20] [INFO ] Deduced a trap composed of 206 places in 198 ms of which 3 ms to minimize.
[2024-05-28 18:04:20] [INFO ] Deduced a trap composed of 203 places in 177 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 65 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 25/25 constraints]
After SMT, in 44794ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 44811ms
[2024-05-28 18:04:21] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:04:21] [INFO ] Invariant cache hit.
[2024-05-28 18:04:22] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-28 18:04:22] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:04:22] [INFO ] Invariant cache hit.
[2024-05-28 18:04:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:04:32] [INFO ] Implicit Places using invariants and state equation in 9851 ms returned []
Implicit Place search using SMT with State Equation took 10245 ms to find 0 implicit places.
[2024-05-28 18:04:32] [INFO ] Redundant transitions in 23 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-05-28 18:04:32] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 18:04:32] [INFO ] Invariant cache hit.
[2024-05-28 18:04:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 18:04:45] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 2 ms to minimize.
[2024-05-28 18:04:45] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2024-05-28 18:04:46] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-05-28 18:04:46] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 3 ms to minimize.
[2024-05-28 18:04:46] [INFO ] Deduced a trap composed of 52 places in 247 ms of which 3 ms to minimize.
[2024-05-28 18:04:46] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 3 ms to minimize.
[2024-05-28 18:04:46] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-28 18:04:46] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 1 ms to minimize.
[2024-05-28 18:04:47] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 18:04:47] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:04:47] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 3 ms to minimize.
[2024-05-28 18:04:47] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 2 ms to minimize.
[2024-05-28 18:04:48] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 2 ms to minimize.
[2024-05-28 18:04:48] [INFO ] Deduced a trap composed of 143 places in 243 ms of which 2 ms to minimize.
[2024-05-28 18:04:49] [INFO ] Deduced a trap composed of 215 places in 267 ms of which 3 ms to minimize.
[2024-05-28 18:04:49] [INFO ] Deduced a trap composed of 253 places in 267 ms of which 2 ms to minimize.
[2024-05-28 18:04:49] [INFO ] Deduced a trap composed of 242 places in 271 ms of which 3 ms to minimize.
[2024-05-28 18:04:50] [INFO ] Deduced a trap composed of 200 places in 274 ms of which 2 ms to minimize.
[2024-05-28 18:04:50] [INFO ] Deduced a trap composed of 203 places in 271 ms of which 2 ms to minimize.
[2024-05-28 18:04:52] [INFO ] Deduced a trap composed of 194 places in 284 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 18:05:03] [INFO ] Deduced a trap composed of 222 places in 252 ms of which 2 ms to minimize.
[2024-05-28 18:05:04] [INFO ] Deduced a trap composed of 210 places in 247 ms of which 2 ms to minimize.
[2024-05-28 18:05:04] [INFO ] Deduced a trap composed of 260 places in 235 ms of which 2 ms to minimize.
[2024-05-28 18:05:05] [INFO ] Deduced a trap composed of 258 places in 232 ms of which 2 ms to minimize.
[2024-05-28 18:05:05] [INFO ] Deduced a trap composed of 213 places in 266 ms of which 2 ms to minimize.
[2024-05-28 18:05:06] [INFO ] Deduced a trap composed of 184 places in 288 ms of which 2 ms to minimize.
[2024-05-28 18:05:07] [INFO ] Deduced a trap composed of 202 places in 215 ms of which 3 ms to minimize.
[2024-05-28 18:05:07] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 68 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 18:05:27] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 69 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 29/29 constraints]
After SMT, in 65451ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 65463ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 120594 ms. Remains : 425/425 places, 1381/1381 transitions.
Built C files in :
/tmp/ltsmin18214191108434287270
[2024-05-28 18:05:37] [INFO ] Computing symmetric may disable matrix : 1381 transitions.
[2024-05-28 18:05:37] [INFO ] Computation of Complete disable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:05:37] [INFO ] Computing symmetric may enable matrix : 1381 transitions.
[2024-05-28 18:05:37] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:05:38] [INFO ] Computing Do-Not-Accords matrix : 1381 transitions.
[2024-05-28 18:05:38] [INFO ] Computation of Completed DNA matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:05:38] [INFO ] Built C files in 557ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18214191108434287270
Running compilation step : cd /tmp/ltsmin18214191108434287270;'/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/ltsmin18214191108434287270;'/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/ltsmin18214191108434287270;'/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 18:05:41] [INFO ] Flatten gal took : 100 ms
[2024-05-28 18:05:41] [INFO ] Flatten gal took : 82 ms
[2024-05-28 18:05:41] [INFO ] Time to serialize gal into /tmp/LTL17252409677346454152.gal : 68 ms
[2024-05-28 18:05:41] [INFO ] Time to serialize properties into /tmp/LTL5745219523779209549.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/LTL17252409677346454152.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9936619408930804111.hoa' '-atoms' '/tmp/LTL5745219523779209549.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/LTL5745219523779209549.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9936619408930804111.hoa
Detected timeout of ITS tools.
[2024-05-28 18:05:56] [INFO ] Flatten gal took : 82 ms
[2024-05-28 18:05:56] [INFO ] Flatten gal took : 68 ms
[2024-05-28 18:05:56] [INFO ] Time to serialize gal into /tmp/LTL17186041114638748596.gal : 12 ms
[2024-05-28 18:05:56] [INFO ] Time to serialize properties into /tmp/LTL14056116392762338417.ltl : 19 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/LTL17186041114638748596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14056116392762338417.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...277
Read 1 LTL properties
Checking formula 0 : !((F(((G("((IdleTasks_4>Check_Sources_E_6)||(EnablePollingB_4>=1))"))U((X("(Abort_Check_Sources_E_3<=P_1717)"))U("(IdleTasks_4<=Check_...206
Formula 0 simplified : G(!"(MarkerWrite<=QueueJobE_2)" | (F!"((IdleTasks_4>Check_Sources_E_6)||(EnablePollingB_4>=1))" R (!"(IdleTasks_4<=Check_Sources_E_6...240
Detected timeout of ITS tools.
[2024-05-28 18:06:11] [INFO ] Flatten gal took : 91 ms
[2024-05-28 18:06:11] [INFO ] Applying decomposition
[2024-05-28 18:06:12] [INFO ] Flatten gal took : 69 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/graph8657882569082622608.txt' '-o' '/tmp/graph8657882569082622608.bin' '-w' '/tmp/graph8657882569082622608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8657882569082622608.bin' '-l' '-1' '-v' '-w' '/tmp/graph8657882569082622608.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:06:12] [INFO ] Decomposing Gal with order
[2024-05-28 18:06:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:06:12] [INFO ] Removed a total of 799 redundant transitions.
[2024-05-28 18:06:12] [INFO ] Flatten gal took : 352 ms
[2024-05-28 18:06:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 15 ms.
[2024-05-28 18:06:12] [INFO ] Time to serialize gal into /tmp/LTL9124022658231080525.gal : 9 ms
[2024-05-28 18:06:12] [INFO ] Time to serialize properties into /tmp/LTL10016449900704244114.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/LTL9124022658231080525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10016449900704244114.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(((G("((gu6.IdleTasks_4>gu6.Check_Sources_E_6)||(gi0.gu0.EnablePollingB_4>=1))"))U((X("(gu9.Abort_Check_Sources_E_3<=gu9.P_1717)")...246
Formula 0 simplified : G(!"(gu2.MarkerWrite<=gu2.QueueJobE_2)" | (F!"((gu6.IdleTasks_4>gu6.Check_Sources_E_6)||(gi0.gu0.EnablePollingB_4>=1))" R (!"(gu6.Id...288
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-08 finished in 458223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 18:06:28] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 18:06:28] [INFO ] Computed 44 invariants in 53 ms
[2024-05-28 18:06:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 18:06:43] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 2 ms to minimize.
[2024-05-28 18:06:43] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 3.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 4.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 2.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 2.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 timeout
0.0)
(s85 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 18:07:10] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 3 ms to minimize.
[2024-05-28 18:07:10] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 3 ms to minimize.
[2024-05-28 18:07:10] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 0 ms to minimize.
[2024-05-28 18:07:10] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 42 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 6/6 constraints]
After SMT, in 45278ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45293ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 18:07:13] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 18:07:13] [INFO ] Computed 44 invariants in 58 ms
[2024-05-28 18:07:13] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-28 18:07:13] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 18:07:13] [INFO ] Invariant cache hit.
[2024-05-28 18:07:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:07:26] [INFO ] Implicit Places using invariants and state equation in 12305 ms returned []
Implicit Place search using SMT with State Equation took 12872 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 transitions.
Applied a total of 0 rules in 13 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58190 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1013 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-09 finished in 58403 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)))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 9 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 18:07:26] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 18:07:26] [INFO ] Computed 44 invariants in 37 ms
[2024-05-28 18:07:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 18:07:44] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-05-28 18:07:45] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 18:08:11] [INFO ] Deduced a trap composed of 47 places in 300 ms of which 12 ms to minimize.
[2024-05-28 18:08:11] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 2 ms to minimize.
[2024-05-28 18:08:11] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 0 ms to minimize.
[2024-05-28 18:08:11] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(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 1)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(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 1)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 1)
(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 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 42 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 6/6 constraints]
After SMT, in 46425ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 46446ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 18:08:12] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 18:08:12] [INFO ] Computed 44 invariants in 24 ms
[2024-05-28 18:08:13] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-28 18:08:13] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 18:08:13] [INFO ] Invariant cache hit.
[2024-05-28 18:08:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:08:25] [INFO ] Implicit Places using invariants and state equation in 11781 ms returned []
Implicit Place search using SMT with State Equation took 12438 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 transitions.
Applied a total of 0 rules in 11 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58910 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-10 finished in 59029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 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 596 transition count 1522
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 566 transition count 1516
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 560 transition count 1516
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 72 place count 560 transition count 1438
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 228 place count 482 transition count 1438
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 300 place count 446 transition count 1402
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 303 place count 443 transition count 1399
Iterating global reduction 3 with 3 rules applied. Total rules applied 306 place count 443 transition count 1399
Applied a total of 306 rules in 95 ms. Remains 443 /596 variables (removed 153) and now considering 1399/1552 (removed 153) transitions.
Running 1395 sub problems to find dead transitions.
[2024-05-28 18:08:25] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
// Phase 1: matrix 1375 rows 443 cols
[2024-05-28 18:08:25] [INFO ] Computed 44 invariants in 20 ms
[2024-05-28 18:08:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-05-28 18:08:38] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 2 ms to minimize.
[2024-05-28 18:08:38] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 3 ms to minimize.
[2024-05-28 18:08:39] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-05-28 18:08:39] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-05-28 18:08:39] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 0 ms to minimize.
[2024-05-28 18:08:39] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-05-28 18:08:39] [INFO ] Deduced a trap composed of 240 places in 212 ms of which 2 ms to minimize.
[2024-05-28 18:08:39] [INFO ] Deduced a trap composed of 57 places in 33 ms of which 0 ms to minimize.
[2024-05-28 18:08:40] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 2 ms to minimize.
[2024-05-28 18:08:40] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 2 ms to minimize.
[2024-05-28 18:08:41] [INFO ] Deduced a trap composed of 186 places in 209 ms of which 2 ms to minimize.
[2024-05-28 18:08:41] [INFO ] Deduced a trap composed of 150 places in 218 ms of which 2 ms to minimize.
[2024-05-28 18:08:42] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 2 ms to minimize.
[2024-05-28 18:08:43] [INFO ] Deduced a trap composed of 196 places in 209 ms of which 2 ms to minimize.
[2024-05-28 18:08:43] [INFO ] Deduced a trap composed of 145 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1818 variables, and 55 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-05-28 18:08:57] [INFO ] Deduced a trap composed of 216 places in 247 ms of which 3 ms to minimize.
[2024-05-28 18:08:57] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 2 ms to minimize.
[2024-05-28 18:08:58] [INFO ] Deduced a trap composed of 169 places in 201 ms of which 2 ms to minimize.
[2024-05-28 18:08:59] [INFO ] Deduced a trap composed of 216 places in 233 ms of which 2 ms to minimize.
[2024-05-28 18:09:00] [INFO ] Deduced a trap composed of 244 places in 234 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1818 variables, and 60 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1395 constraints, Known Traps: 20/20 constraints]
After SMT, in 44143ms problems are : Problem set: 0 solved, 1395 unsolved
Search for dead transitions found 0 dead transitions in 44158ms
[2024-05-28 18:09:09] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
[2024-05-28 18:09:09] [INFO ] Invariant cache hit.
[2024-05-28 18:09:10] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-05-28 18:09:10] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
[2024-05-28 18:09:10] [INFO ] Invariant cache hit.
[2024-05-28 18:09:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:09:20] [INFO ] Implicit Places using invariants and state equation in 10189 ms returned []
Implicit Place search using SMT with State Equation took 10783 ms to find 0 implicit places.
[2024-05-28 18:09:20] [INFO ] Redundant transitions in 24 ms returned []
Running 1395 sub problems to find dead transitions.
[2024-05-28 18:09:20] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
[2024-05-28 18:09:20] [INFO ] Invariant cache hit.
[2024-05-28 18:09:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-05-28 18:09:35] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 2 ms to minimize.
[2024-05-28 18:09:35] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 3 ms to minimize.
[2024-05-28 18:09:35] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 2 ms to minimize.
[2024-05-28 18:09:35] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-28 18:09:35] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-28 18:09:35] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 3 ms to minimize.
[2024-05-28 18:09:36] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:09:36] [INFO ] Deduced a trap composed of 240 places in 347 ms of which 3 ms to minimize.
[2024-05-28 18:09:37] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 2 ms to minimize.
[2024-05-28 18:09:37] [INFO ] Deduced a trap composed of 38 places in 321 ms of which 4 ms to minimize.
[2024-05-28 18:09:38] [INFO ] Deduced a trap composed of 187 places in 326 ms of which 4 ms to minimize.
[2024-05-28 18:09:39] [INFO ] Deduced a trap composed of 150 places in 319 ms of which 3 ms to minimize.
[2024-05-28 18:09:40] [INFO ] Deduced a trap composed of 137 places in 312 ms of which 4 ms to minimize.
[2024-05-28 18:09:40] [INFO ] Deduced a trap composed of 69 places in 276 ms of which 3 ms to minimize.
[2024-05-28 18:09:42] [INFO ] Deduced a trap composed of 288 places in 290 ms of which 4 ms to minimize.
[2024-05-28 18:09:42] [INFO ] Deduced a trap composed of 206 places in 262 ms of which 4 ms to minimize.
[2024-05-28 18:09:42] [INFO ] Deduced a trap composed of 181 places in 261 ms of which 3 ms to minimize.
[2024-05-28 18:09:43] [INFO ] Deduced a trap composed of 246 places in 252 ms of which 2 ms to minimize.
[2024-05-28 18:09:43] [INFO ] Deduced a trap composed of 160 places in 265 ms of which 3 ms to minimize.
[2024-05-28 18:09:53] [INFO ] Deduced a trap composed of 239 places in 233 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-05-28 18:09:54] [INFO ] Deduced a trap composed of 136 places in 231 ms of which 3 ms to minimize.
[2024-05-28 18:09:55] [INFO ] Deduced a trap composed of 169 places in 247 ms of which 3 ms to minimize.
[2024-05-28 18:09:55] [INFO ] Deduced a trap composed of 229 places in 263 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1818 variables, and 63 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 23/63 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-05-28 18:10:08] [INFO ] Deduced a trap composed of 224 places in 241 ms of which 2 ms to minimize.
[2024-05-28 18:10:08] [INFO ] Deduced a trap composed of 217 places in 226 ms of which 2 ms to minimize.
[2024-05-28 18:10:08] [INFO ] Deduced a trap composed of 249 places in 240 ms of which 2 ms to minimize.
[2024-05-28 18:10:08] [INFO ] Deduced a trap composed of 235 places in 244 ms of which 2 ms to minimize.
[2024-05-28 18:10:09] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 2 ms to minimize.
[2024-05-28 18:10:22] [INFO ] Deduced a trap composed of 255 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1818 variables, and 69 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1395 constraints, Known Traps: 29/29 constraints]
After SMT, in 66346ms problems are : Problem set: 0 solved, 1395 unsolved
Search for dead transitions found 0 dead transitions in 66365ms
Starting structural reductions in SI_LTL mode, iteration 1 : 443/596 places, 1399/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121442 ms. Remains : 443/596 places, 1399/1552 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-14
Stuttering criterion allowed to conclude after 7714 steps with 0 reset in 38 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-14 finished in 121545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U (X(p1) U p2))&&p3)))'
[2024-05-28 18:10:27] [INFO ] Flatten gal took : 50 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10597933505493137021
[2024-05-28 18:10:27] [INFO ] Too many transitions (1552) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:10:27] [INFO ] Applying decomposition
[2024-05-28 18:10:27] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10597933505493137021
Running compilation step : cd /tmp/ltsmin10597933505493137021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 18:10:27] [INFO ] Flatten gal took : 103 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/graph11782273333042991973.txt' '-o' '/tmp/graph11782273333042991973.bin' '-w' '/tmp/graph11782273333042991973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11782273333042991973.bin' '-l' '-1' '-v' '-w' '/tmp/graph11782273333042991973.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:10:27] [INFO ] Decomposing Gal with order
[2024-05-28 18:10:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:10:27] [INFO ] Removed a total of 1306 redundant transitions.
[2024-05-28 18:10:27] [INFO ] Flatten gal took : 226 ms
[2024-05-28 18:10:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 347 labels/synchronizations in 43 ms.
[2024-05-28 18:10:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality116661757590517165.gal : 90 ms
[2024-05-28 18:10:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality4889118926381815059.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/LTLCardinality116661757590517165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4889118926381815059.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...296
Read 2 LTL properties
Checking formula 0 : !((X((F("((((gu15.ScheduleTaskE_Idle_3+gu15.ScheduleTaskE_Idle_4)+(gu15.ScheduleTaskE_Idle_1+gu15.ScheduleTaskE_Idle_2))+(gu15.Schedul...959
Formula 0 simplified : X(G!"((((gu15.ScheduleTaskE_Idle_3+gu15.ScheduleTaskE_Idle_4)+(gu15.ScheduleTaskE_Idle_1+gu15.ScheduleTaskE_Idle_2))+(gu15.ScheduleT...951
Compilation finished in 4850 ms.
Running link step : cd /tmp/ltsmin10597933505493137021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10597933505493137021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 10160 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin10597933505493137021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((([]((LTLAPp2==true)) U (X((LTLAPp3==true)) U (LTLAPp4==true)))&&(LTLAPp5==true)))' '--buchi-type=spotba'
LTSmin run took 1175 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1487047 ms.

BK_STOP 1716919843621

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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