About the Execution of ITS-Tools for Philosophers-COL-005000
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253300077.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 Philosophers-COL-005000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253300077
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 227K 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 positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Philosophers-COL-005000-UpperBounds-00
FORMULA_NAME Philosophers-COL-005000-UpperBounds-01
FORMULA_NAME Philosophers-COL-005000-UpperBounds-02
FORMULA_NAME Philosophers-COL-005000-UpperBounds-03
FORMULA_NAME Philosophers-COL-005000-UpperBounds-04
FORMULA_NAME Philosophers-COL-005000-UpperBounds-05
FORMULA_NAME Philosophers-COL-005000-UpperBounds-06
FORMULA_NAME Philosophers-COL-005000-UpperBounds-07
FORMULA_NAME Philosophers-COL-005000-UpperBounds-08
FORMULA_NAME Philosophers-COL-005000-UpperBounds-09
FORMULA_NAME Philosophers-COL-005000-UpperBounds-10
FORMULA_NAME Philosophers-COL-005000-UpperBounds-11
FORMULA_NAME Philosophers-COL-005000-UpperBounds-12
FORMULA_NAME Philosophers-COL-005000-UpperBounds-13
FORMULA_NAME Philosophers-COL-005000-UpperBounds-14
FORMULA_NAME Philosophers-COL-005000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748853507369
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-005000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-02 08:38:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 08:38:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:38:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 08:38:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 08:38:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 604 ms
[2025-06-02 08:38:29] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25000 PT places and 25000.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 5
[2025-06-02 08:38:29] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2025-06-02 08:38:29] [INFO ] Skeletonized 5 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2025-06-02 08:38:29] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 5000, 0, 5000, 0] Max Struct:[5000, 5000, 2500, 5000, 5000]
FORMULA Philosophers-COL-005000-UpperBounds-09 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-11 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-14 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-15 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-07 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-02 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-04 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-06 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-01 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 08:38:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 08:38:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 08:38:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 08:38:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 08:38:29] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 08:38:29] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-02 08:38:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 08:38:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 08:38:29] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2025-06-02 08:38:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 08:38:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 08:38:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 08:38:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 08:38:29] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 08:38:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 08:38:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 08:38:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 08:38:29] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0] Max Struct:[5000, 2500, 5000]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 5000) 5000) 5000)]] contains successor/predecessor on variables of sort Philo
[2025-06-02 08:38:29] [INFO ] Unfolded HLPN to a Petri net with 25000 places and 25000 transitions 80000 arcs in 210 ms.
[2025-06-02 08:38:29] [INFO ] Unfolded 3 HLPN properties in 2 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0] Max Struct:[5000, 2500, 5000]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[5000, 2500, 5000]
// Phase 1: matrix 25000 rows 25000 cols
[2025-06-02 08:38:30] [INFO ] Computed 10000 invariants in 146 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[5000, 2500, 5000]
RANDOM walk for 10000 steps (2 resets) in 19621 ms. (0 steps per ms)
BEST_FIRST walk for 30003 steps (0 resets) in 9402 ms. (3 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1117, 449, 1115] Max Struct:[5000, 2500, 5000]
[2025-06-02 08:38:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1117, 449, 1115] Max Struct:[5000, 2500, 5000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1117, 449, 1115] Max Struct:[5000, 2500, 5000]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2440 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2451 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2025-06-02 08:39:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1117, 449, 1115] Max Struct:[5000, 2500, 5000]
RANDOM walk for 24648 steps (0 resets) in 30001 ms. (0 steps per ms)
BEST_FIRST walk for 51006 steps (0 resets) in 15329 ms. (3 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1939, 689, 1969] Max Struct:[5000, 2500, 5000]
[2025-06-02 08:39:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:40:14] [INFO ] [Real]Absence check using 10000 positive place invariants in 15370 ms returned sat
[2025-06-02 08:40:41] [INFO ] [Real]Absence check using state equation in 26599 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:40:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 6595 ms returned sat
[2025-06-02 08:41:26] [INFO ] [Real]Absence check using state equation in 35425 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:41:42] [INFO ] [Real]Absence check using 10000 positive place invariants in 12694 ms returned sat
[2025-06-02 08:42:11] [INFO ] [Real]Absence check using state equation in 29372 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1939, 689, 1969] Max Struct:[5000, 2500, 5000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1939, 689, 1969] Max Struct:[5000, 2500, 5000]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2223 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2223 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1531 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2025-06-02 08:42:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:42:42] [INFO ] Implicit Places using invariants in 26620 ms returned []
Implicit Place search using SMT only with invariants took 26626 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2025-06-02 08:42:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30267 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30193 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 95983ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 96081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124296 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2025-06-02 08:44:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1939, 689, 1969] Max Struct:[5000, 2500, 5000]
RANDOM walk for 22604 steps (0 resets) in 30002 ms. (0 steps per ms)
BEST_FIRST walk for 63003 steps (0 resets) in 15175 ms. (4 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1939, 739, 1969] Max Struct:[5000, 2500, 5000]
[2025-06-02 08:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:45:20] [INFO ] [Real]Absence check using 10000 positive place invariants in 13242 ms returned sat
[2025-06-02 08:45:48] [INFO ] [Real]Absence check using state equation in 28558 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:45:57] [INFO ] [Real]Absence check using 10000 positive place invariants in 6224 ms returned sat
[2025-06-02 08:46:33] [INFO ] [Real]Absence check using state equation in 35887 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:46:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 13691 ms returned sat
[2025-06-02 08:47:18] [INFO ] [Real]Absence check using state equation in 28419 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1939, 739, 1969] Max Struct:[5000, 2500, 5000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1939, 739, 1969] Max Struct:[5000, 2500, 5000]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1441 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1441 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1486 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2025-06-02 08:47:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:47:50] [INFO ] Implicit Places using invariants in 28399 ms returned []
Implicit Place search using SMT only with invariants took 28402 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2025-06-02 08:47:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30190 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30159 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98791ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 98835ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128756 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2025-06-02 08:49:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1939, 739, 1969] Max Struct:[5000, 2500, 5000]
RANDOM walk for 22426 steps (0 resets) in 30001 ms. (0 steps per ms)
BEST_FIRST walk for 63003 steps (0 resets) in 15205 ms. (4 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1939, 739, 1969] Max Struct:[5000, 2500, 5000]
[2025-06-02 08:50:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:50:31] [INFO ] [Real]Absence check using 10000 positive place invariants in 13939 ms returned sat
[2025-06-02 08:50:59] [INFO ] [Real]Absence check using state equation in 28133 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:51:09] [INFO ] [Real]Absence check using 10000 positive place invariants in 6700 ms returned sat
[2025-06-02 08:51:44] [INFO ] [Real]Absence check using state equation in 35323 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 08:52:00] [INFO ] [Real]Absence check using 10000 positive place invariants in 13377 ms returned sat
[2025-06-02 08:52:29] [INFO ] [Real]Absence check using state equation in 28660 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1939, 739, 1969] Max Struct:[5000, 2500, 5000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1939, 739, 1969] Max Struct:[5000, 2500, 5000]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1469 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1470 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1484 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2025-06-02 08:52:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:53:04] [INFO ] Implicit Places using invariants in 32215 ms returned []
Implicit Place search using SMT only with invariants took 32216 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2025-06-02 08:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30192 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30176 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 95314ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 95346ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129067 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2025-06-02 08:54:43] [INFO ] Flatten gal took : 2490 ms
[2025-06-02 08:54:44] [INFO ] Flatten gal took : 1003 ms
[2025-06-02 08:54:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8962020596487449530.gal : 225 ms
[2025-06-02 08:54:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15545349407463452578.prop : 20 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/ReachabilityCardinality8962020596487449530.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15545349407463452578.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/ReachabilityCardinality15545349407463452578.prop.
RANDOM walk for 34744 steps (8 resets) in 120006 ms. (0 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (0 resets) in 14828 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (0 resets) in 16858 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (0 resets) in 16518 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (0 resets) in 16682 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (0 resets) in 14969 ms. (2 steps per ms) remains 6/6 properties
Detected timeout of ITS tools.
BEST_FIRST walk for 40004 steps (0 resets) in 16750 ms. (2 steps per ms) remains 6/6 properties
[2025-06-02 08:55:35] [INFO ] Flatten gal took : 672 ms
[2025-06-02 08:55:35] [INFO ] Applying decomposition
[2025-06-02 08:55:36] [INFO ] Flatten gal took : 739 ms
[2025-06-02 08:58:42] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12463342202433358722.txt' '-o' '/tmp/graph12463342202433358722.bin' '-w' '/tmp/graph12463342202433358722.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:71)
at java.base/java.lang.Thread.run(Thread.java:1583)
Probabilistic random walk after 84976 steps, saw 84964 distinct states, run finished after 188262 ms. (steps per millisecond=0 ) properties seen :0
[2025-06-02 08:58:44] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
[2025-06-02 08:58:44] [INFO ] Flatten gal took : 1853 ms
[2025-06-02 08:58:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11237559443942843952.gal : 236 ms
[2025-06-02 08:58:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13743001052846811733.prop : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11237559443942843952.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13743001052846811733.prop' '--nowitness' '--gen-order' 'FOLLOW'
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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 ...330
BK_STOP 1748854732853
--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="Philosophers-COL-005000"
export BK_EXAMINATION="UpperBounds"
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 Philosophers-COL-005000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253300077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-005000.tgz
mv Philosophers-COL-005000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;