Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853730100841.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is BART-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853730100841
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 594K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 500K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 309K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 851K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 371K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 990K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 795K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.9M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.6M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.3M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 87K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 177K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.4M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BART-PT-010-CTLCardinality-2025-00
FORMULA_NAME BART-PT-010-CTLCardinality-2025-01
FORMULA_NAME BART-PT-010-CTLCardinality-2025-02
FORMULA_NAME BART-PT-010-CTLCardinality-2025-03
FORMULA_NAME BART-PT-010-CTLCardinality-2025-04
FORMULA_NAME BART-PT-010-CTLCardinality-2025-05
FORMULA_NAME BART-PT-010-CTLCardinality-2025-06
FORMULA_NAME BART-PT-010-CTLCardinality-2025-07
FORMULA_NAME BART-PT-010-CTLCardinality-2025-08
FORMULA_NAME BART-PT-010-CTLCardinality-2025-09
FORMULA_NAME BART-PT-010-CTLCardinality-2025-10
FORMULA_NAME BART-PT-010-CTLCardinality-2025-11
FORMULA_NAME BART-PT-010-CTLCardinality-2025-12
FORMULA_NAME BART-PT-010-CTLCardinality-2025-13
FORMULA_NAME BART-PT-010-CTLCardinality-2025-14
FORMULA_NAME BART-PT-010-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748672974129

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-31 06:29:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 06:29:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:29:35] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2025-05-31 06:29:35] [INFO ] Transformed 1530 places.
[2025-05-31 06:29:35] [INFO ] Transformed 2020 transitions.
[2025-05-31 06:29:35] [INFO ] Found NUPN structural information;
[2025-05-31 06:29:35] [INFO ] Parsed PT model containing 1530 places and 2020 transitions and 16200 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 115 ms.
Reduce places removed 210 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BART-PT-010-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 297 places :
Symmetric choice reduction at 0 with 297 rule applications. Total rules 297 place count 1023 transition count 1723
Iterating global reduction 0 with 297 rules applied. Total rules applied 594 place count 1023 transition count 1723
Discarding 245 places :
Symmetric choice reduction at 0 with 245 rule applications. Total rules 839 place count 778 transition count 1478
Iterating global reduction 0 with 245 rules applied. Total rules applied 1084 place count 778 transition count 1478
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 1119 place count 743 transition count 1443
Iterating global reduction 0 with 35 rules applied. Total rules applied 1154 place count 743 transition count 1443
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1182 place count 715 transition count 1415
Iterating global reduction 0 with 28 rules applied. Total rules applied 1210 place count 715 transition count 1415
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 1236 place count 689 transition count 1389
Iterating global reduction 0 with 26 rules applied. Total rules applied 1262 place count 689 transition count 1389
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 1288 place count 663 transition count 1363
Iterating global reduction 0 with 26 rules applied. Total rules applied 1314 place count 663 transition count 1363
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 1338 place count 639 transition count 1339
Iterating global reduction 0 with 24 rules applied. Total rules applied 1362 place count 639 transition count 1339
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 1384 place count 617 transition count 1317
Iterating global reduction 0 with 22 rules applied. Total rules applied 1406 place count 617 transition count 1317
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1419 place count 604 transition count 1304
Iterating global reduction 0 with 13 rules applied. Total rules applied 1432 place count 604 transition count 1304
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1442 place count 594 transition count 1294
Iterating global reduction 0 with 10 rules applied. Total rules applied 1452 place count 594 transition count 1294
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 1459 place count 587 transition count 1287
Iterating global reduction 0 with 7 rules applied. Total rules applied 1466 place count 587 transition count 1287
Applied a total of 1466 rules in 392 ms. Remains 587 /1320 variables (removed 733) and now considering 1287/2020 (removed 733) transitions.
// Phase 1: matrix 1287 rows 587 cols
[2025-05-31 06:29:36] [INFO ] Computed 10 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:29:36] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-05-31 06:29:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:29:37] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 927 sub problems to find dead transitions.
[2025-05-31 06:29:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 927 unsolved
At refinement iteration 1 (OVERLAPS) 10/587 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 927 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)
timeout
(s168 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 587/1874 variables, and 10 constraints, problems are : Problem set: 0 solved, 927 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/587 constraints, PredecessorRefiner: 927/927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 927 unsolved
At refinement iteration 1 (OVERLAPS) 10/587 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/1874 variables, and 10 constraints, problems are : Problem set: 0 solved, 927 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/587 constraints, PredecessorRefiner: 0/927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 927 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Starting structural reductions in LTL mode, iteration 1 : 587/1320 places, 1287/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61379 ms. Remains : 587/1320 places, 1287/2020 transitions.
Support contains 46 out of 587 places after structural reductions.
[2025-05-31 06:30:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-31 06:30:37] [INFO ] Flatten gal took : 82 ms
[2025-05-31 06:30:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BART-PT-010-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 06:30:37] [INFO ] Flatten gal took : 43 ms
[2025-05-31 06:30:37] [INFO ] Input system was already deterministic with 1287 transitions.
Support contains 36 out of 587 places (down from 46) after GAL structural reductions.
RANDOM walk for 37933 steps (8 resets) in 1235 ms. (30 steps per ms) remains 0/22 properties
[2025-05-31 06:30:38] [INFO ] Flatten gal took : 34 ms
[2025-05-31 06:30:38] [INFO ] Flatten gal took : 33 ms
[2025-05-31 06:30:38] [INFO ] Input system was already deterministic with 1287 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 1287/1287 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 555 transition count 1255
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 555 transition count 1255
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 85 place count 534 transition count 1234
Iterating global reduction 0 with 21 rules applied. Total rules applied 106 place count 534 transition count 1234
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 118 place count 522 transition count 1222
Iterating global reduction 0 with 12 rules applied. Total rules applied 130 place count 522 transition count 1222
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 514 transition count 1214
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 514 transition count 1214
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 153 place count 507 transition count 1207
Iterating global reduction 0 with 7 rules applied. Total rules applied 160 place count 507 transition count 1207
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 166 place count 501 transition count 1201
Iterating global reduction 0 with 6 rules applied. Total rules applied 172 place count 501 transition count 1201
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 176 place count 497 transition count 1197
Iterating global reduction 0 with 4 rules applied. Total rules applied 180 place count 497 transition count 1197
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 183 place count 494 transition count 1194
Iterating global reduction 0 with 3 rules applied. Total rules applied 186 place count 494 transition count 1194
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 188 place count 492 transition count 1192
Iterating global reduction 0 with 2 rules applied. Total rules applied 190 place count 492 transition count 1192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 191 place count 491 transition count 1191
Iterating global reduction 0 with 1 rules applied. Total rules applied 192 place count 491 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 193 place count 490 transition count 1190
Iterating global reduction 0 with 1 rules applied. Total rules applied 194 place count 490 transition count 1190
Applied a total of 194 rules in 107 ms. Remains 490 /587 variables (removed 97) and now considering 1190/1287 (removed 97) transitions.
// Phase 1: matrix 1190 rows 490 cols
[2025-05-31 06:30:38] [INFO ] Computed 10 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:30:38] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-05-31 06:30:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:30:38] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2025-05-31 06:30:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 10/490 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (OVERLAPS) 1190/1680 variables, 490/500 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1680/1680 variables, and 500 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 10/490 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (OVERLAPS) 1190/1680 variables, 490/500 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1680 variables, 830/1330 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1680/1680 variables, and 1330 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 490/587 places, 1190/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60669 ms. Remains : 490/587 places, 1190/1287 transitions.
[2025-05-31 06:31:38] [INFO ] Flatten gal took : 27 ms
[2025-05-31 06:31:39] [INFO ] Flatten gal took : 25 ms
[2025-05-31 06:31:39] [INFO ] Input system was already deterministic with 1190 transitions.
[2025-05-31 06:31:39] [INFO ] Flatten gal took : 25 ms
[2025-05-31 06:31:39] [INFO ] Flatten gal took : 22 ms
[2025-05-31 06:31:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality17143294262095201889.gal : 14 ms
[2025-05-31 06:31:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality2128625825995689366.ctl : 6 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17143294262095201889.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2128625825995689366.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 06:32:09] [INFO ] Flatten gal took : 27 ms
[2025-05-31 06:32:09] [INFO ] Applying decomposition
[2025-05-31 06:32:09] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3119721425919967407.txt' '-o' '/tmp/graph3119721425919967407.bin' '-w' '/tmp/graph3119721425919967407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3119721425919967407.bin' '-l' '-1' '-v' '-w' '/tmp/graph3119721425919967407.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:32:09] [INFO ] Decomposing Gal with order
[2025-05-31 06:32:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:32:09] [INFO ] Removed a total of 375 redundant transitions.
[2025-05-31 06:32:09] [INFO ] Flatten gal took : 91 ms
[2025-05-31 06:32:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 11 ms.
[2025-05-31 06:32:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality3338349595136882976.gal : 9 ms
[2025-05-31 06:32:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality11360859131820483065.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3338349595136882976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11360859131820483065.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.97923e+16,0.104179,9136,87,25,554,603,354,375,122,908,0


Converting to forward existential form...Done !
original formula: AG(AF(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(TRUE)))] = FALSE
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,0.12105,9136,1,0,717,603,1030,424,421,908,1802
FORMULA BART-PT-010-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 1287/1287 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 555 transition count 1255
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 555 transition count 1255
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 85 place count 534 transition count 1234
Iterating global reduction 0 with 21 rules applied. Total rules applied 106 place count 534 transition count 1234
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 118 place count 522 transition count 1222
Iterating global reduction 0 with 12 rules applied. Total rules applied 130 place count 522 transition count 1222
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 514 transition count 1214
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 514 transition count 1214
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 153 place count 507 transition count 1207
Iterating global reduction 0 with 7 rules applied. Total rules applied 160 place count 507 transition count 1207
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 166 place count 501 transition count 1201
Iterating global reduction 0 with 6 rules applied. Total rules applied 172 place count 501 transition count 1201
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 176 place count 497 transition count 1197
Iterating global reduction 0 with 4 rules applied. Total rules applied 180 place count 497 transition count 1197
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 183 place count 494 transition count 1194
Iterating global reduction 0 with 3 rules applied. Total rules applied 186 place count 494 transition count 1194
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 188 place count 492 transition count 1192
Iterating global reduction 0 with 2 rules applied. Total rules applied 190 place count 492 transition count 1192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 191 place count 491 transition count 1191
Iterating global reduction 0 with 1 rules applied. Total rules applied 192 place count 491 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 193 place count 490 transition count 1190
Iterating global reduction 0 with 1 rules applied. Total rules applied 194 place count 490 transition count 1190
Applied a total of 194 rules in 112 ms. Remains 490 /587 variables (removed 97) and now considering 1190/1287 (removed 97) transitions.
[2025-05-31 06:32:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:32:09] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-31 06:32:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:32:10] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2025-05-31 06:32:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 10/490 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (OVERLAPS) 1190/1680 variables, 490/500 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1680/1680 variables, and 500 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 10/490 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (OVERLAPS) 1190/1680 variables, 490/500 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1680 variables, 830/1330 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1680/1680 variables, and 1330 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 490/587 places, 1190/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60644 ms. Remains : 490/587 places, 1190/1287 transitions.
[2025-05-31 06:33:10] [INFO ] Flatten gal took : 19 ms
[2025-05-31 06:33:10] [INFO ] Flatten gal took : 19 ms
[2025-05-31 06:33:10] [INFO ] Input system was already deterministic with 1190 transitions.
[2025-05-31 06:33:10] [INFO ] Flatten gal took : 18 ms
[2025-05-31 06:33:10] [INFO ] Flatten gal took : 17 ms
[2025-05-31 06:33:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality2454710485485237075.gal : 4 ms
[2025-05-31 06:33:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality8310119636868294469.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2454710485485237075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8310119636868294469.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 06:33:40] [INFO ] Flatten gal took : 16 ms
[2025-05-31 06:33:40] [INFO ] Applying decomposition
[2025-05-31 06:33:40] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5143826934504592497.txt' '-o' '/tmp/graph5143826934504592497.bin' '-w' '/tmp/graph5143826934504592497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5143826934504592497.bin' '-l' '-1' '-v' '-w' '/tmp/graph5143826934504592497.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:33:40] [INFO ] Decomposing Gal with order
[2025-05-31 06:33:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:33:40] [INFO ] Removed a total of 380 redundant transitions.
[2025-05-31 06:33:40] [INFO ] Flatten gal took : 38 ms
[2025-05-31 06:33:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 221 labels/synchronizations in 6 ms.
[2025-05-31 06:33:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality13238319110519753686.gal : 6 ms
[2025-05-31 06:33:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality3796735207811201053.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13238319110519753686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3796735207811201053.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.97923e+16,0.097188,9140,76,19,472,499,324,313,94,755,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * AX(FALSE))
=> equivalent forward existential formula: ([(Init * !(EX(TRUE)))] = FALSE * [(EY(Init) * !(FALSE))] = FALSE)
(forward)formula 0,0,0.099503,9140,1,0,472,499,490,313,133,755,441
FORMULA BART-PT-010-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 587/587 places, 1287/1287 transitions.
Graph (trivial) has 1257 edges and 587 vertex of which 492 / 587 are part of one of the 9 SCC in 4 ms
Free SCC test removed 483 places
Ensure Unique test removed 1087 transitions
Reduce isomorphic transitions removed 1087 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 100 transition count 185
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 88 transition count 180
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 39 place count 86 transition count 176
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 45 place count 84 transition count 172
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 51 place count 82 transition count 168
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 55 place count 80 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 58 place count 79 transition count 164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 60 place count 78 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 60 place count 78 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 64 place count 76 transition count 161
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 98 place count 59 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 103 place count 59 transition count 139
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 105 place count 58 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 107 place count 58 transition count 136
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 109 place count 57 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 111 place count 57 transition count 133
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 113 place count 56 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 115 place count 56 transition count 130
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 117 place count 55 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 119 place count 55 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 121 place count 54 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 122 place count 54 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 14 with 46 rules applied. Total rules applied 168 place count 54 transition count 79
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 14 with 8 rules applied. Total rules applied 176 place count 54 transition count 71
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 184 place count 46 transition count 71
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 3 Pre rules applied. Total rules applied 184 place count 46 transition count 68
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 190 place count 43 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 195 place count 43 transition count 63
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 16 with 5 rules applied. Total rules applied 200 place count 43 transition count 58
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 205 place count 38 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 206 place count 38 transition count 57
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 18 with 1 rules applied. Total rules applied 207 place count 38 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 208 place count 37 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 209 place count 37 transition count 55
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 20 with 1 rules applied. Total rules applied 210 place count 37 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 211 place count 36 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 212 place count 36 transition count 53
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 22 with 1 rules applied. Total rules applied 213 place count 36 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 214 place count 35 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 215 place count 35 transition count 51
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 24 with 1 rules applied. Total rules applied 216 place count 35 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 217 place count 34 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 218 place count 34 transition count 49
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 26 with 1 rules applied. Total rules applied 219 place count 34 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 220 place count 33 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 28 with 1 rules applied. Total rules applied 221 place count 33 transition count 47
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 28 with 1 rules applied. Total rules applied 222 place count 33 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 223 place count 32 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 30 with 1 rules applied. Total rules applied 224 place count 32 transition count 45
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 30 with 1 rules applied. Total rules applied 225 place count 32 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 226 place count 31 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 32 with 1 rules applied. Total rules applied 227 place count 31 transition count 43
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 32 with 1 rules applied. Total rules applied 228 place count 31 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 229 place count 30 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 34 with 1 rules applied. Total rules applied 230 place count 30 transition count 41
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 34 with 1 rules applied. Total rules applied 231 place count 30 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 232 place count 29 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 233 place count 29 transition count 39
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 36 with 1 rules applied. Total rules applied 234 place count 29 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 37 with 1 rules applied. Total rules applied 235 place count 28 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 38 with 1 rules applied. Total rules applied 236 place count 28 transition count 37
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 38 with 1 rules applied. Total rules applied 237 place count 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 39 with 1 rules applied. Total rules applied 238 place count 27 transition count 36
Applied a total of 238 rules in 55 ms. Remains 27 /587 variables (removed 560) and now considering 36/1287 (removed 1251) transitions.
// Phase 1: matrix 36 rows 27 cols
[2025-05-31 06:33:40] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:33:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-31 06:33:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:33:41] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:33:41] [INFO ] Redundant transitions in 1 ms returned []
Running 26 sub problems to find dead transitions.
[2025-05-31 06:33:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 6/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 35/62 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 0/62 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/63 variables, and 33 constraints, problems are : Problem set: 0 solved, 26 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 6/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 35/62 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/62 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/63 variables, and 59 constraints, problems are : Problem set: 0 solved, 26 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 535ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/587 places, 36/1287 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 651 ms. Remains : 27/587 places, 36/1287 transitions.
[2025-05-31 06:33:41] [INFO ] Flatten gal took : 1 ms
[2025-05-31 06:33:41] [INFO ] Flatten gal took : 3 ms
[2025-05-31 06:33:41] [INFO ] Input system was already deterministic with 36 transitions.
[2025-05-31 06:33:41] [INFO ] Flatten gal took : 1 ms
[2025-05-31 06:33:41] [INFO ] Flatten gal took : 1 ms
[2025-05-31 06:33:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality18033271747136517732.gal : 0 ms
[2025-05-31 06:33:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality4313382168539471787.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18033271747136517732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4313382168539471787.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1344,0.004729,3976,2,68,5,473,5,0,145,391,0


Converting to forward existential form...Done !
original formula: E(AF(AG(E(AG((TrainState_6_3_8==0)) U ((TrainState_5_2_4==0)||(TrainState_10_1_39==1))))) U (EG(AG((AF((TrainState_6_4_32==1)) * AF(((Tra...338
=> equivalent forward existential formula: ([FwdG(FwdU(Init,!(EG(!(!(E(TRUE U !(E(!(E(TRUE U !((TrainState_6_3_8==0)))) U ((TrainState_5_2_4==0)||(TrainSta...656
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 33/0/3
(forward)formula 0,0,0.014728,4488,1,0,18,2439,56,8,628,1372,29
FORMULA BART-PT-010-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 1287/1287 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 556 transition count 1256
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 556 transition count 1256
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 83 place count 535 transition count 1235
Iterating global reduction 0 with 21 rules applied. Total rules applied 104 place count 535 transition count 1235
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 116 place count 523 transition count 1223
Iterating global reduction 0 with 12 rules applied. Total rules applied 128 place count 523 transition count 1223
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 136 place count 515 transition count 1215
Iterating global reduction 0 with 8 rules applied. Total rules applied 144 place count 515 transition count 1215
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 151 place count 508 transition count 1208
Iterating global reduction 0 with 7 rules applied. Total rules applied 158 place count 508 transition count 1208
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 164 place count 502 transition count 1202
Iterating global reduction 0 with 6 rules applied. Total rules applied 170 place count 502 transition count 1202
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 174 place count 498 transition count 1198
Iterating global reduction 0 with 4 rules applied. Total rules applied 178 place count 498 transition count 1198
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 181 place count 495 transition count 1195
Iterating global reduction 0 with 3 rules applied. Total rules applied 184 place count 495 transition count 1195
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 186 place count 493 transition count 1193
Iterating global reduction 0 with 2 rules applied. Total rules applied 188 place count 493 transition count 1193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 189 place count 492 transition count 1192
Iterating global reduction 0 with 1 rules applied. Total rules applied 190 place count 492 transition count 1192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 191 place count 491 transition count 1191
Iterating global reduction 0 with 1 rules applied. Total rules applied 192 place count 491 transition count 1191
Applied a total of 192 rules in 113 ms. Remains 491 /587 variables (removed 96) and now considering 1191/1287 (removed 96) transitions.
// Phase 1: matrix 1191 rows 491 cols
[2025-05-31 06:33:41] [INFO ] Computed 10 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:33:41] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-05-31 06:33:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:33:42] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 831 sub problems to find dead transitions.
[2025-05-31 06:33:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (OVERLAPS) 10/491 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 3 (OVERLAPS) 1191/1682 variables, 491/501 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1682/1682 variables, and 501 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 831/831 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 831 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (OVERLAPS) 10/491 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 3 (OVERLAPS) 1191/1682 variables, 491/501 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1682 variables, 831/1332 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1682/1682 variables, and 1332 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 831/831 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 831 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 491/587 places, 1191/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60634 ms. Remains : 491/587 places, 1191/1287 transitions.
[2025-05-31 06:34:42] [INFO ] Flatten gal took : 32 ms
[2025-05-31 06:34:42] [INFO ] Flatten gal took : 16 ms
[2025-05-31 06:34:42] [INFO ] Input system was already deterministic with 1191 transitions.
[2025-05-31 06:34:42] [INFO ] Flatten gal took : 15 ms
[2025-05-31 06:34:42] [INFO ] Flatten gal took : 15 ms
[2025-05-31 06:34:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality16051264316158313347.gal : 4 ms
[2025-05-31 06:34:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality12898219789048878017.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16051264316158313347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12898219789048878017.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 06:35:12] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:35:12] [INFO ] Applying decomposition
[2025-05-31 06:35:12] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6399560214629266021.txt' '-o' '/tmp/graph6399560214629266021.bin' '-w' '/tmp/graph6399560214629266021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6399560214629266021.bin' '-l' '-1' '-v' '-w' '/tmp/graph6399560214629266021.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:35:12] [INFO ] Decomposing Gal with order
[2025-05-31 06:35:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:35:12] [INFO ] Removed a total of 388 redundant transitions.
[2025-05-31 06:35:12] [INFO ] Flatten gal took : 62 ms
[2025-05-31 06:35:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 8 ms.
[2025-05-31 06:35:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality13462486440615839753.gal : 7 ms
[2025-05-31 06:35:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9816559039747265746.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13462486440615839753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9816559039747265746.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,8.14207e+16,0.130292,9184,75,25,447,461,339,300,112,649,0


Converting to forward existential form...Done !
original formula: AF(AX(EF(AX((i3.u102.TrainState_8_2_38==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(E(TRUE U !(EX(!((i3.u102.TrainState_8_2_38==0))))))))))] = FALSE
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,0.156145,9440,1,0,824,1222,1412,611,446,1273,2435
FORMULA BART-PT-010-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 1287/1287 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 559 transition count 1259
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 559 transition count 1259
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 74 place count 541 transition count 1241
Iterating global reduction 0 with 18 rules applied. Total rules applied 92 place count 541 transition count 1241
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 102 place count 531 transition count 1231
Iterating global reduction 0 with 10 rules applied. Total rules applied 112 place count 531 transition count 1231
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 119 place count 524 transition count 1224
Iterating global reduction 0 with 7 rules applied. Total rules applied 126 place count 524 transition count 1224
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 132 place count 518 transition count 1218
Iterating global reduction 0 with 6 rules applied. Total rules applied 138 place count 518 transition count 1218
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 143 place count 513 transition count 1213
Iterating global reduction 0 with 5 rules applied. Total rules applied 148 place count 513 transition count 1213
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 152 place count 509 transition count 1209
Iterating global reduction 0 with 4 rules applied. Total rules applied 156 place count 509 transition count 1209
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 159 place count 506 transition count 1206
Iterating global reduction 0 with 3 rules applied. Total rules applied 162 place count 506 transition count 1206
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 164 place count 504 transition count 1204
Iterating global reduction 0 with 2 rules applied. Total rules applied 166 place count 504 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 167 place count 503 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 168 place count 503 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 169 place count 502 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 170 place count 502 transition count 1202
Applied a total of 170 rules in 123 ms. Remains 502 /587 variables (removed 85) and now considering 1202/1287 (removed 85) transitions.
// Phase 1: matrix 1202 rows 502 cols
[2025-05-31 06:35:12] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:35:13] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-31 06:35:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:35:13] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 842 sub problems to find dead transitions.
[2025-05-31 06:35:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (OVERLAPS) 10/502 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 842 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1704 variables, and 10 constraints, problems are : Problem set: 0 solved, 842 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 842/842 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 842 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (OVERLAPS) 10/502 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 3 (OVERLAPS) 1202/1704 variables, 502/512 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1704 variables, 842/1354 constraints. Problems are: Problem set: 0 solved, 842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 1354 constraints, problems are : Problem set: 0 solved, 842 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 842/842 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 842 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 502/587 places, 1202/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60741 ms. Remains : 502/587 places, 1202/1287 transitions.
[2025-05-31 06:36:13] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:36:13] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:36:13] [INFO ] Input system was already deterministic with 1202 transitions.
[2025-05-31 06:36:13] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:36:13] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:36:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality18364911939035899551.gal : 4 ms
[2025-05-31 06:36:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality1195762472787902073.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18364911939035899551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1195762472787902073.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.00724e+17,0.388099,9720,2,995,5,7964,6,0,3213,4479,0


Converting to forward existential form...Done !
original formula: (AF((TrainState_7_4_21==1)) + (AG((TrainState_10_3_31==1)) * EX((((TrainState_7_2_12==1) + AF((TrainState_4_1_7==0))) * AG(((TrainState_3...194
=> equivalent forward existential formula: ([(FwdU((Init * !(!(EG(!((TrainState_7_4_21==1)))))),TRUE) * !((TrainState_10_3_31==1)))] = FALSE * [((Init * !(...337
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.76419,48376,1,0,7,256933,28,2,13353,12013,9
FORMULA BART-PT-010-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 587/587 places, 1287/1287 transitions.
Graph (trivial) has 1285 edges and 587 vertex of which 581 / 587 are part of one of the 10 SCC in 4 ms
Free SCC test removed 571 places
Ensure Unique test removed 1267 transitions
Reduce isomorphic transitions removed 1267 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 7 transition count 11
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 13 place count 6 transition count 9
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 19 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 20 place count 3 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 21 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 21 place count 3 transition count 3
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 23 place count 2 transition count 3
Applied a total of 23 rules in 14 ms. Remains 2 /587 variables (removed 585) and now considering 3/1287 (removed 1284) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-05-31 06:36:15] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:36:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-31 06:36:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:36:15] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:36:15] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-05-31 06:36:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/587 places, 3/1287 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 122 ms. Remains : 2/587 places, 3/1287 transitions.
[2025-05-31 06:36:15] [INFO ] Flatten gal took : 0 ms
[2025-05-31 06:36:15] [INFO ] Flatten gal took : 0 ms
[2025-05-31 06:36:15] [INFO ] Input system was already deterministic with 3 transitions.
[2025-05-31 06:36:15] [INFO ] Flatten gal took : 0 ms
[2025-05-31 06:36:15] [INFO ] Flatten gal took : 0 ms
[2025-05-31 06:36:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality9726254591376043180.gal : 0 ms
[2025-05-31 06:36:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality10697026471892764315.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9726254591376043180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10697026471892764315.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.001536,3660,2,4,5,12,5,0,12,6,0


Converting to forward existential form...Done !
original formula: EF(EG((TrainState_10_4_21==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(TrainState_10_4_21==0))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.00206,3916,1,0,5,18,18,0,49,11,8
FORMULA BART-PT-010-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 1287/1287 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 561 transition count 1261
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 561 transition count 1261
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 70 place count 543 transition count 1243
Iterating global reduction 0 with 18 rules applied. Total rules applied 88 place count 543 transition count 1243
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 98 place count 533 transition count 1233
Iterating global reduction 0 with 10 rules applied. Total rules applied 108 place count 533 transition count 1233
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 526 transition count 1226
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 526 transition count 1226
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 128 place count 520 transition count 1220
Iterating global reduction 0 with 6 rules applied. Total rules applied 134 place count 520 transition count 1220
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 139 place count 515 transition count 1215
Iterating global reduction 0 with 5 rules applied. Total rules applied 144 place count 515 transition count 1215
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 512 transition count 1212
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 512 transition count 1212
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 509 transition count 1209
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 509 transition count 1209
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 507 transition count 1207
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 507 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 506 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 506 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 163 place count 505 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 164 place count 505 transition count 1205
Applied a total of 164 rules in 106 ms. Remains 505 /587 variables (removed 82) and now considering 1205/1287 (removed 82) transitions.
// Phase 1: matrix 1205 rows 505 cols
[2025-05-31 06:36:15] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:36:15] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-31 06:36:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:36:16] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 845 sub problems to find dead transitions.
[2025-05-31 06:36:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (OVERLAPS) 10/505 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 845 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/1710 variables, and 10 constraints, problems are : Problem set: 0 solved, 845 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/505 constraints, PredecessorRefiner: 845/845 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 845 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (OVERLAPS) 10/505 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1710 variables, 505/515 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1710 variables, 845/1360 constraints. Problems are: Problem set: 0 solved, 845 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1710/1710 variables, and 1360 constraints, problems are : Problem set: 0 solved, 845 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 845/845 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 505/587 places, 1205/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60648 ms. Remains : 505/587 places, 1205/1287 transitions.
[2025-05-31 06:37:16] [INFO ] Flatten gal took : 15 ms
[2025-05-31 06:37:16] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:37:16] [INFO ] Input system was already deterministic with 1205 transitions.
[2025-05-31 06:37:16] [INFO ] Flatten gal took : 15 ms
[2025-05-31 06:37:16] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:37:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality14387819628834764119.gal : 3 ms
[2025-05-31 06:37:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15696232077156784366.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14387819628834764119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15696232077156784366.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.06733e+17,0.397227,9860,2,1001,5,8148,6,0,3228,4564,0


Converting to forward existential form...Done !
original formula: (EF((TrainState_10_4_15==1)) * A(AF((AX(((TrainState_7_2_39==0)||(TrainState_4_3_31==1))) + !(((TrainState_9_2_22==0)||(TrainState_8_1_11...224
=> equivalent forward existential formula: [(((Init * E(TRUE U (TrainState_10_4_15==1))) * !(EG(!(EX(!(E(TRUE U !(((TrainState_4_3_11==1)||(TrainState_9_2_...467
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,1.79588,50384,1,0,13,268432,26,4,14406,16765,13
FORMULA BART-PT-010-CTLCardinality-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 1287/1287 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 557 transition count 1257
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 557 transition count 1257
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 79 place count 538 transition count 1238
Iterating global reduction 0 with 19 rules applied. Total rules applied 98 place count 538 transition count 1238
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 528 transition count 1228
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 528 transition count 1228
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 126 place count 520 transition count 1220
Iterating global reduction 0 with 8 rules applied. Total rules applied 134 place count 520 transition count 1220
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 141 place count 513 transition count 1213
Iterating global reduction 0 with 7 rules applied. Total rules applied 148 place count 513 transition count 1213
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 154 place count 507 transition count 1207
Iterating global reduction 0 with 6 rules applied. Total rules applied 160 place count 507 transition count 1207
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 164 place count 503 transition count 1203
Iterating global reduction 0 with 4 rules applied. Total rules applied 168 place count 503 transition count 1203
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 171 place count 500 transition count 1200
Iterating global reduction 0 with 3 rules applied. Total rules applied 174 place count 500 transition count 1200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 176 place count 498 transition count 1198
Iterating global reduction 0 with 2 rules applied. Total rules applied 178 place count 498 transition count 1198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 179 place count 497 transition count 1197
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 497 transition count 1197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 181 place count 496 transition count 1196
Iterating global reduction 0 with 1 rules applied. Total rules applied 182 place count 496 transition count 1196
Applied a total of 182 rules in 107 ms. Remains 496 /587 variables (removed 91) and now considering 1196/1287 (removed 91) transitions.
// Phase 1: matrix 1196 rows 496 cols
[2025-05-31 06:37:18] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:37:18] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-31 06:37:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:37:18] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 836 sub problems to find dead transitions.
[2025-05-31 06:37:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (OVERLAPS) 10/496 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 3 (OVERLAPS) 1196/1692 variables, 496/506 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1692/1692 variables, and 506 constraints, problems are : Problem set: 0 solved, 836 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 836/836 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 836 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (OVERLAPS) 10/496 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 3 (OVERLAPS) 1196/1692 variables, 496/506 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1692 variables, 836/1342 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1692/1692 variables, and 1342 constraints, problems are : Problem set: 0 solved, 836 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 836/836 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 836 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 496/587 places, 1196/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60615 ms. Remains : 496/587 places, 1196/1287 transitions.
[2025-05-31 06:38:18] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:38:18] [INFO ] Flatten gal took : 13 ms
[2025-05-31 06:38:18] [INFO ] Input system was already deterministic with 1196 transitions.
[2025-05-31 06:38:18] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:38:18] [INFO ] Flatten gal took : 13 ms
[2025-05-31 06:38:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality15050809994182201091.gal : 3 ms
[2025-05-31 06:38:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality17568389864645918201.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15050809994182201091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17568389864645918201.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,8.99324e+16,0.378462,9684,2,983,5,7842,6,0,3183,4300,0


Converting to forward existential form...Done !
original formula: EF((AF(E(AX(FALSE) U (((TrainState_10_1_40==0)||(TrainState_2_3_34==1))&&(TrainState_5_1_25==1)))) * A((TrainState_5_3_11==0) U EX((Train...175
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EG(!(E(!(EX(!(FALSE))) U (((TrainState_10_1_40==0)||(TrainState_2_3_34==1))&&(TrainState...323
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1.84632,58868,1,0,48,378513,26,43,13224,102588,50
FORMULA BART-PT-010-CTLCardinality-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 1287/1287 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 560 transition count 1260
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 560 transition count 1260
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 73 place count 541 transition count 1241
Iterating global reduction 0 with 19 rules applied. Total rules applied 92 place count 541 transition count 1241
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 104 place count 529 transition count 1229
Iterating global reduction 0 with 12 rules applied. Total rules applied 116 place count 529 transition count 1229
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 124 place count 521 transition count 1221
Iterating global reduction 0 with 8 rules applied. Total rules applied 132 place count 521 transition count 1221
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 139 place count 514 transition count 1214
Iterating global reduction 0 with 7 rules applied. Total rules applied 146 place count 514 transition count 1214
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 152 place count 508 transition count 1208
Iterating global reduction 0 with 6 rules applied. Total rules applied 158 place count 508 transition count 1208
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 162 place count 504 transition count 1204
Iterating global reduction 0 with 4 rules applied. Total rules applied 166 place count 504 transition count 1204
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 169 place count 501 transition count 1201
Iterating global reduction 0 with 3 rules applied. Total rules applied 172 place count 501 transition count 1201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 174 place count 499 transition count 1199
Iterating global reduction 0 with 2 rules applied. Total rules applied 176 place count 499 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 177 place count 498 transition count 1198
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 498 transition count 1198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 179 place count 497 transition count 1197
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 497 transition count 1197
Applied a total of 180 rules in 107 ms. Remains 497 /587 variables (removed 90) and now considering 1197/1287 (removed 90) transitions.
// Phase 1: matrix 1197 rows 497 cols
[2025-05-31 06:38:20] [INFO ] Computed 10 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:38:20] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-05-31 06:38:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:38:21] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 837 sub problems to find dead transitions.
[2025-05-31 06:38:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 1 (OVERLAPS) 10/497 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 837 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 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.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 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1197/1694 variables, 497/507 constraints. Problems are: Problem set: 0 solved, 837 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 507 constraints, problems are : Problem set: 0 solved, 837 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 837/837 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 837 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 1 (OVERLAPS) 10/497 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 3 (OVERLAPS) 1197/1694 variables, 497/507 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 837/1344 constraints. Problems are: Problem set: 0 solved, 837 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 1344 constraints, problems are : Problem set: 0 solved, 837 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 837/837 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 837 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 497/587 places, 1197/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60638 ms. Remains : 497/587 places, 1197/1287 transitions.
[2025-05-31 06:39:21] [INFO ] Flatten gal took : 13 ms
[2025-05-31 06:39:21] [INFO ] Flatten gal took : 13 ms
[2025-05-31 06:39:21] [INFO ] Input system was already deterministic with 1197 transitions.
[2025-05-31 06:39:21] [INFO ] Flatten gal took : 13 ms
[2025-05-31 06:39:21] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:39:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality4967510167318700755.gal : 3 ms
[2025-05-31 06:39:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality10117512667295283216.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4967510167318700755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10117512667295283216.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 06:39:51] [INFO ] Flatten gal took : 16 ms
[2025-05-31 06:39:51] [INFO ] Applying decomposition
[2025-05-31 06:39:51] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17893665686116507011.txt' '-o' '/tmp/graph17893665686116507011.bin' '-w' '/tmp/graph17893665686116507011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17893665686116507011.bin' '-l' '-1' '-v' '-w' '/tmp/graph17893665686116507011.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:39:51] [INFO ] Decomposing Gal with order
[2025-05-31 06:39:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:39:51] [INFO ] Removed a total of 384 redundant transitions.
[2025-05-31 06:39:51] [INFO ] Flatten gal took : 46 ms
[2025-05-31 06:39:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 209 labels/synchronizations in 6 ms.
[2025-05-31 06:39:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality1192746541527313841.gal : 4 ms
[2025-05-31 06:39:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality17584238869160661464.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1192746541527313841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17584238869160661464.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,9.18398e+16,0.106446,9204,131,33,897,912,467,573,157,1357,0


Converting to forward existential form...Done !
original formula: AF(AX(AX((((i5.u58.TrainState_6_2_22==1)&&((i2.u42.TrainState_9_3_15==0)||(i3.u84.TrainState_5_3_30==1)))||((i7.u102.TrainState_1_2_39==1...193
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(EX(!((((i5.u58.TrainState_6_2_22==1)&&((i2.u42.TrainState_9_3_15==0)||(i3.u84.TrainState_5...250
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,0,0.149531,9460,1,0,2162,1350,2218,1892,645,2275,6645
FORMULA BART-PT-010-CTLCardinality-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

[2025-05-31 06:39:51] [INFO ] Flatten gal took : 16 ms
[2025-05-31 06:39:51] [INFO ] Flatten gal took : 15 ms
Total runtime 616534 ms.

BK_STOP 1748673591914

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-010"
export BK_EXAMINATION="CTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is BART-PT-010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853730100841"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-010.tgz
mv BART-PT-010 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;