Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r018-smll-177946788000233.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is BART-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 450K Mar 5 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Mar 5 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Mar 5 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 690K Mar 5 09:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 309K Mar 15 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 832K Mar 15 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 141K Mar 15 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 372K Mar 15 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 501K Mar 5 09:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Mar 5 09:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 553K Mar 5 09:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.8M Mar 5 09:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 36K Mar 15 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 74K Mar 15 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 3 18:30 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-005-CTLCardinality-2024-00
FORMULA_NAME BART-PT-005-CTLCardinality-2024-01
FORMULA_NAME BART-PT-005-CTLCardinality-2024-02
FORMULA_NAME BART-PT-005-CTLCardinality-2024-03
FORMULA_NAME BART-PT-005-CTLCardinality-2024-04
FORMULA_NAME BART-PT-005-CTLCardinality-2024-05
FORMULA_NAME BART-PT-005-CTLCardinality-2024-06
FORMULA_NAME BART-PT-005-CTLCardinality-2024-07
FORMULA_NAME BART-PT-005-CTLCardinality-2024-08
FORMULA_NAME BART-PT-005-CTLCardinality-2024-09
FORMULA_NAME BART-PT-005-CTLCardinality-2024-10
FORMULA_NAME BART-PT-005-CTLCardinality-2024-11
FORMULA_NAME BART-PT-005-CTLCardinality-2024-12
FORMULA_NAME BART-PT-005-CTLCardinality-2024-13
FORMULA_NAME BART-PT-005-CTLCardinality-2024-14
FORMULA_NAME BART-PT-005-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779549011056

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-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 15:10:12] [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]
[2026-05-23 15:10:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 15:10:13] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2026-05-23 15:10:13] [INFO ] Transformed 870 places.
[2026-05-23 15:10:13] [INFO ] Transformed 1010 transitions.
[2026-05-23 15:10:13] [INFO ] Found NUPN structural information;
[2026-05-23 15:10:13] [INFO ] Parsed PT model containing 870 places and 1010 transitions and 8100 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 93 ms.
Initial state reduction rules removed 1 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-005-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 142 places :
Symmetric choice reduction at 0 with 142 rule applications. Total rules 142 place count 518 transition count 868
Iterating global reduction 0 with 142 rules applied. Total rules applied 284 place count 518 transition count 868
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 397 place count 405 transition count 755
Iterating global reduction 0 with 113 rules applied. Total rules applied 510 place count 405 transition count 755
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 528 place count 387 transition count 737
Iterating global reduction 0 with 18 rules applied. Total rules applied 546 place count 387 transition count 737
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 560 place count 373 transition count 723
Iterating global reduction 0 with 14 rules applied. Total rules applied 574 place count 373 transition count 723
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 587 place count 360 transition count 710
Iterating global reduction 0 with 13 rules applied. Total rules applied 600 place count 360 transition count 710
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 611 place count 349 transition count 699
Iterating global reduction 0 with 11 rules applied. Total rules applied 622 place count 349 transition count 699
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 631 place count 340 transition count 690
Iterating global reduction 0 with 9 rules applied. Total rules applied 640 place count 340 transition count 690
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 646 place count 334 transition count 684
Iterating global reduction 0 with 6 rules applied. Total rules applied 652 place count 334 transition count 684
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 657 place count 329 transition count 679
Iterating global reduction 0 with 5 rules applied. Total rules applied 662 place count 329 transition count 679
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 666 place count 325 transition count 675
Iterating global reduction 0 with 4 rules applied. Total rules applied 670 place count 325 transition count 675
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 672 place count 323 transition count 673
Iterating global reduction 0 with 2 rules applied. Total rules applied 674 place count 323 transition count 673
Applied a total of 674 rules in 231 ms. Remains 323 /660 variables (removed 337) and now considering 673/1010 (removed 337) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15560527984463846298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4902430223465300537.kers'
[2026-05-23 15:10:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15560527984463846298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4902430223465300537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 673 rows 323 cols 1346 entries
Finished phase 1 with 318 SingleSign rule and 0 generalized
[2026-05-23 15:10:13] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4902430223465300537.kers
Total runtime 6 ms.
[2026-05-23 15:10:14] [INFO ] Implicit Places using invariants in 361 ms returned []
[2026-05-23 15:10:14] [INFO ] Invariant cache hit.
[2026-05-23 15:10:14] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
Running 493 sub problems to find dead transitions.
[2026-05-23 15:10:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (OVERLAPS) 5/323 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (OVERLAPS) 673/996 variables, 323/328 constraints. Problems are: Problem set: 0 solved, 493 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 996/996 variables, and 328 constraints, problems are : Problem set: 0 solved, 493 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 493 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (OVERLAPS) 5/323 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (OVERLAPS) 673/996 variables, 323/328 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/996 variables, 493/821 constraints. Problems are: Problem set: 0 solved, 493 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 996/996 variables, and 821 constraints, problems are : Problem set: 0 solved, 493 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 493 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 323/660 places, 673/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61428 ms. Remains : 323/660 places, 673/1010 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 673/673 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2026-05-23 15:11:14] [INFO ] Invariant cache hit.
[2026-05-23 15:11:15] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-23 15:11:15] [INFO ] Invariant cache hit.
[2026-05-23 15:11:15] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 323/323 places, 673/673 transitions.
Support contains 33 out of 323 places after structural reductions.
[2026-05-23 15:11:15] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2026-05-23 15:11:15] [INFO ] Flatten gal took : 91 ms
[2026-05-23 15:11:15] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-23 15:11:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BART-PT-005-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 15:11:15] [INFO ] Flatten gal took : 45 ms
FORMULA BART-PT-005-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 15:11:15] [INFO ] Input system was already deterministic with 673 transitions.
Support contains 22 out of 323 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1344 ms. (29 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
[2026-05-23 15:11:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 67/996 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/5 constraints, State Equation: 0/323 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
[2026-05-23 15:11:16] [INFO ] Flatten gal took : 36 ms
[2026-05-23 15:11:16] [INFO ] Flatten gal took : 31 ms
[2026-05-23 15:11:16] [INFO ] Input system was already deterministic with 673 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 673/673 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 299 transition count 649
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 299 transition count 649
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 281 transition count 631
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 281 transition count 631
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 272 transition count 622
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 272 transition count 622
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 109 place count 265 transition count 615
Iterating global reduction 0 with 7 rules applied. Total rules applied 116 place count 265 transition count 615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 123 place count 258 transition count 608
Iterating global reduction 0 with 7 rules applied. Total rules applied 130 place count 258 transition count 608
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 135 place count 253 transition count 603
Iterating global reduction 0 with 5 rules applied. Total rules applied 140 place count 253 transition count 603
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 143 place count 250 transition count 600
Iterating global reduction 0 with 3 rules applied. Total rules applied 146 place count 250 transition count 600
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 149 place count 247 transition count 597
Iterating global reduction 0 with 3 rules applied. Total rules applied 152 place count 247 transition count 597
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 246 transition count 596
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 246 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 155 place count 245 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 156 place count 245 transition count 595
Applied a total of 156 rules in 54 ms. Remains 245 /323 variables (removed 78) and now considering 595/673 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15915095545589791376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2317951420943172814.kers'
[2026-05-23 15:11:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15915095545589791376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2317951420943172814.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 595 rows 245 cols 1190 entries
Finished phase 1 with 240 SingleSign rule and 0 generalized
[2026-05-23 15:11:16] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2317951420943172814.kers
Total runtime 4 ms.
[2026-05-23 15:11:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 15:11:16] [INFO ] Invariant cache hit.
[2026-05-23 15:11:16] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2026-05-23 15:11:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 245/323 places, 595/673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60493 ms. Remains : 245/323 places, 595/673 transitions.
[2026-05-23 15:12:17] [INFO ] Flatten gal took : 25 ms
[2026-05-23 15:12:17] [INFO ] Flatten gal took : 25 ms
[2026-05-23 15:12:17] [INFO ] Input system was already deterministic with 595 transitions.
[2026-05-23 15:12:17] [INFO ] Flatten gal took : 23 ms
[2026-05-23 15:12:17] [INFO ] Flatten gal took : 23 ms
[2026-05-23 15:12:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality6441851079342352601.gal : 14 ms
[2026-05-23 15:12:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3176487624216024362.ctl : 4 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6441851079342352601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3176487624216024362.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.82475e+08,0.832062,26344,2,7558,5,162456,6,0,1578,64128,0


Converting to forward existential form...Done !
original formula: EX(EF(EG(AX(FALSE))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),!(EX(!(FALSE))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,5.44419,145356,1,0,6,818530,16,0,6541,142437,7
FORMULA BART-PT-005-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 673/673 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 299 transition count 649
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 299 transition count 649
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 281 transition count 631
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 281 transition count 631
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 272 transition count 622
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 272 transition count 622
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 109 place count 265 transition count 615
Iterating global reduction 0 with 7 rules applied. Total rules applied 116 place count 265 transition count 615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 123 place count 258 transition count 608
Iterating global reduction 0 with 7 rules applied. Total rules applied 130 place count 258 transition count 608
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 135 place count 253 transition count 603
Iterating global reduction 0 with 5 rules applied. Total rules applied 140 place count 253 transition count 603
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 143 place count 250 transition count 600
Iterating global reduction 0 with 3 rules applied. Total rules applied 146 place count 250 transition count 600
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 149 place count 247 transition count 597
Iterating global reduction 0 with 3 rules applied. Total rules applied 152 place count 247 transition count 597
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 246 transition count 596
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 246 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 155 place count 245 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 156 place count 245 transition count 595
Applied a total of 156 rules in 51 ms. Remains 245 /323 variables (removed 78) and now considering 595/673 (removed 78) transitions.
[2026-05-23 15:12:22] [INFO ] Invariant cache hit.
[2026-05-23 15:12:22] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 15:12:22] [INFO ] Invariant cache hit.
[2026-05-23 15:12:23] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 245/323 places, 595/673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 245/323 places, 595/673 transitions.
[2026-05-23 15:12:23] [INFO ] Flatten gal took : 21 ms
[2026-05-23 15:12:23] [INFO ] Flatten gal took : 18 ms
[2026-05-23 15:12:23] [INFO ] Input system was already deterministic with 595 transitions.
[2026-05-23 15:12:23] [INFO ] Flatten gal took : 17 ms
[2026-05-23 15:12:23] [INFO ] Flatten gal took : 16 ms
[2026-05-23 15:12:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality10569728548806245210.gal : 7 ms
[2026-05-23 15:12:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality4131761473138071125.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10569728548806245210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4131761473138071125.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.82475e+08,0.716554,26404,2,7558,5,162456,6,0,1578,64128,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.787159,26404,1,0,6,162456,7,1,2007,64128,1
FORMULA BART-PT-005-CTLCardinality-2024-09 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 : 323/323 places, 673/673 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 303 transition count 653
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 303 transition count 653
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 55 place count 288 transition count 638
Iterating global reduction 0 with 15 rules applied. Total rules applied 70 place count 288 transition count 638
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 281 transition count 631
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 281 transition count 631
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 276 transition count 626
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 276 transition count 626
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 271 transition count 621
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 271 transition count 621
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 267 transition count 617
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 267 transition count 617
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 265 transition count 615
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 265 transition count 615
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 263 transition count 613
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 263 transition count 613
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 262 transition count 612
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 262 transition count 612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 261 transition count 611
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 261 transition count 611
Applied a total of 124 rules in 49 ms. Remains 261 /323 variables (removed 62) and now considering 611/673 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8999046320900320365.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7604730081690556605.kers'
[2026-05-23 15:12:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8999046320900320365.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7604730081690556605.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 611 rows 261 cols 1222 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 15:12:24] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7604730081690556605.kers
Total runtime 3 ms.
[2026-05-23 15:12:24] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-23 15:12:24] [INFO ] Invariant cache hit.
[2026-05-23 15:12:24] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2026-05-23 15:12:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 5/261 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (OVERLAPS) 611/872 variables, 261/266 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/872 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 872/872 variables, and 266 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 5/261 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (OVERLAPS) 611/872 variables, 261/266 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/872 variables, 431/697 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/872 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 872/872 variables, and 697 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 261/323 places, 611/673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60461 ms. Remains : 261/323 places, 611/673 transitions.
[2026-05-23 15:13:24] [INFO ] Flatten gal took : 16 ms
[2026-05-23 15:13:24] [INFO ] Flatten gal took : 15 ms
[2026-05-23 15:13:24] [INFO ] Input system was already deterministic with 611 transitions.
[2026-05-23 15:13:24] [INFO ] Flatten gal took : 14 ms
[2026-05-23 15:13:24] [INFO ] Flatten gal took : 14 ms
[2026-05-23 15:13:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality13995225686151547540.gal : 4 ms
[2026-05-23 15:13:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality9997789057774838617.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13995225686151547540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9997789057774838617.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.81771e+08,0.188715,6808,2,518,5,4245,6,0,1658,2485,0


Converting to forward existential form...Done !
original formula: AX((A(((!((TrainState_5_4_12==1)&&(TrainState_4_1_5==0)))||(TrainState_3_1_37==0)) U !((EG((TrainState_4_4_26==1)) + AX((TrainState_3_1_4...208
=> equivalent forward existential formula: ((([FwdG((FwdU(EY(Init),!(!((EG((TrainState_4_4_26==1)) + !(EX(!((TrainState_3_1_40==1)))))))) * !(((!((TrainSta...639
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.648248,16604,1,0,11,76305,40,4,6402,8420,15
FORMULA BART-PT-005-CTLCardinality-2024-10 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 : 323/323 places, 673/673 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 304 transition count 654
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 304 transition count 654
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 52 place count 290 transition count 640
Iterating global reduction 0 with 14 rules applied. Total rules applied 66 place count 290 transition count 640
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 284 transition count 634
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 284 transition count 634
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 279 transition count 629
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 279 transition count 629
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 274 transition count 624
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 274 transition count 624
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 270 transition count 620
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 270 transition count 620
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 268 transition count 618
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 268 transition count 618
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 266 transition count 616
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 266 transition count 616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 265 transition count 615
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 265 transition count 615
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 264 transition count 614
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 264 transition count 614
Applied a total of 118 rules in 47 ms. Remains 264 /323 variables (removed 59) and now considering 614/673 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3564249552033004740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16617982582324787042.kers'
[2026-05-23 15:13:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3564249552033004740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16617982582324787042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 614 rows 264 cols 1228 entries
Finished phase 1 with 259 SingleSign rule and 0 generalized
[2026-05-23 15:13:25] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16617982582324787042.kers
Total runtime 3 ms.
[2026-05-23 15:13:25] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 15:13:25] [INFO ] Invariant cache hit.
[2026-05-23 15:13:25] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2026-05-23 15:13:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 5/264 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (OVERLAPS) 614/878 variables, 264/269 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/878 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 878/878 variables, and 269 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 5/264 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (OVERLAPS) 614/878 variables, 264/269 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/878 variables, 434/703 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/878 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 878/878 variables, and 703 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 264/323 places, 614/673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60456 ms. Remains : 264/323 places, 614/673 transitions.
[2026-05-23 15:14:25] [INFO ] Flatten gal took : 14 ms
[2026-05-23 15:14:25] [INFO ] Flatten gal took : 14 ms
[2026-05-23 15:14:25] [INFO ] Input system was already deterministic with 614 transitions.
[2026-05-23 15:14:25] [INFO ] Flatten gal took : 13 ms
[2026-05-23 15:14:25] [INFO ] Flatten gal took : 12 ms
[2026-05-23 15:14:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality14120489920647640059.gal : 5 ms
[2026-05-23 15:14:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality10952323542392493587.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14120489920647640059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10952323542392493587.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.02523e+08,1.35245,36744,2,8100,5,230218,6,0,1673,99547,0


Converting to forward existential form...Done !
original formula: !(E(EX((AF(((TrainState_5_1_32==0)&&(TrainState_5_2_36==0))) + (TrainState_2_1_26==0))) U AG(((EF(((TrainState_1_4_31==0)||(TrainState_4_...257
=> equivalent forward existential formula: [(FwdU(Init,EX((!(EG(!(((TrainState_5_1_32==0)&&(TrainState_5_2_36==0))))) + (TrainState_2_1_26==0)))) * !(E(TRU...341
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,10.2579,207776,1,0,12,1.39379e+06,36,3,7517,280709,18
FORMULA BART-PT-005-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 673/673 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 303 transition count 653
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 303 transition count 653
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 55 place count 288 transition count 638
Iterating global reduction 0 with 15 rules applied. Total rules applied 70 place count 288 transition count 638
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 279 transition count 629
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 279 transition count 629
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 274 transition count 624
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 274 transition count 624
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 269 transition count 619
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 269 transition count 619
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 266 transition count 616
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 266 transition count 616
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 264 transition count 614
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 264 transition count 614
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 262 transition count 612
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 262 transition count 612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 261 transition count 611
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 261 transition count 611
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 260 transition count 610
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 260 transition count 610
Applied a total of 126 rules in 42 ms. Remains 260 /323 variables (removed 63) and now considering 610/673 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14246863681025795693.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15877924225415898429.kers'
[2026-05-23 15:14:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14246863681025795693.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15877924225415898429.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 610 rows 260 cols 1220 entries
Finished phase 1 with 255 SingleSign rule and 0 generalized
[2026-05-23 15:14:36] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15877924225415898429.kers
Total runtime 3 ms.
[2026-05-23 15:14:36] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 15:14:36] [INFO ] Invariant cache hit.
[2026-05-23 15:14:36] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2026-05-23 15:14:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 5/260 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 610/870 variables, 260/265 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 870/870 variables, and 265 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 5/260 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 610/870 variables, 260/265 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 430/695 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 870/870 variables, and 695 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 260/323 places, 610/673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60436 ms. Remains : 260/323 places, 610/673 transitions.
[2026-05-23 15:15:36] [INFO ] Flatten gal took : 18 ms
[2026-05-23 15:15:36] [INFO ] Flatten gal took : 17 ms
[2026-05-23 15:15:36] [INFO ] Input system was already deterministic with 610 transitions.
[2026-05-23 15:15:36] [INFO ] Flatten gal took : 16 ms
[2026-05-23 15:15:36] [INFO ] Flatten gal took : 17 ms
[2026-05-23 15:15:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality3376462439977840974.gal : 6 ms
[2026-05-23 15:15:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality15318585706609068008.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3376462439977840974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15318585706609068008.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.76477e+08,0.328431,6808,2,719,5,7223,6,0,1653,3909,0


Converting to forward existential form...Done !
original formula: EG((((TrainState_1_3_30==0)||(TrainState_4_2_10==1)) * (AF(AX(A((TrainState_5_4_16==1) U (TrainState_1_4_26==1)))) + EG((TrainState_1_1_1...164
=> equivalent forward existential formula: [FwdG(Init,(((TrainState_1_3_30==0)||(TrainState_4_2_10==1)) * (!(EG(!(!(EX(!(!((E(!((TrainState_1_4_26==1)) U (...292
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 608/0/2
(forward)formula 0,0,1.12536,20660,1,0,9,99250,40,2,6902,13274,14
FORMULA BART-PT-005-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 673/673 transitions.
Graph (trivial) has 671 edges and 323 vertex of which 312 / 323 are part of one of the 5 SCC in 6 ms
Free SCC test removed 307 places
Ensure Unique test removed 648 transitions
Reduce isomorphic transitions removed 648 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 12 transition count 20
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 10 transition count 17
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 14 place count 9 transition count 15
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 17 place count 8 transition count 13
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 4 with 3 rules applied. Total rules applied 20 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 5 with 3 rules applied. Total rules applied 23 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 6 with 3 rules applied. Total rules applied 26 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 7 with 3 rules applied. Total rules applied 29 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 30 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 9 with 1 rules applied. Total rules applied 31 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 31 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 9 with 2 rules applied. Total rules applied 33 place count 2 transition count 3
Applied a total of 33 rules in 38 ms. Remains 2 /323 variables (removed 321) and now considering 3/673 (removed 670) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5511870879852896437.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12655450935530834718.kers'
[2026-05-23 15:15:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5511870879852896437.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12655450935530834718.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-23 15:15:38] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12655450935530834718.kers
Total runtime 0 ms.
[2026-05-23 15:15:38] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-23 15:15:38] [INFO ] Invariant cache hit.
[2026-05-23 15:15:38] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2026-05-23 15:15:38] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-23 15:15:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 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
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 35 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 75ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 76ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/323 places, 3/673 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 181 ms. Remains : 2/323 places, 3/673 transitions.
[2026-05-23 15:15:38] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:15:38] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:15:38] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-23 15:15:38] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:15:38] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:15:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality3044621927555465219.gal : 1 ms
[2026-05-23 15:15:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality3718634532482376579.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3044621927555465219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3718634532482376579.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.001938,3728,2,4,5,12,5,0,12,6,0


Converting to forward existential form...Done !
original formula: AF(AG(EF((TrainState_2_3_7==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U (TrainState_2_3_7==1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.002833,4004,1,0,6,19,18,0,44,10,7
FORMULA BART-PT-005-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 15:15:38] [INFO ] Flatten gal took : 14 ms
[2026-05-23 15:15:38] [INFO ] Flatten gal took : 14 ms
Total runtime 325450 ms.

BK_STOP 1779549338347

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-005"
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-5973"
echo " Executing tool itstools"
echo " Input is BART-PT-005, 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 r018-smll-177946788000233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-005.tgz
mv BART-PT-005 execution
cd execution
if [ "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 ;