About the Execution of ITS-Tools for BART-PT-005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1210.407 | 1142859.00 | 1296220.00 | 3140.90 | TTTTTTFTTFTFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167700450.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 BART-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167700450
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.9M
-rw-r--r-- 1 mcc users 179K Apr 12 21:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 625K Apr 12 21:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 241K Apr 12 21:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 803K Apr 12 21:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 262K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 700K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 158K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 417K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 426K Apr 12 22:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 22:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 545K Apr 12 21:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.8M Apr 12 21:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 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 BART-PT-005-CTLFireability-2024-00
FORMULA_NAME BART-PT-005-CTLFireability-2024-01
FORMULA_NAME BART-PT-005-CTLFireability-2024-02
FORMULA_NAME BART-PT-005-CTLFireability-2024-03
FORMULA_NAME BART-PT-005-CTLFireability-2024-04
FORMULA_NAME BART-PT-005-CTLFireability-2024-05
FORMULA_NAME BART-PT-005-CTLFireability-2024-06
FORMULA_NAME BART-PT-005-CTLFireability-2024-07
FORMULA_NAME BART-PT-005-CTLFireability-2024-08
FORMULA_NAME BART-PT-005-CTLFireability-2024-09
FORMULA_NAME BART-PT-005-CTLFireability-2024-10
FORMULA_NAME BART-PT-005-CTLFireability-2024-11
FORMULA_NAME BART-PT-005-CTLFireability-2024-12
FORMULA_NAME BART-PT-005-CTLFireability-2024-13
FORMULA_NAME BART-PT-005-CTLFireability-2024-14
FORMULA_NAME BART-PT-005-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716382940170
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 13:02:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 13:02:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:02:22] [INFO ] Load time of PNML (sax parser for PT used): 316 ms
[2024-05-22 13:02:22] [INFO ] Transformed 870 places.
[2024-05-22 13:02:22] [INFO ] Transformed 1010 transitions.
[2024-05-22 13:02:22] [INFO ] Found NUPN structural information;
[2024-05-22 13:02:22] [INFO ] Parsed PT model containing 870 places and 1010 transitions and 8100 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 61 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 660 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 33 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2024-05-22 13:02:23] [INFO ] Computed 5 invariants in 46 ms
[2024-05-22 13:02:23] [INFO ] Implicit Places using invariants in 683 ms returned []
[2024-05-22 13:02:23] [INFO ] Invariant cache hit.
[2024-05-22 13:02:24] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-05-22 13:02:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30063 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30028 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60450ms
Finished structural reductions in LTL mode , in 1 iterations and 61965 ms. Remains : 660/660 places, 1010/1010 transitions.
Support contains 660 out of 660 places after structural reductions.
[2024-05-22 13:03:25] [INFO ] Flatten gal took : 246 ms
[2024-05-22 13:03:26] [INFO ] Flatten gal took : 98 ms
[2024-05-22 13:03:26] [INFO ] Input system was already deterministic with 1010 transitions.
Reduction of identical properties reduced properties to check from 49 to 40
RANDOM walk for 40000 steps (8 resets) in 2400 ms. (16 steps per ms) remains 2/40 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
[2024-05-22 13:03:27] [INFO ] Invariant cache hit.
Problem AtomicPropp1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp48 is UNSAT
After SMT solving in domain Real declared 660/1670 variables, and 12 constraints, problems are : Problem set: 2 solved, 0 unsolved in 136 ms.
Refiners :[Domain max(s): 7/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA BART-PT-005-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 13:03:27] [INFO ] Flatten gal took : 57 ms
[2024-05-22 13:03:27] [INFO ] Flatten gal took : 72 ms
[2024-05-22 13:03:28] [INFO ] Input system was already deterministic with 1010 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 8 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2024-05-22 13:03:28] [INFO ] Invariant cache hit.
[2024-05-22 13:03:28] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-22 13:03:28] [INFO ] Invariant cache hit.
[2024-05-22 13:03:29] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-05-22 13:03:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30029 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30025 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Finished structural reductions in LTL mode , in 1 iterations and 61213 ms. Remains : 660/660 places, 1010/1010 transitions.
[2024-05-22 13:04:29] [INFO ] Flatten gal took : 34 ms
[2024-05-22 13:04:29] [INFO ] Flatten gal took : 35 ms
[2024-05-22 13:04:29] [INFO ] Input system was already deterministic with 1010 transitions.
[2024-05-22 13:04:29] [INFO ] Flatten gal took : 32 ms
[2024-05-22 13:04:29] [INFO ] Flatten gal took : 34 ms
[2024-05-22 13:04:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14367616997049079912.gal : 14 ms
[2024-05-22 13:04:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6382980321198245322.ctl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14367616997049079912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6382980321198245322.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,7.78811,189708,2,20712,5,1.21389e+06,6,0,3653,884823,0
Converting to forward existential form...Done !
original formula: AG(AX((EX(A(((((((((((TrainState_4_1_38==1)||(TrainState_1_1_15==1))||((TrainState_1_1_31==1)||(TrainState_5_2_10==1)))||(((TrainState_2_...31657
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(EG(!(EG(!(((((((((((TrainState_2_1_32==1)||(TrainState_3_4_28==1))||((TrainState_2_3_...54358
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 13:04:59] [INFO ] Flatten gal took : 31 ms
[2024-05-22 13:04:59] [INFO ] Applying decomposition
[2024-05-22 13:04:59] [INFO ] Flatten gal took : 31 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/graph13039372276483543375.txt' '-o' '/tmp/graph13039372276483543375.bin' '-w' '/tmp/graph13039372276483543375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13039372276483543375.bin' '-l' '-1' '-v' '-w' '/tmp/graph13039372276483543375.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:05:00] [INFO ] Decomposing Gal with order
[2024-05-22 13:05:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:05:00] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-22 13:05:00] [INFO ] Flatten gal took : 163 ms
[2024-05-22 13:05:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2024-05-22 13:05:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7066444274907713472.gal : 22 ms
[2024-05-22 13:05:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13890876703364452306.ctl : 9 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7066444274907713472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13890876703364452306.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,0.263669,10260,254,75,5639,2744,1057,6920,232,1917,0
Converting to forward existential form...Done !
original formula: AG(AX((EX(A(((((((((((i7.i0.i0.u27.TrainState_4_1_38==1)||(i0.i0.i0.u14.TrainState_1_1_15==1))||((i0.i0.i0.u14.TrainState_1_1_31==1)||(i2...47319
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(EG(!(EG(!(((((((((((i1.i1.i0.u15.TrainState_2_1_32==1)||(i8.u146.TrainState_3_4_28==1...81539
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,1.32295,19492,1,0,25713,10724,8804,48960,1310,26003,33430
FORMULA BART-PT-005-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 157 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
// Phase 1: matrix 595 rows 245 cols
[2024-05-22 13:05:02] [INFO ] Computed 5 invariants in 8 ms
[2024-05-22 13:05:02] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 13:05:02] [INFO ] Invariant cache hit.
[2024-05-22 13:05:02] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-05-22 13:05:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 25109 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 18053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
After SMT, in 43245ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 43251ms
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43808 ms. Remains : 245/660 places, 595/1010 transitions.
[2024-05-22 13:05:46] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:05:46] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:05:46] [INFO ] Input system was already deterministic with 595 transitions.
[2024-05-22 13:05:46] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:05:46] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:05:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14075614454444327070.gal : 3 ms
[2024-05-22 13:05:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11206893876979470306.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14075614454444327070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11206893876979470306.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.82475e+08,1.02212,25940,2,7558,5,162456,6,0,1578,64128,0
Converting to forward existential form...Done !
original formula: EG(AF((((EF(AX(((((TrainState_1_1_1==0)&&(TrainState_2_1_1==0))&&((TrainState_3_1_1==0)&&(TrainState_4_1_1==0)))&&(TrainState_5_1_1==0)))...283
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((E(TRUE U !(EX(!(((((TrainState_1_1_1==0)&&(TrainState_2_1_1==0))&&((TrainState_3_1_1==0)&&(...344
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,9.99505,215268,1,0,11,1.52611e+06,27,5,7045,291582,14
FORMULA BART-PT-005-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 0 with 285 rules applied. Total rules applied 285 place count 660 transition count 725
Reduce places removed 285 places and 0 transitions.
Iterating post reduction 1 with 285 rules applied. Total rules applied 570 place count 375 transition count 725
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 595 place count 350 transition count 700
Iterating global reduction 2 with 25 rules applied. Total rules applied 620 place count 350 transition count 700
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 760 place count 280 transition count 630
Drop transitions (Redundant composition of simpler transitions.) removed 175 transitions
Redundant transition composition rules discarded 175 transitions
Iterating global reduction 2 with 175 rules applied. Total rules applied 935 place count 280 transition count 455
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 935 place count 280 transition count 450
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 945 place count 275 transition count 450
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 950 place count 275 transition count 450
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 955 place count 270 transition count 445
Iterating global reduction 2 with 5 rules applied. Total rules applied 960 place count 270 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 965 place count 270 transition count 440
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 970 place count 270 transition count 435
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 975 place count 265 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 980 place count 265 transition count 430
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 985 place count 265 transition count 425
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 990 place count 260 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 995 place count 260 transition count 420
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 5 rules applied. Total rules applied 1000 place count 260 transition count 415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1005 place count 255 transition count 415
Applied a total of 1005 rules in 192 ms. Remains 255 /660 variables (removed 405) and now considering 415/1010 (removed 595) transitions.
// Phase 1: matrix 415 rows 255 cols
[2024-05-22 13:05:56] [INFO ] Computed 5 invariants in 7 ms
[2024-05-22 13:05:56] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 13:05:56] [INFO ] Invariant cache hit.
[2024-05-22 13:05:56] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-05-22 13:05:56] [INFO ] Redundant transitions in 31 ms returned []
Running 405 sub problems to find dead transitions.
[2024-05-22 13:05:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 5/255 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 415/670 variables, 255/260 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (OVERLAPS) 0/670 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 405 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 260 constraints, problems are : Problem set: 0 solved, 405 unsolved in 19582 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 5/255 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 415/670 variables, 255/260 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 405/665 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/670 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (OVERLAPS) 0/670 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 405 unsolved
No progress, stopping.
After SMT solving in domain Int declared 670/670 variables, and 665 constraints, problems are : Problem set: 0 solved, 405 unsolved in 17638 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 0/0 constraints]
After SMT, in 37272ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 37277ms
Starting structural reductions in SI_CTL mode, iteration 1 : 255/660 places, 415/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37808 ms. Remains : 255/660 places, 415/1010 transitions.
[2024-05-22 13:06:33] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:06:34] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:06:34] [INFO ] Input system was already deterministic with 415 transitions.
[2024-05-22 13:06:34] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:06:34] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:06:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6969693170526571027.gal : 3 ms
[2024-05-22 13:06:34] [INFO ] Time to serialize properties into /tmp/CTLFireability762161986302094301.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6969693170526571027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability762161986302094301.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.45025e+08,1.06859,33060,2,3744,5,159721,6,0,1438,145400,0
Converting to forward existential form...Done !
original formula: AG(EF((((((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(((TrainState_5_1_1==1)||(Tra...1292
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(Tra...1352
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,3.23788,65548,1,0,6,402815,14,0,6044,145400,5
FORMULA BART-PT-005-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 4 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2024-05-22 13:06:37] [INFO ] Computed 5 invariants in 9 ms
[2024-05-22 13:06:37] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 13:06:37] [INFO ] Invariant cache hit.
[2024-05-22 13:06:38] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-05-22 13:06:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30033 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30029 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Finished structural reductions in LTL mode , in 1 iterations and 61107 ms. Remains : 660/660 places, 1010/1010 transitions.
[2024-05-22 13:07:38] [INFO ] Flatten gal took : 36 ms
[2024-05-22 13:07:38] [INFO ] Flatten gal took : 39 ms
[2024-05-22 13:07:38] [INFO ] Input system was already deterministic with 1010 transitions.
[2024-05-22 13:07:38] [INFO ] Flatten gal took : 43 ms
[2024-05-22 13:07:38] [INFO ] Flatten gal took : 43 ms
[2024-05-22 13:07:38] [INFO ] Time to serialize gal into /tmp/CTLFireability14816652566098609935.gal : 8 ms
[2024-05-22 13:07:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9277998539531564590.ctl : 10 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14816652566098609935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9277998539531564590.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,8.24823,190784,2,20712,5,1.21389e+06,6,0,3653,884823,0
Converting to forward existential form...Done !
original formula: EF((A(!((!(((((((((TrainState_1_4_13==1)||(TrainState_4_2_4==1))||((TrainState_3_3_9==1)||(TrainState_4_4_14==1)))||(((TrainState_1_3_7==...39029
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!((!(!(EX(!(((((((((((TrainState_2_1_32==1)||(TrainState_3_4_28==1))||((TrainState_2_...79754
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 13:08:08] [INFO ] Flatten gal took : 24 ms
[2024-05-22 13:08:08] [INFO ] Applying decomposition
[2024-05-22 13:08:08] [INFO ] Flatten gal took : 24 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/graph15446788789532506567.txt' '-o' '/tmp/graph15446788789532506567.bin' '-w' '/tmp/graph15446788789532506567.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15446788789532506567.bin' '-l' '-1' '-v' '-w' '/tmp/graph15446788789532506567.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:08:09] [INFO ] Decomposing Gal with order
[2024-05-22 13:08:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:08:09] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-22 13:08:09] [INFO ] Flatten gal took : 71 ms
[2024-05-22 13:08:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-22 13:08:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2119774013190861200.gal : 9 ms
[2024-05-22 13:08:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13186394558509502270.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2119774013190861200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13186394558509502270.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,0.376881,10128,302,75,6495,2847,1137,7367,234,2019,0
Converting to forward existential form...Done !
original formula: EF((A(!((!(((((((((i4.i0.i2.u93.TrainState_1_4_13==1)||(i8.i0.i0.u42.TrainState_4_2_4==1))||((i3.i1.i0.u29.TrainState_3_3_9==1)||(i8.i0.i...56431
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!((!(!(EX(!(((((((((((i0.i0.i0.u10.TrainState_2_1_32==1)||(i3.i1.i2.u144.TrainState_3...115386
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,10.2088,295508,1,0,496590,189298,10520,1.93035e+06,1378,672484,173681
FORMULA BART-PT-005-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 7 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2024-05-22 13:08:19] [INFO ] Invariant cache hit.
[2024-05-22 13:08:19] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-22 13:08:19] [INFO ] Invariant cache hit.
[2024-05-22 13:08:20] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-05-22 13:08:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
(s409 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30045 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30041 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Finished structural reductions in LTL mode , in 1 iterations and 61242 ms. Remains : 660/660 places, 1010/1010 transitions.
[2024-05-22 13:09:20] [INFO ] Flatten gal took : 35 ms
[2024-05-22 13:09:21] [INFO ] Flatten gal took : 44 ms
[2024-05-22 13:09:21] [INFO ] Input system was already deterministic with 1010 transitions.
[2024-05-22 13:09:21] [INFO ] Flatten gal took : 41 ms
[2024-05-22 13:09:21] [INFO ] Flatten gal took : 44 ms
[2024-05-22 13:09:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13543746356225934832.gal : 8 ms
[2024-05-22 13:09:21] [INFO ] Time to serialize properties into /tmp/CTLFireability10902305088895788614.ctl : 11 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13543746356225934832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10902305088895788614.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,8.83488,191228,2,20712,5,1.21389e+06,6,0,3653,884823,0
Converting to forward existential form...Done !
original formula: (EF(((!(A((E(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(TrainState_5_1_1==1)) U ...54421
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!(!((E(!(EX((((((((((TrainState_1_0_0==1)||(TrainState_3_0_0==1))||((TrainState_2_0_0==1...88938
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 13:09:51] [INFO ] Flatten gal took : 42 ms
[2024-05-22 13:09:51] [INFO ] Applying decomposition
[2024-05-22 13:09:51] [INFO ] Flatten gal took : 44 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/graph3724246548060258007.txt' '-o' '/tmp/graph3724246548060258007.bin' '-w' '/tmp/graph3724246548060258007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3724246548060258007.bin' '-l' '-1' '-v' '-w' '/tmp/graph3724246548060258007.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:09:51] [INFO ] Decomposing Gal with order
[2024-05-22 13:09:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:09:51] [INFO ] Removed a total of 169 redundant transitions.
[2024-05-22 13:09:51] [INFO ] Flatten gal took : 102 ms
[2024-05-22 13:09:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-22 13:09:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3524740223989117519.gal : 11 ms
[2024-05-22 13:09:52] [INFO ] Time to serialize properties into /tmp/CTLFireability2649651942269476454.ctl : 9 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3524740223989117519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2649651942269476454.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,0.418899,10132,380,75,8294,2976,1359,10270,239,2234,0
Converting to forward existential form...Done !
original formula: (EF(((!(A((E(((((i7.i0.i0.u3.TrainState_1_1_1==1)||(i3.i0.i0.u0.TrainState_2_1_1==1))||((i0.i0.i0.u1.TrainState_3_1_1==1)||(i6.i0.i0.u4.T...79503
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!(!((E(!(EX((((((((((i7.i0.i0.u11.TrainState_1_0_0==1)||(i0.i0.i0.u57.TrainState_3_0_0==...130673
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,11.1478,318480,1,0,580660,154923,16988,2.01716e+06,1683,524019,267191
FORMULA BART-PT-005-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 660 transition count 895
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 545 transition count 895
Applied a total of 230 rules in 37 ms. Remains 545 /660 variables (removed 115) and now considering 895/1010 (removed 115) transitions.
// Phase 1: matrix 895 rows 545 cols
[2024-05-22 13:10:03] [INFO ] Computed 5 invariants in 7 ms
[2024-05-22 13:10:03] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 13:10:03] [INFO ] Invariant cache hit.
[2024-05-22 13:10:04] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2024-05-22 13:10:04] [INFO ] Redundant transitions in 44 ms returned []
Running 715 sub problems to find dead transitions.
[2024-05-22 13:10:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 540/540 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 5/545 variables, 5/545 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/545 variables, 5/550 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/1440 variables, and 550 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30022 ms.
Refiners :[Domain max(s): 545/545 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/545 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 540/540 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 5/545 variables, 5/545 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/545 variables, 5/550 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (OVERLAPS) 895/1440 variables, 545/1095 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1440 variables, 715/1810 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1440/1440 variables, and 1810 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30035 ms.
Refiners :[Domain max(s): 545/545 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 545/545 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in SI_CTL mode, iteration 1 : 545/660 places, 895/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61137 ms. Remains : 545/660 places, 895/1010 transitions.
[2024-05-22 13:11:04] [INFO ] Flatten gal took : 19 ms
[2024-05-22 13:11:04] [INFO ] Flatten gal took : 15 ms
[2024-05-22 13:11:04] [INFO ] Input system was already deterministic with 895 transitions.
[2024-05-22 13:11:04] [INFO ] Flatten gal took : 15 ms
[2024-05-22 13:11:04] [INFO ] Flatten gal took : 15 ms
[2024-05-22 13:11:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8374938626394515827.gal : 3 ms
[2024-05-22 13:11:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12009711702691382551.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8374938626394515827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12009711702691382551.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53862e+10,5.91808,125220,2,17078,5,830852,6,0,3078,531396,0
Converting to forward existential form...Done !
original formula: (EG((((((((TrainState_1_4_13==1)||(TrainState_4_2_4==1))||((TrainState_3_3_9==1)||(TrainState_4_4_14==1)))||(((TrainState_1_3_7==1)||(Tra...20009
=> equivalent forward existential formula: [(FwdU((Init * !(EG((((((((TrainState_1_4_13==1)||(TrainState_4_2_4==1))||((TrainState_3_3_9==1)||(TrainState_4_...16854
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 13:11:34] [INFO ] Flatten gal took : 16 ms
[2024-05-22 13:11:34] [INFO ] Applying decomposition
[2024-05-22 13:11:34] [INFO ] Flatten gal took : 15 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/graph3616794816649225361.txt' '-o' '/tmp/graph3616794816649225361.bin' '-w' '/tmp/graph3616794816649225361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3616794816649225361.bin' '-l' '-1' '-v' '-w' '/tmp/graph3616794816649225361.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:11:34] [INFO ] Decomposing Gal with order
[2024-05-22 13:11:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:11:34] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-22 13:11:34] [INFO ] Flatten gal took : 41 ms
[2024-05-22 13:11:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 13:11:34] [INFO ] Time to serialize gal into /tmp/CTLFireability604024417840883636.gal : 8 ms
[2024-05-22 13:11:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2370715893037993353.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability604024417840883636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2370715893037993353.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53862e+10,0.190567,9096,207,75,2106,2634,726,1790,234,1688,0
Converting to forward existential form...Done !
original formula: (EG((((((((i4.i0.u76.TrainState_1_4_13==1)||(i2.i0.u2.TrainState_4_2_4==1))||((i0.i1.u28.TrainState_3_3_9==1)||(i2.i2.u69.TrainState_4_4_...27852
=> equivalent forward existential formula: [(FwdU((Init * !(EG((((((((i4.i0.u76.TrainState_1_4_13==1)||(i2.i0.u2.TrainState_4_2_4==1))||((i0.i1.u28.TrainSt...27903
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,0.629514,15956,1,0,10499,27971,7067,17534,1333,30842,25782
FORMULA BART-PT-005-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 14 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2024-05-22 13:11:35] [INFO ] Computed 5 invariants in 8 ms
[2024-05-22 13:11:35] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-22 13:11:35] [INFO ] Invariant cache hit.
[2024-05-22 13:11:36] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2024-05-22 13:11:36] [INFO ] Redundant transitions in 28 ms returned []
Running 830 sub problems to find dead transitions.
[2024-05-22 13:11:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 655/1670 variables, and 655 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30038 ms.
Refiners :[Domain max(s): 655/660 constraints, Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30029 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 61402 ms. Remains : 660/660 places, 1010/1010 transitions.
[2024-05-22 13:12:36] [INFO ] Flatten gal took : 34 ms
[2024-05-22 13:12:37] [INFO ] Flatten gal took : 39 ms
[2024-05-22 13:12:37] [INFO ] Input system was already deterministic with 1010 transitions.
[2024-05-22 13:12:37] [INFO ] Flatten gal took : 42 ms
[2024-05-22 13:12:37] [INFO ] Flatten gal took : 37 ms
[2024-05-22 13:12:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14087176129695425919.gal : 6 ms
[2024-05-22 13:12:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10495141310161560397.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14087176129695425919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10495141310161560397.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,8.95384,191160,2,20712,5,1.21389e+06,6,0,3653,884823,0
Converting to forward existential form...Done !
original formula: EG(((EF(!(E(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(TrainState_5_1_1==1)) U (...56435
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U !(E(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_...54156
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-22 13:13:07] [INFO ] Flatten gal took : 38 ms
[2024-05-22 13:13:07] [INFO ] Applying decomposition
[2024-05-22 13:13:07] [INFO ] Flatten gal took : 37 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/graph16808287596229189715.txt' '-o' '/tmp/graph16808287596229189715.bin' '-w' '/tmp/graph16808287596229189715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16808287596229189715.bin' '-l' '-1' '-v' '-w' '/tmp/graph16808287596229189715.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:13:07] [INFO ] Decomposing Gal with order
[2024-05-22 13:13:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:13:07] [INFO ] Removed a total of 121 redundant transitions.
[2024-05-22 13:13:07] [INFO ] Flatten gal took : 82 ms
[2024-05-22 13:13:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-22 13:13:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8073131903759253017.gal : 12 ms
[2024-05-22 13:13:07] [INFO ] Time to serialize properties into /tmp/CTLFireability6603132116095858814.ctl : 7 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8073131903759253017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6603132116095858814.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00746e+10,0.490512,10584,367,75,10112,3047,1295,12627,239,2416,0
Converting to forward existential form...Done !
original formula: EG(((EF(!(E(((((i3.u1.TrainState_1_1_1==1)||(i5.u2.TrainState_2_1_1==1))||((i6.i1.i0.u0.TrainState_3_1_1==1)||(i2.i2.i0.u4.TrainState_4_1...79921
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U !(E(((((i3.u1.TrainState_1_1_1==1)||(i5.u2.TrainState_2_1_1==1))||((i6.i1.i0.u0.TrainState...79976
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,15.8596,540036,1,0,709278,214484,13395,4.14072e+06,1496,745779,763570
FORMULA BART-PT-005-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 451 place count 368 transition count 718
Iterating global reduction 0 with 133 rules applied. Total rules applied 584 place count 368 transition count 718
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 604 place count 348 transition count 698
Iterating global reduction 0 with 20 rules applied. Total rules applied 624 place count 348 transition count 698
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 639 place count 333 transition count 683
Iterating global reduction 0 with 15 rules applied. Total rules applied 654 place count 333 transition count 683
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 669 place count 318 transition count 668
Iterating global reduction 0 with 15 rules applied. Total rules applied 684 place count 318 transition count 668
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 699 place count 303 transition count 653
Iterating global reduction 0 with 15 rules applied. Total rules applied 714 place count 303 transition count 653
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 729 place count 288 transition count 638
Iterating global reduction 0 with 15 rules applied. Total rules applied 744 place count 288 transition count 638
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 759 place count 273 transition count 623
Iterating global reduction 0 with 15 rules applied. Total rules applied 774 place count 273 transition count 623
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 784 place count 263 transition count 613
Iterating global reduction 0 with 10 rules applied. Total rules applied 794 place count 263 transition count 613
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 803 place count 254 transition count 604
Iterating global reduction 0 with 9 rules applied. Total rules applied 812 place count 254 transition count 604
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 817 place count 249 transition count 599
Iterating global reduction 0 with 5 rules applied. Total rules applied 822 place count 249 transition count 599
Applied a total of 822 rules in 112 ms. Remains 249 /660 variables (removed 411) and now considering 599/1010 (removed 411) transitions.
// Phase 1: matrix 599 rows 249 cols
[2024-05-22 13:13:24] [INFO ] Computed 5 invariants in 5 ms
[2024-05-22 13:13:24] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-22 13:13:24] [INFO ] Invariant cache hit.
[2024-05-22 13:13:24] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-05-22 13:13:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 5/249 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 599/848 variables, 249/254 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/848 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 848/848 variables, and 254 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 5/249 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 599/848 variables, 249/254 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/848 variables, 419/673 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/848 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (OVERLAPS) 0/848 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 419 unsolved
No progress, stopping.
After SMT solving in domain Int declared 848/848 variables, and 673 constraints, problems are : Problem set: 0 solved, 419 unsolved in 23325 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
After SMT, in 53449ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 53457ms
Starting structural reductions in LTL mode, iteration 1 : 249/660 places, 599/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54043 ms. Remains : 249/660 places, 599/1010 transitions.
[2024-05-22 13:14:17] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:14:17] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:14:17] [INFO ] Input system was already deterministic with 599 transitions.
[2024-05-22 13:14:18] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:14:18] [INFO ] Flatten gal took : 15 ms
[2024-05-22 13:14:18] [INFO ] Time to serialize gal into /tmp/CTLFireability16965011641762935295.gal : 3 ms
[2024-05-22 13:14:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10714281222069454369.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16965011641762935295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10714281222069454369.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.06128e+08,1.13999,26996,2,7690,5,163781,6,0,1598,65978,0
Converting to forward existential form...Done !
original formula: EG(((AG((TrainState_4_1_5==1)) + EG(AF((TrainState_5_0_0==1)))) + ((TrainState_2_1_31==0) * ((AG((TrainState_3_0_0==0)) + EG((TrainState_...257
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !((TrainState_4_1_5==1)))) + EG(!(EG(!((TrainState_5_0_0==1)))))) + ((TrainState_2_1_31=...409
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 597/0/2
(forward)formula 0,1,24.3461,525884,1,0,73,3.44243e+06,59,57,7272,1.95914e+06,77
FORMULA BART-PT-005-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 132 places :
Symmetric choice reduction at 0 with 132 rule applications. Total rules 450 place count 369 transition count 719
Iterating global reduction 0 with 132 rules applied. Total rules applied 582 place count 369 transition count 719
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 601 place count 350 transition count 700
Iterating global reduction 0 with 19 rules applied. Total rules applied 620 place count 350 transition count 700
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 634 place count 336 transition count 686
Iterating global reduction 0 with 14 rules applied. Total rules applied 648 place count 336 transition count 686
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 662 place count 322 transition count 672
Iterating global reduction 0 with 14 rules applied. Total rules applied 676 place count 322 transition count 672
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 690 place count 308 transition count 658
Iterating global reduction 0 with 14 rules applied. Total rules applied 704 place count 308 transition count 658
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 718 place count 294 transition count 644
Iterating global reduction 0 with 14 rules applied. Total rules applied 732 place count 294 transition count 644
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 746 place count 280 transition count 630
Iterating global reduction 0 with 14 rules applied. Total rules applied 760 place count 280 transition count 630
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 769 place count 271 transition count 621
Iterating global reduction 0 with 9 rules applied. Total rules applied 778 place count 271 transition count 621
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 787 place count 262 transition count 612
Iterating global reduction 0 with 9 rules applied. Total rules applied 796 place count 262 transition count 612
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 800 place count 258 transition count 608
Iterating global reduction 0 with 4 rules applied. Total rules applied 804 place count 258 transition count 608
Applied a total of 804 rules in 105 ms. Remains 258 /660 variables (removed 402) and now considering 608/1010 (removed 402) transitions.
// Phase 1: matrix 608 rows 258 cols
[2024-05-22 13:14:42] [INFO ] Computed 5 invariants in 2 ms
[2024-05-22 13:14:42] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 13:14:42] [INFO ] Invariant cache hit.
[2024-05-22 13:14:43] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-05-22 13:14:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 5/258 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 608/866 variables, 258/263 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/866 variables, and 263 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 5/258 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 608/866 variables, 258/263 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 428/691 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/866 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 0/866 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 866/866 variables, and 691 constraints, problems are : Problem set: 0 solved, 428 unsolved in 22041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 0/0 constraints]
After SMT, in 52181ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 52186ms
Starting structural reductions in LTL mode, iteration 1 : 258/660 places, 608/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52691 ms. Remains : 258/660 places, 608/1010 transitions.
[2024-05-22 13:15:35] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:15:35] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:15:35] [INFO ] Input system was already deterministic with 608 transitions.
[2024-05-22 13:15:35] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:15:35] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:15:35] [INFO ] Time to serialize gal into /tmp/CTLFireability13757669561595788327.gal : 3 ms
[2024-05-22 13:15:35] [INFO ] Time to serialize properties into /tmp/CTLFireability6069508542461986789.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13757669561595788327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6069508542461986789.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.58829e+08,1.0406,28120,2,7898,5,175065,6,0,1643,72967,0
Converting to forward existential form...Done !
original formula: AF(E(!(((EX(((TrainState_5_0_0==1)||(TrainState_4_2_24==1))) * ((TrainState_3_1_3!=1) + AX((TrainState_3_2_28==1)))) * EF((TrainState_1_1...191
=> equivalent forward existential formula: [FwdG(Init,!(E(!(((EX(((TrainState_5_0_0==1)||(TrainState_4_2_24==1))) * ((TrainState_3_1_3!=1) + !(EX(!((TrainS...248
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,28.2036,714908,1,0,129,5.27299e+06,28,103,6839,2.61442e+06,116
FORMULA BART-PT-005-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 973 edges and 660 vertex of which 528 / 660 are part of one of the 4 SCC in 9 ms
Free SCC test removed 524 places
Ensure Unique test removed 804 transitions
Reduce isomorphic transitions removed 804 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 132 place count 68 transition count 139
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 132 place count 68 transition count 134
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 142 place count 63 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 148 place count 57 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 154 place count 57 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 57 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 159 place count 53 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 163 place count 53 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 50 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 50 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 172 place count 47 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 175 place count 47 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 45 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 45 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 181 place count 43 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 43 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 184 place count 42 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 185 place count 42 transition count 112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 197 place count 36 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 199 place count 36 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 35 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 203 place count 35 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 34 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 207 place count 34 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 209 place count 33 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 211 place count 33 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 213 place count 32 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 215 place count 32 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 217 place count 31 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 219 place count 31 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 221 place count 30 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 223 place count 30 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 225 place count 29 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 227 place count 29 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 229 place count 28 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 231 place count 28 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 233 place count 27 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 235 place count 27 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 237 place count 26 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 239 place count 26 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 241 place count 25 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 243 place count 25 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 245 place count 24 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 247 place count 24 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 249 place count 23 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 251 place count 23 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 253 place count 22 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 255 place count 22 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 257 place count 21 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 259 place count 21 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 261 place count 20 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 263 place count 20 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 265 place count 19 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 267 place count 19 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 269 place count 18 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 271 place count 18 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 273 place count 17 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 275 place count 17 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 277 place count 16 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 279 place count 16 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 281 place count 15 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 283 place count 15 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 285 place count 14 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 287 place count 14 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 289 place count 13 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 291 place count 13 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 293 place count 12 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 295 place count 12 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 297 place count 11 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 299 place count 11 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 301 place count 10 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 303 place count 10 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 305 place count 9 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 307 place count 9 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 309 place count 8 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 311 place count 8 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 313 place count 7 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 315 place count 7 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 317 place count 6 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 319 place count 6 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 321 place count 5 transition count 13
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 323 place count 5 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 325 place count 4 transition count 10
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 327 place count 4 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 36 with 2 rules applied. Total rules applied 329 place count 3 transition count 7
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 36 with 3 rules applied. Total rules applied 332 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 334 place count 2 transition count 3
Applied a total of 334 rules in 81 ms. Remains 2 /660 variables (removed 658) and now considering 3/1010 (removed 1007) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 13:16:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 13:16:03] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 13:16:03] [INFO ] Invariant cache hit.
[2024-05-22 13:16:03] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-22 13:16:03] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 13:16:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 50ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/660 places, 3/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 184 ms. Remains : 2/660 places, 3/1010 transitions.
[2024-05-22 13:16:03] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:16:03] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:16:03] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-22 13:16:03] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:16:03] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:16:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2910956375087821305.gal : 1 ms
[2024-05-22 13:16:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17559163992049587815.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2910956375087821305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17559163992049587815.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.002188,3300,2,4,5,12,5,0,12,6,0
Converting to forward existential form...Done !
original formula: EG((TrainState_3_0_0==1))
=> equivalent forward existential formula: [FwdG(Init,(TrainState_3_0_0==1))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.003084,3620,1,0,5,18,18,0,49,11,8
FORMULA BART-PT-005-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 158 place count 502 transition count 852
Iterating global reduction 0 with 158 rules applied. Total rules applied 316 place count 502 transition count 852
Discarding 132 places :
Symmetric choice reduction at 0 with 132 rule applications. Total rules 448 place count 370 transition count 720
Iterating global reduction 0 with 132 rules applied. Total rules applied 580 place count 370 transition count 720
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 599 place count 351 transition count 701
Iterating global reduction 0 with 19 rules applied. Total rules applied 618 place count 351 transition count 701
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 632 place count 337 transition count 687
Iterating global reduction 0 with 14 rules applied. Total rules applied 646 place count 337 transition count 687
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 660 place count 323 transition count 673
Iterating global reduction 0 with 14 rules applied. Total rules applied 674 place count 323 transition count 673
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 688 place count 309 transition count 659
Iterating global reduction 0 with 14 rules applied. Total rules applied 702 place count 309 transition count 659
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 716 place count 295 transition count 645
Iterating global reduction 0 with 14 rules applied. Total rules applied 730 place count 295 transition count 645
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 744 place count 281 transition count 631
Iterating global reduction 0 with 14 rules applied. Total rules applied 758 place count 281 transition count 631
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 767 place count 272 transition count 622
Iterating global reduction 0 with 9 rules applied. Total rules applied 776 place count 272 transition count 622
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 784 place count 264 transition count 614
Iterating global reduction 0 with 8 rules applied. Total rules applied 792 place count 264 transition count 614
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 797 place count 259 transition count 609
Iterating global reduction 0 with 5 rules applied. Total rules applied 802 place count 259 transition count 609
Applied a total of 802 rules in 94 ms. Remains 259 /660 variables (removed 401) and now considering 609/1010 (removed 401) transitions.
// Phase 1: matrix 609 rows 259 cols
[2024-05-22 13:16:03] [INFO ] Computed 5 invariants in 3 ms
[2024-05-22 13:16:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 13:16:04] [INFO ] Invariant cache hit.
[2024-05-22 13:16:04] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2024-05-22 13:16:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 5/259 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (OVERLAPS) 609/868 variables, 259/264 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 868/868 variables, and 264 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 5/259 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (OVERLAPS) 609/868 variables, 259/264 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 429/693 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/868 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (OVERLAPS) 0/868 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Int declared 868/868 variables, and 693 constraints, problems are : Problem set: 0 solved, 429 unsolved in 24065 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 0/0 constraints]
After SMT, in 54200ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 54210ms
Starting structural reductions in LTL mode, iteration 1 : 259/660 places, 609/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54682 ms. Remains : 259/660 places, 609/1010 transitions.
[2024-05-22 13:16:58] [INFO ] Flatten gal took : 15 ms
[2024-05-22 13:16:58] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:16:58] [INFO ] Input system was already deterministic with 609 transitions.
[2024-05-22 13:16:58] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:16:58] [INFO ] Flatten gal took : 18 ms
[2024-05-22 13:16:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14003574573203533631.gal : 3 ms
[2024-05-22 13:16:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6096609849843211843.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14003574573203533631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6096609849843211843.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.68602e+08,1.27133,30772,2,7898,5,191306,6,0,1648,88253,0
Converting to forward existential form...Done !
original formula: !(E(!((((TrainState_5_1_14==1) * (EX((TrainState_3_2_39==1)) + ((TrainState_3_1_6==1)&&(TrainState_5_2_6==1)))) * (A((TrainState_2_3_23==...268
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((((TrainState_5_1_14==1) * (EX((TrainState_3_2_39==1)) + ((TrainState_3_1_6==1)&&(TrainState_5...379
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 572/0/37
Hit Full ! (commute/partial/dont) 570/0/39
(forward)formula 0,0,18.5288,437964,1,0,71,2.75476e+06,41,57,7462,1.64619e+06,97
FORMULA BART-PT-005-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 453 place count 366 transition count 716
Iterating global reduction 0 with 135 rules applied. Total rules applied 588 place count 366 transition count 716
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 608 place count 346 transition count 696
Iterating global reduction 0 with 20 rules applied. Total rules applied 628 place count 346 transition count 696
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 643 place count 331 transition count 681
Iterating global reduction 0 with 15 rules applied. Total rules applied 658 place count 331 transition count 681
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 673 place count 316 transition count 666
Iterating global reduction 0 with 15 rules applied. Total rules applied 688 place count 316 transition count 666
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 703 place count 301 transition count 651
Iterating global reduction 0 with 15 rules applied. Total rules applied 718 place count 301 transition count 651
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 733 place count 286 transition count 636
Iterating global reduction 0 with 15 rules applied. Total rules applied 748 place count 286 transition count 636
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 763 place count 271 transition count 621
Iterating global reduction 0 with 15 rules applied. Total rules applied 778 place count 271 transition count 621
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 788 place count 261 transition count 611
Iterating global reduction 0 with 10 rules applied. Total rules applied 798 place count 261 transition count 611
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 808 place count 251 transition count 601
Iterating global reduction 0 with 10 rules applied. Total rules applied 818 place count 251 transition count 601
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 823 place count 246 transition count 596
Iterating global reduction 0 with 5 rules applied. Total rules applied 828 place count 246 transition count 596
Applied a total of 828 rules in 59 ms. Remains 246 /660 variables (removed 414) and now considering 596/1010 (removed 414) transitions.
// Phase 1: matrix 596 rows 246 cols
[2024-05-22 13:17:17] [INFO ] Computed 5 invariants in 4 ms
[2024-05-22 13:17:17] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 13:17:17] [INFO ] Invariant cache hit.
[2024-05-22 13:17:17] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-22 13:17:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 5/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 596/842 variables, 246/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/842 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 842/842 variables, and 251 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 5/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 596/842 variables, 246/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/842 variables, 416/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/842 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 6 (OVERLAPS) 0/842 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 667 constraints, problems are : Problem set: 0 solved, 416 unsolved in 23942 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 54073ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 54081ms
Starting structural reductions in LTL mode, iteration 1 : 246/660 places, 596/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54599 ms. Remains : 246/660 places, 596/1010 transitions.
[2024-05-22 13:18:11] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:18:11] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:18:11] [INFO ] Input system was already deterministic with 596 transitions.
[2024-05-22 13:18:12] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:18:12] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:18:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2538178008726119316.gal : 3 ms
[2024-05-22 13:18:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7755503553833136848.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2538178008726119316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7755503553833136848.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.8824e+08,1.14205,25984,2,7602,5,158676,6,0,1583,63198,0
Converting to forward existential form...Done !
original formula: EX(EG((EX(AX((TrainState_3_2_8==1))) + (TrainState_1_1_11==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),(EX(!(EX(!((TrainState_3_2_8==1))))) + (TrainState_1_1_11==1)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,10.9091,246576,1,0,54,1.56721e+06,18,42,6101,675733,52
FORMULA BART-PT-005-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 51 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
// Phase 1: matrix 595 rows 245 cols
[2024-05-22 13:18:23] [INFO ] Computed 5 invariants in 3 ms
[2024-05-22 13:18:23] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 13:18:23] [INFO ] Invariant cache hit.
[2024-05-22 13:18:23] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-05-22 13:18:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 23662 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
After SMT, in 53776ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 53783ms
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54333 ms. Remains : 245/660 places, 595/1010 transitions.
[2024-05-22 13:19:17] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:19:17] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:19:17] [INFO ] Input system was already deterministic with 595 transitions.
[2024-05-22 13:19:17] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:19:17] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:19:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3728371736420218834.gal : 4 ms
[2024-05-22 13:19:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4145804579394959815.ctl : 88 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3728371736420218834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4145804579394959815.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.82475e+08,1.12251,25944,2,7558,5,162456,6,0,1578,64128,0
Converting to forward existential form...Done !
original formula: AG(EX(AX((TrainState_5_1_8==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!((TrainState_5_1_8==1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,7.03791,149056,1,0,6,963521,11,0,5824,104199,4
FORMULA BART-PT-005-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 453 place count 366 transition count 716
Iterating global reduction 0 with 135 rules applied. Total rules applied 588 place count 366 transition count 716
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 608 place count 346 transition count 696
Iterating global reduction 0 with 20 rules applied. Total rules applied 628 place count 346 transition count 696
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 643 place count 331 transition count 681
Iterating global reduction 0 with 15 rules applied. Total rules applied 658 place count 331 transition count 681
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 673 place count 316 transition count 666
Iterating global reduction 0 with 15 rules applied. Total rules applied 688 place count 316 transition count 666
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 703 place count 301 transition count 651
Iterating global reduction 0 with 15 rules applied. Total rules applied 718 place count 301 transition count 651
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 733 place count 286 transition count 636
Iterating global reduction 0 with 15 rules applied. Total rules applied 748 place count 286 transition count 636
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 763 place count 271 transition count 621
Iterating global reduction 0 with 15 rules applied. Total rules applied 778 place count 271 transition count 621
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 788 place count 261 transition count 611
Iterating global reduction 0 with 10 rules applied. Total rules applied 798 place count 261 transition count 611
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 808 place count 251 transition count 601
Iterating global reduction 0 with 10 rules applied. Total rules applied 818 place count 251 transition count 601
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 823 place count 246 transition count 596
Iterating global reduction 0 with 5 rules applied. Total rules applied 828 place count 246 transition count 596
Applied a total of 828 rules in 85 ms. Remains 246 /660 variables (removed 414) and now considering 596/1010 (removed 414) transitions.
// Phase 1: matrix 596 rows 246 cols
[2024-05-22 13:19:24] [INFO ] Computed 5 invariants in 4 ms
[2024-05-22 13:19:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 13:19:24] [INFO ] Invariant cache hit.
[2024-05-22 13:19:25] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-22 13:19:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 5/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 596/842 variables, 246/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/842 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 842/842 variables, and 251 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 5/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 596/842 variables, 246/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/842 variables, 416/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/842 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 6 (OVERLAPS) 0/842 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 667 constraints, problems are : Problem set: 0 solved, 416 unsolved in 22920 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 53035ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 53042ms
Starting structural reductions in LTL mode, iteration 1 : 246/660 places, 596/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53576 ms. Remains : 246/660 places, 596/1010 transitions.
[2024-05-22 13:20:18] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:20:18] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:20:18] [INFO ] Input system was already deterministic with 596 transitions.
[2024-05-22 13:20:18] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:20:18] [INFO ] Flatten gal took : 10 ms
[2024-05-22 13:20:18] [INFO ] Time to serialize gal into /tmp/CTLFireability283830817373269238.gal : 4 ms
[2024-05-22 13:20:18] [INFO ] Time to serialize properties into /tmp/CTLFireability1139035792668417956.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability283830817373269238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1139035792668417956.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.8824e+08,0.165459,6064,2,488,5,3860,6,0,1583,2117,0
Converting to forward existential form...Done !
original formula: AX(EX(AG((TrainState_4_2_13==0))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U !((TrainState_4_2_13==0)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.628044,14832,1,0,7,63271,15,1,6563,4611,6
FORMULA BART-PT-005-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 451 place count 368 transition count 718
Iterating global reduction 0 with 133 rules applied. Total rules applied 584 place count 368 transition count 718
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 603 place count 349 transition count 699
Iterating global reduction 0 with 19 rules applied. Total rules applied 622 place count 349 transition count 699
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 636 place count 335 transition count 685
Iterating global reduction 0 with 14 rules applied. Total rules applied 650 place count 335 transition count 685
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 664 place count 321 transition count 671
Iterating global reduction 0 with 14 rules applied. Total rules applied 678 place count 321 transition count 671
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 692 place count 307 transition count 657
Iterating global reduction 0 with 14 rules applied. Total rules applied 706 place count 307 transition count 657
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 720 place count 293 transition count 643
Iterating global reduction 0 with 14 rules applied. Total rules applied 734 place count 293 transition count 643
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 748 place count 279 transition count 629
Iterating global reduction 0 with 14 rules applied. Total rules applied 762 place count 279 transition count 629
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 771 place count 270 transition count 620
Iterating global reduction 0 with 9 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 789 place count 261 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 798 place count 261 transition count 611
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 802 place count 257 transition count 607
Iterating global reduction 0 with 4 rules applied. Total rules applied 806 place count 257 transition count 607
Applied a total of 806 rules in 59 ms. Remains 257 /660 variables (removed 403) and now considering 607/1010 (removed 403) transitions.
// Phase 1: matrix 607 rows 257 cols
[2024-05-22 13:20:18] [INFO ] Computed 5 invariants in 2 ms
[2024-05-22 13:20:19] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 13:20:19] [INFO ] Invariant cache hit.
[2024-05-22 13:20:19] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-05-22 13:20:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 5/257 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 607/864 variables, 257/262 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/864 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/864 variables, and 262 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 5/257 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 607/864 variables, 257/262 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/864 variables, 427/689 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/864 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (OVERLAPS) 0/864 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Int declared 864/864 variables, and 689 constraints, problems are : Problem set: 0 solved, 427 unsolved in 24524 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
After SMT, in 54650ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54655ms
Starting structural reductions in LTL mode, iteration 1 : 257/660 places, 607/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55136 ms. Remains : 257/660 places, 607/1010 transitions.
[2024-05-22 13:21:14] [INFO ] Flatten gal took : 15 ms
[2024-05-22 13:21:14] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:21:14] [INFO ] Input system was already deterministic with 607 transitions.
[2024-05-22 13:21:14] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:21:14] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:21:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8312041124200912777.gal : 5 ms
[2024-05-22 13:21:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15760300694833632200.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8312041124200912777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15760300694833632200.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.52947e+08,1.2153,27740,2,7866,5,171766,6,0,1638,70580,0
Converting to forward existential form...Done !
original formula: EX((AG(A((TrainState_3_2_29==1) U (((TrainState_2_1_3==1)&&(TrainState_3_1_36==1))||(TrainState_5_1_9==1)))) * AX(EX((TrainState_1_0_0==0...160
=> equivalent forward existential formula: [((EY(Init) * !(E(TRUE U !(!((E(!((((TrainState_2_1_3==1)&&(TrainState_3_1_36==1))||(TrainState_5_1_9==1))) U (!...396
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 597/10/10
(forward)formula 0,0,8.70784,193464,1,0,8,1.27566e+06,29,0,7350,266031,13
FORMULA BART-PT-005-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-22 13:21:22] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:21:22] [INFO ] Flatten gal took : 14 ms
Total runtime 1140892 ms.
BK_STOP 1716384083029
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="BART-PT-005"
export BK_EXAMINATION="CTLFireability"
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 BART-PT-005, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167700450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-005.tgz
mv BART-PT-005 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;