Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 13:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 13:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 Railroad-PT-050-LTLFireability-00
FORMULA_NAME Railroad-PT-050-LTLFireability-01
FORMULA_NAME Railroad-PT-050-LTLFireability-02
FORMULA_NAME Railroad-PT-050-LTLFireability-03
FORMULA_NAME Railroad-PT-050-LTLFireability-04
FORMULA_NAME Railroad-PT-050-LTLFireability-05
FORMULA_NAME Railroad-PT-050-LTLFireability-06
FORMULA_NAME Railroad-PT-050-LTLFireability-07
FORMULA_NAME Railroad-PT-050-LTLFireability-08
FORMULA_NAME Railroad-PT-050-LTLFireability-09
FORMULA_NAME Railroad-PT-050-LTLFireability-10
FORMULA_NAME Railroad-PT-050-LTLFireability-11
FORMULA_NAME Railroad-PT-050-LTLFireability-12
FORMULA_NAME Railroad-PT-050-LTLFireability-13
FORMULA_NAME Railroad-PT-050-LTLFireability-14
FORMULA_NAME Railroad-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716698209192

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 04:36:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 04:36:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 04:36:50] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-05-26 04:36:50] [INFO ] Transformed 518 places.
[2024-05-26 04:36:50] [INFO ] Transformed 2756 transitions.
[2024-05-26 04:36:50] [INFO ] Found NUPN structural information;
[2024-05-26 04:36:50] [INFO ] Parsed PT model containing 518 places and 2756 transitions and 16378 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 151 places in 31 ms
Reduce places removed 151 places and 50 transitions.
FORMULA Railroad-PT-050-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 2706/2706 transitions.
Ensure Unique test removed 52 places
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 315 transition count 2706
Applied a total of 52 rules in 60 ms. Remains 315 /367 variables (removed 52) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 315 cols
[2024-05-26 04:36:50] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-26 04:36:51] [INFO ] Implicit Places using invariants in 458 ms returned []
// Phase 1: matrix 2706 rows 315 cols
[2024-05-26 04:36:51] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-26 04:36:53] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 159, 163, 164, 165, 167, 168, 170, 172, 175, 228, 231, 235, 245, 246, 247, 248, 252, 265, 269, 271, 273, 275, 277, 278, 279, 281, 291, 294, 301, 302]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 2262 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/367 places, 2706/2706 transitions.
Applied a total of 0 rules in 20 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2359 ms. Remains : 260/367 places, 2706/2706 transitions.
Support contains 44 out of 260 places after structural reductions.
[2024-05-26 04:36:53] [INFO ] Flatten gal took : 240 ms
[2024-05-26 04:36:53] [INFO ] Flatten gal took : 147 ms
[2024-05-26 04:36:54] [INFO ] Input system was already deterministic with 2706 transitions.
Support contains 39 out of 260 places (down from 44) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (8 resets) in 2279 ms. (17 steps per ms) remains 11/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:36:55] [INFO ] Invariants computation overflowed in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1209/1230 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1230 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 4 (OVERLAPS) 1604/2834 variables, 147/189 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2834 variables, 147/336 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-26 04:36:56] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2834 variables, 1/337 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2834 variables, 0/337 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 132/2966 variables, 92/429 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 92/521 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-26 04:36:57] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2966 variables, 1/522 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2966/2966 variables, and 522 constraints, problems are : Problem set: 2 solved, 7 unsolved in 4470 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 887/902 variables, 15/30 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/902 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1926/2828 variables, 150/180 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2828 variables, 150/330 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2828 variables, 7/337 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2828 variables, 1/338 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2828 variables, 0/338 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 138/2966 variables, 95/433 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2966 variables, 95/528 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2966 variables, 1/529 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2966 variables, 0/529 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/2966 variables, 0/529 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2966/2966 variables, and 529 constraints, problems are : Problem set: 2 solved, 7 unsolved in 3233 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 7819ms problems are : Problem set: 2 solved, 7 unsolved
Finished Parikh walk after 26352 steps, including 246 resets, run visited all 5 properties in 352 ms. (steps per millisecond=74 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 5 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 3545 ms.
FORMULA Railroad-PT-050-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA Railroad-PT-050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 15 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:37:07] [INFO ] Invariants computation overflowed in 19 ms
[2024-05-26 04:37:07] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:37:07] [INFO ] Invariants computation overflowed in 6 ms
[2024-05-26 04:37:08] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:37:08] [INFO ] Invariants computation overflowed in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (OVERLAPS) 2706/2916 variables, 210/420 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
[2024-05-26 04:37:41] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-26 04:37:43] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 2 ms to minimize.
[2024-05-26 04:37:44] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2916/2966 variables, and 423 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30055 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 3 (OVERLAPS) 2706/2916 variables, 210/423 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2916 variables, 105/528 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2916/2966 variables, and 528 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30043 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 105/2656 constraints, Known Traps: 3/3 constraints]
After SMT, in 68700ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 68728ms
Finished structural reductions in LTL mode , in 1 iterations and 70246 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA Railroad-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-050-LTLFireability-00 finished in 70553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 28 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:38:17] [INFO ] Invariants computation overflowed in 7 ms
[2024-05-26 04:38:17] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:38:17] [INFO ] Invariants computation overflowed in 17 ms
[2024-05-26 04:38:19] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1450 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:38:19] [INFO ] Invariants computation overflowed in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (OVERLAPS) 2706/2916 variables, 210/420 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
[2024-05-26 04:38:52] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-05-26 04:38:54] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 2 ms to minimize.
[2024-05-26 04:38:55] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2916/2966 variables, and 423 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30054 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 3 (OVERLAPS) 2706/2916 variables, 210/423 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2916 variables, 105/528 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2916/2966 variables, and 528 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30039 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 105/2656 constraints, Known Traps: 3/3 constraints]
After SMT, in 68515ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 68543ms
Finished structural reductions in LTL mode , in 1 iterations and 70034 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 89 ms :[p0, p0]
Running random walk in product with property : Railroad-PT-050-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 713 ms.
Product exploration explored 100000 steps with 50000 reset in 535 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-050-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-03 finished in 71435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 258 transition count 2654
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 208 transition count 2654
Applied a total of 104 rules in 706 ms. Remains 208 /260 variables (removed 52) and now considering 2654/2706 (removed 52) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 04:39:29] [INFO ] Invariants computation overflowed in 4 ms
[2024-05-26 04:39:29] [INFO ] Implicit Places using invariants in 234 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 04:39:29] [INFO ] Invariants computation overflowed in 6 ms
[2024-05-26 04:39:30] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
[2024-05-26 04:39:31] [INFO ] Redundant transitions in 140 ms returned []
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 04:39:31] [INFO ] Invariants computation overflowed in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (OVERLAPS) 2654/2812 variables, 158/316 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
[2024-05-26 04:40:04] [INFO ] Deduced a trap composed of 51 places in 51 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 2812/2862 variables, and 317 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30039 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 3 (OVERLAPS) 2654/2812 variables, 158/317 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2812 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2812/2862 variables, and 370 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30044 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 53/2604 constraints, Known Traps: 1/1 constraints]
After SMT, in 68819ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 68842ms
Starting structural reductions in SI_LTL mode, iteration 1 : 208/260 places, 2654/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70990 ms. Remains : 208/260 places, 2654/2706 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 966 ms.
Product exploration explored 100000 steps with 0 reset in 1001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 66 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
RANDOM walk for 24869 steps (5 resets) in 400 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Support contains 3 out of 208 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 426 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 04:40:42] [INFO ] Invariants computation overflowed in 10 ms
[2024-05-26 04:40:43] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 04:40:43] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 04:40:44] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
[2024-05-26 04:40:44] [INFO ] Redundant transitions in 149 ms returned []
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 04:40:44] [INFO ] Invariants computation overflowed in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (OVERLAPS) 2654/2812 variables, 158/316 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
[2024-05-26 04:41:17] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2812/2862 variables, and 317 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30044 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 3 (OVERLAPS) 2654/2812 variables, 158/317 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2812 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2812/2862 variables, and 370 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30053 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 53/2604 constraints, Known Traps: 1/1 constraints]
After SMT, in 68205ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 68229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70057 ms. Remains : 208/208 places, 2654/2654 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
RANDOM walk for 30467 steps (6 resets) in 388 ms. (78 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 910 ms.
Product exploration explored 100000 steps with 0 reset in 1026 ms.
Built C files in :
/tmp/ltsmin13669390366710341399
[2024-05-26 04:41:55] [INFO ] Too many transitions (2654) to apply POR reductions. Disabling POR matrices.
[2024-05-26 04:41:55] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13669390366710341399
Running compilation step : cd /tmp/ltsmin13669390366710341399;'/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/ltsmin13669390366710341399;'/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/ltsmin13669390366710341399;'/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 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 208 transition count 2653
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 2653
Applied a total of 2 rules in 501 ms. Remains 207 /208 variables (removed 1) and now considering 2653/2654 (removed 1) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:41:58] [INFO ] Invariants computation overflowed in 11 ms
[2024-05-26 04:41:58] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:41:58] [INFO ] Invariants computation overflowed in 4 ms
[2024-05-26 04:42:00] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
[2024-05-26 04:42:00] [INFO ] Redundant transitions in 76 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:42:00] [INFO ] Invariants computation overflowed in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (OVERLAPS) 2653/2810 variables, 157/314 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
[2024-05-26 04:42:33] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/2860 variables, and 315 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30041 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 3 (OVERLAPS) 2653/2810 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2810 variables, 52/367 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/2860 variables, and 367 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30065 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 52/2603 constraints, Known Traps: 1/1 constraints]
After SMT, in 68345ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 68366ms
Starting structural reductions in SI_LTL mode, iteration 1 : 207/208 places, 2653/2654 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70370 ms. Remains : 207/208 places, 2653/2654 transitions.
Built C files in :
/tmp/ltsmin10887229030536107704
[2024-05-26 04:43:08] [INFO ] Too many transitions (2653) to apply POR reductions. Disabling POR matrices.
[2024-05-26 04:43:08] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10887229030536107704
Running compilation step : cd /tmp/ltsmin10887229030536107704;'/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/ltsmin10887229030536107704;'/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/ltsmin10887229030536107704;'/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-26 04:43:11] [INFO ] Flatten gal took : 89 ms
[2024-05-26 04:43:11] [INFO ] Flatten gal took : 98 ms
[2024-05-26 04:43:12] [INFO ] Time to serialize gal into /tmp/LTL4736103916190198201.gal : 34 ms
[2024-05-26 04:43:12] [INFO ] Time to serialize properties into /tmp/LTL8230438749323487886.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/LTL4736103916190198201.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18356010771034870367.hoa' '-atoms' '/tmp/LTL8230438749323487886.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/LTL8230438749323487886.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18356010771034870367.hoa
Detected timeout of ITS tools.
[2024-05-26 04:43:27] [INFO ] Flatten gal took : 73 ms
[2024-05-26 04:43:27] [INFO ] Flatten gal took : 73 ms
[2024-05-26 04:43:27] [INFO ] Time to serialize gal into /tmp/LTL5916591027662436520.gal : 19 ms
[2024-05-26 04:43:27] [INFO ] Time to serialize properties into /tmp/LTL17707345028208413733.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5916591027662436520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17707345028208413733.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("(((pl_P168_18==0)||(pl_P16_29==0))||(pl_P30_1==0))"))&&(F(G("(((pl_P168_35==0)||(pl_P16_14==0))||(pl_P30_1==0))")))))
Formula 0 simplified : G!"(((pl_P168_18==0)||(pl_P16_29==0))||(pl_P30_1==0))" | GF!"(((pl_P168_35==0)||(pl_P16_14==0))||(pl_P30_1==0))"
Detected timeout of ITS tools.
[2024-05-26 04:43:42] [INFO ] Flatten gal took : 68 ms
[2024-05-26 04:43:42] [INFO ] Applying decomposition
[2024-05-26 04:43:42] [INFO ] Flatten gal took : 68 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/graph18021773719244110867.txt' '-o' '/tmp/graph18021773719244110867.bin' '-w' '/tmp/graph18021773719244110867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18021773719244110867.bin' '-l' '-1' '-v' '-w' '/tmp/graph18021773719244110867.weights' '-q' '0' '-e' '0.001'
[2024-05-26 04:43:42] [INFO ] Decomposing Gal with order
[2024-05-26 04:43:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 04:43:43] [INFO ] Removed a total of 8320 redundant transitions.
[2024-05-26 04:43:43] [INFO ] Flatten gal took : 292 ms
[2024-05-26 04:43:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 124 ms.
[2024-05-26 04:43:43] [INFO ] Time to serialize gal into /tmp/LTL4160547522838121265.gal : 16 ms
[2024-05-26 04:43:43] [INFO ] Time to serialize properties into /tmp/LTL2890351988982285972.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/LTL4160547522838121265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2890351988982285972.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("(((i3.i0.u6.pl_P168_18==0)||(u36.pl_P16_29==0))||(i1.i1.u7.pl_P30_1==0))"))&&(F(G("(((i6.u14.pl_P168_35==0)||(u28.pl_P16_14==0)...187
Formula 0 simplified : G!"(((i3.i0.u6.pl_P168_18==0)||(u36.pl_P16_29==0))||(i1.i1.u7.pl_P30_1==0))" | GF!"(((i6.u14.pl_P168_35==0)||(u28.pl_P16_14==0))||(i...177
Reverse transition relation is NOT exact ! Due to transitions t18, t19, t20, t22, t24, t25, t26, t29, t31, t32, t35, t36, t37, t41, t42, t43, t44, t45, t47...359
Detected timeout of ITS tools.
Treatment of property Railroad-PT-050-LTLFireability-04 finished in 269493 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 p1))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 258 transition count 2654
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 208 transition count 2654
Applied a total of 104 rules in 540 ms. Remains 208 /260 variables (removed 52) and now considering 2654/2706 (removed 52) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 04:43:59] [INFO ] Invariants computation overflowed in 11 ms
[2024-05-26 04:43:59] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 04:43:59] [INFO ] Invariants computation overflowed in 5 ms
[2024-05-26 04:44:00] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2024-05-26 04:44:00] [INFO ] Redundant transitions in 74 ms returned []
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 04:44:00] [INFO ] Invariants computation overflowed in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (OVERLAPS) 2654/2812 variables, 158/316 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
[2024-05-26 04:44:32] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2812/2862 variables, and 317 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30035 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 3 (OVERLAPS) 2654/2812 variables, 158/317 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2812 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2812/2862 variables, and 370 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30052 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 53/2604 constraints, Known Traps: 1/1 constraints]
After SMT, in 68384ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 68406ms
Starting structural reductions in SI_LTL mode, iteration 1 : 208/260 places, 2654/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70304 ms. Remains : 208/260 places, 2654/2706 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 926 ms.
Stack based approach found an accepted trace after 273 steps with 0 reset with depth 274 and stack size 274 in 4 ms.
FORMULA Railroad-PT-050-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-05 finished in 71346 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)&&(X(X(F(p1)))||(F(p3)&&p2)))))'
Support contains 7 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 7 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:45:09] [INFO ] Invariants computation overflowed in 4 ms
[2024-05-26 04:45:10] [INFO ] Implicit Places using invariants in 234 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:45:10] [INFO ] Invariants computation overflowed in 4 ms
[2024-05-26 04:45:11] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:45:11] [INFO ] Invariants computation overflowed in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (OVERLAPS) 2706/2916 variables, 210/420 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
[2024-05-26 04:45:45] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-05-26 04:45:47] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 8 ms to minimize.
[2024-05-26 04:45:48] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2916/2966 variables, and 423 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30042 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 3 (OVERLAPS) 2706/2916 variables, 210/423 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2916 variables, 105/528 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2916/2966 variables, and 528 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30042 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 105/2656 constraints, Known Traps: 3/3 constraints]
After SMT, in 69211ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 69234ms
Finished structural reductions in LTL mode , in 1 iterations and 70675 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : Railroad-PT-050-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 825 ms.
Product exploration explored 100000 steps with 0 reset in 870 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p0)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 106 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 6 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p3) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 534 ms. (74 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 290 ms. (137 steps per ms) remains 3/3 properties
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:46:23] [INFO ] Invariants computation overflowed in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 300/305 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2513/2818 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2818 variables, 155/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2818 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 148/2966 variables, 100/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2966 variables, 100/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2966 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2966/2966 variables, and 520 constraints, problems are : Problem set: 0 solved, 3 unsolved in 596 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 300/305 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2513/2818 variables, 155/165 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2818 variables, 155/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2818 variables, 2/322 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2818 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 148/2966 variables, 100/422 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 100/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2966/2966 variables, and 522 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1163 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1790ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 1 properties in 609 ms.
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 4 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 106 place count 207 transition count 2653
Applied a total of 106 rules in 727 ms. Remains 207 /260 variables (removed 53) and now considering 2653/2706 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 727 ms. Remains : 207/260 places, 2653/2706 transitions.
RANDOM walk for 40000 steps (8 resets) in 422 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 792607 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 1
Probabilistic random walk after 792607 steps, saw 692083 distinct states, run finished after 3004 ms. (steps per millisecond=263 ) properties seen :0
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:46:29] [INFO ] Invariants computation overflowed in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/156 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2654/2810 variables, 154/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 154/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2810 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/2860 variables, 50/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2860 variables, 50/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2860 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2860 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2860/2860 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 414 ms.
Refiners :[Domain max(s): 207/207 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/156 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2654/2810 variables, 154/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 154/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2810 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2810 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 50/2860 variables, 50/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2860 variables, 50/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2860 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2860 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2860/2860 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 622 ms.
Refiners :[Domain max(s): 207/207 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1054ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 236 ms.
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 419 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 207/207 places, 2653/2653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 408 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:46:31] [INFO ] Invariants computation overflowed in 12 ms
[2024-05-26 04:46:31] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:46:31] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-26 04:46:33] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
[2024-05-26 04:46:33] [INFO ] Redundant transitions in 79 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:46:33] [INFO ] Invariants computation overflowed in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (OVERLAPS) 2653/2810 variables, 157/314 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
[2024-05-26 04:47:06] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/2860 variables, and 315 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30043 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 3 (OVERLAPS) 2653/2810 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2810 variables, 52/367 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/2860 variables, and 367 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30049 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 52/2603 constraints, Known Traps: 1/1 constraints]
After SMT, in 68262ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 68285ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70250 ms. Remains : 207/207 places, 2653/2653 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 50 Pre rules applied. Total rules applied 0 place count 207 transition count 2603
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 157 transition count 2603
Applied a total of 100 rules in 64 ms. Remains 157 /207 variables (removed 50) and now considering 2603/2653 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 157 cols
[2024-05-26 04:47:41] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-26 04:47:41] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 04:47:42] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 04:47:42] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 04:47:42] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 756 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p0)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p1))), (G (OR p3 (NOT p2)))]
False Knowledge obtained : [(F p2), (F p1), (F p3), (F (NOT (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 8 factoid took 213 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:47:42] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 04:47:44] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2024-05-26 04:47:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:47:45] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2024-05-26 04:47:45] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
[2024-05-26 04:47:46] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-26 04:47:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 432 ms
Proved EG (NOT p0)
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 04:47:46] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 04:47:47] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2024-05-26 04:47:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:47:48] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2024-05-26 04:47:49] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 1 ms to minimize.
[2024-05-26 04:47:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 376 ms
Proved EG (AND (NOT p1) (NOT p2))
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p0)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p1))), (G (OR p3 (NOT p2)))]
False Knowledge obtained : [(F p2), (F p1), (F p3), (F (NOT (AND (NOT p1) (NOT p3)))), (G (NOT p0)), (G (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 8 factoid took 268 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-050-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-07 finished in 159846 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 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 4 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 106 place count 207 transition count 2653
Applied a total of 106 rules in 543 ms. Remains 207 /260 variables (removed 53) and now considering 2653/2706 (removed 53) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:47:50] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 04:47:50] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:47:50] [INFO ] Invariants computation overflowed in 4 ms
[2024-05-26 04:47:51] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2024-05-26 04:47:51] [INFO ] Redundant transitions in 71 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:47:51] [INFO ] Invariants computation overflowed in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (OVERLAPS) 2653/2810 variables, 157/314 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
[2024-05-26 04:48:24] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/2860 variables, and 315 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30047 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 3 (OVERLAPS) 2653/2810 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2810 variables, 52/367 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/2860 variables, and 367 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30058 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 52/2603 constraints, Known Traps: 1/1 constraints]
After SMT, in 68335ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 68358ms
Starting structural reductions in SI_LTL mode, iteration 1 : 207/260 places, 2653/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70373 ms. Remains : 207/260 places, 2653/2706 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 997 ms.
Product exploration explored 100000 steps with 0 reset in 963 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 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 5131 steps (0 resets) in 61 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 411 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:49:02] [INFO ] Invariants computation overflowed in 7 ms
[2024-05-26 04:49:03] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:49:03] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 04:49:04] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2024-05-26 04:49:04] [INFO ] Redundant transitions in 72 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:49:04] [INFO ] Invariants computation overflowed in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (OVERLAPS) 2653/2810 variables, 157/314 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
[2024-05-26 04:49:36] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/2860 variables, and 315 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30037 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 3 (OVERLAPS) 2653/2810 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2810 variables, 52/367 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/2860 variables, and 367 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30044 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 52/2603 constraints, Known Traps: 1/1 constraints]
After SMT, in 68568ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 68589ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70467 ms. Remains : 207/207 places, 2653/2653 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 10586 steps (1 resets) in 132 ms. (79 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 922 ms.
Product exploration explored 100000 steps with 0 reset in 965 ms.
Built C files in :
/tmp/ltsmin17758810653930814740
[2024-05-26 04:50:15] [INFO ] Too many transitions (2653) to apply POR reductions. Disabling POR matrices.
[2024-05-26 04:50:15] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17758810653930814740
Running compilation step : cd /tmp/ltsmin17758810653930814740;'/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/ltsmin17758810653930814740;'/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/ltsmin17758810653930814740;'/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 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 418 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:50:18] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 04:50:18] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:50:18] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 04:50:19] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2024-05-26 04:50:20] [INFO ] Redundant transitions in 76 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 04:50:20] [INFO ] Invariants computation overflowed in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (OVERLAPS) 2653/2810 variables, 157/314 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
[2024-05-26 04:50:52] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/2860 variables, and 315 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30052 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 3 (OVERLAPS) 2653/2810 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2810 variables, 52/367 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/2860 variables, and 367 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30046 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 52/2603 constraints, Known Traps: 1/1 constraints]
After SMT, in 68651ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 68673ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70537 ms. Remains : 207/207 places, 2653/2653 transitions.
Built C files in :
/tmp/ltsmin14704931352220707707
[2024-05-26 04:51:28] [INFO ] Too many transitions (2653) to apply POR reductions. Disabling POR matrices.
[2024-05-26 04:51:28] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14704931352220707707
Running compilation step : cd /tmp/ltsmin14704931352220707707;'/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/ltsmin14704931352220707707;'/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/ltsmin14704931352220707707;'/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-26 04:51:32] [INFO ] Flatten gal took : 65 ms
[2024-05-26 04:51:32] [INFO ] Flatten gal took : 64 ms
[2024-05-26 04:51:32] [INFO ] Time to serialize gal into /tmp/LTL4709045361592443825.gal : 14 ms
[2024-05-26 04:51:32] [INFO ] Time to serialize properties into /tmp/LTL711788667608010458.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4709045361592443825.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17100295874794294195.hoa' '-atoms' '/tmp/LTL711788667608010458.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL711788667608010458.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17100295874794294195.hoa
Detected timeout of ITS tools.
[2024-05-26 04:51:54] [INFO ] Flatten gal took : 61 ms
[2024-05-26 04:51:54] [INFO ] Flatten gal took : 89 ms
[2024-05-26 04:51:54] [INFO ] Time to serialize gal into /tmp/LTL12834439435092349459.gal : 13 ms
[2024-05-26 04:51:54] [INFO ] Time to serialize properties into /tmp/LTL15162477155363606865.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/LTL12834439435092349459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15162477155363606865.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("(((pl_P168_21==0)||(pl_P16_42==0))||(pl_P30_1==0))"))))
Formula 0 simplified : GF!"(((pl_P168_21==0)||(pl_P16_42==0))||(pl_P30_1==0))"

BK_STOP 1716699120892

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Railroad-PT-050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-171662338700500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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