Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765100415.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 BridgeAndVehicles-PT-V50P50N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765100415
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 19K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 237K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 929K 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 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 107K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 315K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 253K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 965K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749013686035

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-04 05:08:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 05:08:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 05:08:09] [INFO ] Load time of PNML (sax parser for PT used): 395 ms
[2025-06-04 05:08:09] [INFO ] Transformed 128 places.
[2025-06-04 05:08:09] [INFO ] Transformed 1328 transitions.
[2025-06-04 05:08:09] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 669 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 111 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (88 resets) in 5178 ms. (7 steps per ms) remains 11/16 properties
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 05:08:12] [INFO ] Flatten gal took : 373 ms
[2025-06-04 05:08:12] [INFO ] Flatten gal took : 237 ms
[2025-06-04 05:08:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1897794261172267332.gal : 148 ms
[2025-06-04 05:08:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11985437362927239076.prop : 99 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1897794261172267332.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11985437362927239076.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11985437362927239076.prop.
BEST_FIRST walk for 40002 steps (40 resets) in 11106 ms. (3 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :6 after 19
BEST_FIRST walk for 40002 steps (40 resets) in 1723 ms. (23 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 42
BEST_FIRST walk for 40002 steps (32 resets) in 1665 ms. (24 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :42 after 132
BEST_FIRST walk for 40002 steps (36 resets) in 7622 ms. (5 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (36 resets) in 1041 ms. (38 steps per ms) remains 10/11 properties
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (36 resets) in 1189 ms. (33 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (36 resets) in 1372 ms. (29 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 897 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (32 resets) in 940 ms. (42 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (36 resets) in 986 ms. (40 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 959 ms. (41 steps per ms) remains 10/10 properties
[2025-06-04 05:08:20] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2025-06-04 05:08:20] [INFO ] Computed 7 invariants in 28 ms
[2025-06-04 05:08:20] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-02 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-05 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2/128 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 250/378 variables, 128/135 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 22/157 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/157 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/157 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 157 constraints, problems are : Problem set: 4 solved, 6 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 36/128 variables, 5/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 250/378 variables, 128/135 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 22/157 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/157 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/157 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 157 constraints, problems are : Problem set: 4 solved, 6 unsolved in 1788 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3318ms problems are : Problem set: 4 solved, 6 unsolved
Parikh walk visited 0 properties in 4035 ms.
Support contains 92 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 209 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2025-06-04 05:08:28] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2025-06-04 05:08:28] [INFO ] Computed 5 invariants in 6 ms
[2025-06-04 05:08:28] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :132 after 2025
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :2025 after 2027
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :2027 after 2030
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:41] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:48] [INFO ] Deduced a trap composed of 14 places in 301 ms of which 3 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 7 constraints, problems are : Problem set: 50 solved, 1275 unsolved in 20094 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 50 solved, 1275 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 1275 unsolved
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :2030 after 2053
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 250/376 variables, 126/133 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 22/155 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 1277 constraints, problems are : Problem set: 102 solved, 1223 unsolved in 21559 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1273/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46434ms problems are : Problem set: 102 solved, 1223 unsolved
Search for dead transitions found 102 dead transitions in 46453ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/128 places, 1226/1328 transitions.
Applied a total of 0 rules in 75 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46768 ms. Remains : 126/128 places, 1226/1328 transitions.
RANDOM walk for 40000 steps (88 resets) in 688 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 681 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (36 resets) in 439 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (36 resets) in 536 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 339 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (36 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (36 resets) in 591 ms. (67 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 213276 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 6
Probabilistic random walk after 213276 steps, saw 58845 distinct states, run finished after 3008 ms. (steps per millisecond=70 ) properties seen :0
[2025-06-04 05:09:18] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2025-06-04 05:09:18] [INFO ] Computed 7 invariants in 4 ms
[2025-06-04 05:09:18] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 33/125 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 246/371 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 33/125 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 246/371 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2782ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2629 ms.
Support contains 92 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 75 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 126/126 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 103 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2025-06-04 05:09:24] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 05:09:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:09:24] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-04 05:09:24] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 05:09:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:09:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 05:09:24] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 05:09:25] [INFO ] Redundant transitions in 96 ms returned []
Running 1223 sub problems to find dead transitions.
[2025-06-04 05:09:25] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-04 05:09:25] [INFO ] Invariant cache hit.
[2025-06-04 05:09:25] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:09:37] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 4 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :2053 after 4558
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (OVERLAPS) 246/372 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1276 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 31340 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64383ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 64387ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65116 ms. Remains : 126/126 places, 1226/1226 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 126 transition count 246
Applied a total of 980 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 246/1226 (removed 980) transitions.
Running SMT prover for 6 properties.
[2025-06-04 05:10:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 05:10:29] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-04 05:10:29] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-04 05:10:29] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 05:10:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-06-04 05:10:29] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-04 05:10:30] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-04 05:10:30] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-04 05:10:30] [INFO ] After 973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2025-06-04 05:10:30] [INFO ] Flatten gal took : 42 ms
[2025-06-04 05:10:30] [INFO ] Flatten gal took : 38 ms
[2025-06-04 05:10:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16314058930869734772.gal : 8 ms
[2025-06-04 05:10:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9122939382680927376.prop : 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16314058930869734772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9122939382680927376.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9122939382680927376.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :18 after 28
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :28 after 80
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :80 after 350
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :350 after 2251
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2251 after 15890
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :15890 after 167060
Reachability property BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-03 is true.
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :167060 after 1.16316e+06
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.16316e+06 after 1.18576e+06
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1.18576e+06 after 1.25026e+06
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :1.25026e+06 after 1.41937e+06
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.41937e+06 after 1.67477e+06
Detected timeout of ITS tools.
[2025-06-04 05:10:45] [INFO ] Flatten gal took : 21 ms
[2025-06-04 05:10:45] [INFO ] Applying decomposition
[2025-06-04 05:10:45] [INFO ] Flatten gal took : 42 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/graph12194269629853560889.txt' '-o' '/tmp/graph12194269629853560889.bin' '-w' '/tmp/graph12194269629853560889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12194269629853560889.bin' '-l' '-1' '-v' '-w' '/tmp/graph12194269629853560889.weights' '-q' '0' '-e' '0.001'
[2025-06-04 05:10:46] [INFO ] Decomposing Gal with order
[2025-06-04 05:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 05:10:46] [INFO ] Removed a total of 244 redundant transitions.
[2025-06-04 05:10:46] [INFO ] Flatten gal took : 388 ms
[2025-06-04 05:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 147 labels/synchronizations in 39 ms.
[2025-06-04 05:10:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1590854403528289757.gal : 21 ms
[2025-06-04 05:10:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8502388160210263519.prop : 16 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1590854403528289757.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8502388160210263519.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8502388160210263519.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 36
Invariant property BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-10 does not hold.
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :36 after 7271
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :4558 after 6536
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :7271 after 30747
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :30747 after 94897
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32453 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 05:11:02] [INFO ] Flatten gal took : 78 ms
[2025-06-04 05:11:02] [INFO ] Applying decomposition
[2025-06-04 05:11:02] [INFO ] Flatten gal took : 70 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/graph1077520176953126465.txt' '-o' '/tmp/graph1077520176953126465.bin' '-w' '/tmp/graph1077520176953126465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1077520176953126465.bin' '-l' '-1' '-v' '-w' '/tmp/graph1077520176953126465.weights' '-q' '0' '-e' '0.001'
[2025-06-04 05:11:02] [INFO ] Decomposing Gal with order
[2025-06-04 05:11:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 05:11:02] [INFO ] Removed a total of 2769 redundant transitions.
[2025-06-04 05:11:03] [INFO ] Flatten gal took : 497 ms
[2025-06-04 05:11:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 419 labels/synchronizations in 34 ms.
[2025-06-04 05:11:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality641469619689618357.gal : 4 ms
[2025-06-04 05:11:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9093805278346072976.prop : 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality641469619689618357.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9093805278346072976.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality9093805278346072976.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :255 after 262
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :262 after 267
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :267 after 270
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :270 after 284
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :284 after 326
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :326 after 4304
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :8460 after 10960
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :34111 after 47300
Reachability property BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-14 is true.
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-13 is true.
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :180267 after 185068
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :332411 after 339620
Reachability property BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-12 is true.
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :565193 after 917869
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.43452e+06 after 1.43674e+06
Invariant property BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-09 does not hold.
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.16542e+06 after 2.16775e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.166e+06 after 3.16809e+06
Detected timeout of ITS tools.
[2025-06-04 05:41:03] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13343071785892216344
[2025-06-04 05:41:03] [INFO ] Applying decomposition
[2025-06-04 05:41:03] [INFO ] Computing symmetric may disable matrix : 1226 transitions.
[2025-06-04 05:41:03] [INFO ] Flatten gal took : 63 ms
[2025-06-04 05:41:03] [INFO ] Computation of Complete disable matrix. took 98 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 05:41:03] [INFO ] Computing symmetric may enable matrix : 1226 transitions.
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/graph178852095359056102.txt' '-o' '/tmp/graph178852095359056102.bin' '-w' '/tmp/graph178852095359056102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph178852095359056102.bin' '-l' '-1' '-v' '-w' '/tmp/graph178852095359056102.weights' '-q' '0' '-e' '0.001'
[2025-06-04 05:41:03] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 05:41:03] [INFO ] Decomposing Gal with order
[2025-06-04 05:41:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 05:41:04] [INFO ] Removed a total of 2809 redundant transitions.
[2025-06-04 05:41:04] [INFO ] Flatten gal took : 223 ms
[2025-06-04 05:41:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 278 labels/synchronizations in 21 ms.
[2025-06-04 05:41:04] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18436177515721096225.gal : 3 ms
[2025-06-04 05:41:04] [INFO ] Computing Do-Not-Accords matrix : 1226 transitions.
[2025-06-04 05:41:04] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4055911403427689015.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability18436177515721096225.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4055911403427689015.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability4055911403427689015.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :17 after 21
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :21 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 35
[2025-06-04 05:41:04] [INFO ] Computation of Completed DNA matrix. took 126 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :35 after 44
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :44 after 89
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :89 after 214
[2025-06-04 05:41:04] [INFO ] Built C files in 881ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13343071785892216344
Running compilation step : cd /tmp/ltsmin13343071785892216344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :658 after 870
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2907 after 2913
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8777 after 8864
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :43322 after 44087
Compilation finished in 9821 ms.
Running link step : cd /tmp/ltsmin13343071785892216344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 118 ms.
Running LTSmin : cd /tmp/ltsmin13343071785892216344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesPTV50P50N10ReachabilityFireability202503==true'
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :82270 after 92228
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.13252e+06 after 2.1436e+06
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin13343071785892216344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesPTV50P50N10ReachabilityFireability202503==true'
Running LTSmin : cd /tmp/ltsmin13343071785892216344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesPTV50P50N10ReachabilityFireability202510==true'
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7.23079e+06 after 7.30103e+06
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin13343071785892216344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesPTV50P50N10ReachabilityFireability202510==true'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin13343071785892216344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesPTV50P50N10ReachabilityFireability202503==true'
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.23642e+07 after 2.24012e+07

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="BridgeAndVehicles-PT-V50P50N10"
export BK_EXAMINATION="ReachabilityFireability"
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 BridgeAndVehicles-PT-V50P50N10, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-smll-174853765100415"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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