Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532500525.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Sudoku-COL-AN15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532500525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 6.6K Apr 12 11:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 11:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 11:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 11:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 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

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717039158164

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-30 03:19:19] [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]
[2024-05-30 03:19:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 03:19:19] [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.
[2024-05-30 03:19:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 03:19:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 486 ms
[2024-05-30 03:19:19] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4050 PT places and 3375.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2024-05-30 03:19:19] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-30 03:19:19] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 03:19:19] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[225, 0, 225, 225] Max Struct:[225, 225, 225, 225]
FORMULA Sudoku-COL-AN15-UpperBounds-15 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-04 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-08 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-09 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-13 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-14 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-02 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-07 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-00 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-30 03:19:19] [INFO ] Invariant cache hit.
[2024-05-30 03:19:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-30 03:19:20] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-30 03:19:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-30 03:19:20] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[225]
Domain [N(15), N(15)] of place Rows breaks symmetries in sort N
[2024-05-30 03:19:20] [INFO ] Unfolded HLPN to a Petri net with 4050 places and 3375 transitions 13500 arcs in 72 ms.
[2024-05-30 03:19:20] [INFO ] Unfolded 1 HLPN properties in 1 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[225]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[225]
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-30 03:19:20] [INFO ] Computed 675 invariants in 69 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[225]
RANDOM walk for 10000 steps (50 resets) in 2788 ms. (3 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 738 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[205] Max Struct:[225]
[2024-05-30 03:19:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : Max Seen:[205] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[205] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 194 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 03:19:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[205] Max Struct:[225]
RANDOM walk for 109670 steps (553 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 65958 steps (0 resets) in 5021 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[205] Max Struct:[225]
[2024-05-30 03:20:00] [INFO ] Invariant cache hit.
[2024-05-30 03:20:02] [INFO ] [Real]Absence check using 675 positive place invariants in 1514 ms returned sat
[2024-05-30 03:20:22] [INFO ] [Real]Absence check using state equation in 20240 ms returned sat
[2024-05-30 03:20:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 125 ms.
[2024-05-30 03:20:23] [INFO ] Added : 0 causal constraints over 0 iterations in 442 ms. Result :sat
Minimization took 6356 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[205] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[205] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 155 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 182 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:20:30] [INFO ] Invariant cache hit.
[2024-05-30 03:20:32] [INFO ] Implicit Places using invariants in 2205 ms returned []
[2024-05-30 03:20:32] [INFO ] Invariant cache hit.
[2024-05-30 03:20:38] [INFO ] Implicit Places using invariants and state equation in 6386 ms returned []
Implicit Place search using SMT with State Equation took 8596 ms to find 0 implicit places.
[2024-05-30 03:20:38] [INFO ] Redundant transitions in 269 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9063 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 03:20:39] [INFO ] Flatten gal took : 566 ms
[2024-05-30 03:20:40] [INFO ] Flatten gal took : 420 ms
[2024-05-30 03:20:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1411754144863408295.gal : 130 ms
[2024-05-30 03:20:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8754010076030219345.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1411754144863408295.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8754010076030219345.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8754010076030219345.prop.
RANDOM walk for 40000 steps (200 resets) in 19098 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4383 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3954 ms. (10 steps per ms) remains 2/2 properties
Probabilistic random walk after 211672 steps, saw 211594 distinct states, run finished after 21013 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-30 03:21:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2479 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2276 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5743ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 79 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 17684 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4105 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3749 ms. (10 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1045
Detected timeout of ITS tools.
[2024-05-30 03:21:30] [INFO ] Flatten gal took : 165 ms
[2024-05-30 03:21:30] [INFO ] Applying decomposition
[2024-05-30 03:21:30] [INFO ] Flatten gal took : 159 ms
Probabilistic random walk after 168300 steps, saw 168241 distinct states, run finished after 18054 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-30 03:21:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 03:21:50] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph11760025966840236176.txt' '-o' '/tmp/graph11760025966840236176.bin' '-w' '/tmp/graph11760025966840236176.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:840)
[2024-05-30 03:21:50] [INFO ] Flatten gal took : 143 ms
[2024-05-30 03:21:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17842969506987178564.gal : 25 ms
[2024-05-30 03:21:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11905364421530129002.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17842969506987178564.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11905364421530129002.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11905364421530129002.prop.
At refinement iteration 3 (OVERLAPS) 3375/7425 variables, 4050/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7425 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7425 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45041 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1045
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30628 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 76327ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 2268 ms.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 102 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[205] Max Struct:[225]
Starting property specific reduction for Sudoku-COL-AN15-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[225]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[225]
[2024-05-30 03:22:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[225]
RANDOM walk for 10000 steps (50 resets) in 2758 ms. (3 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 748 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[204] Max Struct:[225]
[2024-05-30 03:22:59] [INFO ] Invariant cache hit.
[2024-05-30 03:23:01] [INFO ] [Real]Absence check using 675 positive place invariants in 835 ms returned sat
[2024-05-30 03:23:03] [INFO ] [Real]Absence check using state equation in 2852 ms returned sat
[2024-05-30 03:23:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 123 ms.
[2024-05-30 03:23:04] [INFO ] Added : 0 causal constraints over 0 iterations in 372 ms. Result :sat
Minimization took 241 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[204] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[204] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 84 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 03:23:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[204] Max Struct:[225]
RANDOM walk for 108978 steps (549 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 68399 steps (0 resets) in 5038 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[207] Max Struct:[225]
[2024-05-30 03:23:40] [INFO ] Invariant cache hit.
[2024-05-30 03:23:42] [INFO ] [Real]Absence check using 675 positive place invariants in 1851 ms returned sat
[2024-05-30 03:24:21] [INFO ] [Real]Absence check using state equation in 38764 ms returned sat
[2024-05-30 03:24:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 129 ms.
[2024-05-30 03:24:21] [INFO ] Added : 0 causal constraints over 0 iterations in 397 ms. Result :sat
Minimization took 3269 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[207] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[207] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 89 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 84 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:24:25] [INFO ] Invariant cache hit.
[2024-05-30 03:24:27] [INFO ] Implicit Places using invariants in 2318 ms returned []
[2024-05-30 03:24:27] [INFO ] Invariant cache hit.
[2024-05-30 03:24:34] [INFO ] Implicit Places using invariants and state equation in 6872 ms returned []
Implicit Place search using SMT with State Equation took 9192 ms to find 0 implicit places.
[2024-05-30 03:24:34] [INFO ] Redundant transitions in 214 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9494 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 03:24:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[207] Max Struct:[225]
RANDOM walk for 108458 steps (547 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 66972 steps (0 resets) in 5016 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[207] Max Struct:[225]
[2024-05-30 03:25:09] [INFO ] Invariant cache hit.
[2024-05-30 03:25:11] [INFO ] [Real]Absence check using 675 positive place invariants in 1710 ms returned sat
[2024-05-30 03:25:48] [INFO ] [Real]Absence check using state equation in 36940 ms returned sat
[2024-05-30 03:25:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 133 ms.
[2024-05-30 03:25:49] [INFO ] Added : 0 causal constraints over 0 iterations in 396 ms. Result :sat
Minimization took 4842 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[207] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[207] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 86 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 78 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:25:54] [INFO ] Invariant cache hit.
[2024-05-30 03:25:56] [INFO ] Implicit Places using invariants in 2276 ms returned []
[2024-05-30 03:25:56] [INFO ] Invariant cache hit.
[2024-05-30 03:26:03] [INFO ] Implicit Places using invariants and state equation in 6757 ms returned []
Implicit Place search using SMT with State Equation took 9038 ms to find 0 implicit places.
[2024-05-30 03:26:03] [INFO ] Redundant transitions in 107 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9236 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 03:26:03] [INFO ] Flatten gal took : 133 ms
[2024-05-30 03:26:04] [INFO ] Flatten gal took : 203 ms
[2024-05-30 03:26:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5401887034597634995.gal : 42 ms
[2024-05-30 03:26:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5681460247696457342.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5401887034597634995.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5681460247696457342.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5681460247696457342.prop.
RANDOM walk for 40000 steps (200 resets) in 18052 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3763 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3765 ms. (10 steps per ms) remains 2/2 properties
Probabilistic random walk after 166575 steps, saw 166517 distinct states, run finished after 18057 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-30 03:26:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5033 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2214 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7823ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 42 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 18593 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3728 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3670 ms. (10 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1045
Detected timeout of ITS tools.
[2024-05-30 03:26:54] [INFO ] Flatten gal took : 122 ms
[2024-05-30 03:26:54] [INFO ] Applying decomposition
[2024-05-30 03:26:54] [INFO ] Flatten gal took : 118 ms
Probabilistic random walk after 179932 steps, saw 179868 distinct states, run finished after 21011 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-30 03:27:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 03:27:14] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph5973354363326472689.txt' '-o' '/tmp/graph5973354363326472689.bin' '-w' '/tmp/graph5973354363326472689.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:840)
[2024-05-30 03:27:14] [INFO ] Flatten gal took : 127 ms
[2024-05-30 03:27:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8574242969105459773.gal : 18 ms
[2024-05-30 03:27:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality212946328500260229.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8574242969105459773.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality212946328500260229.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality212946328500260229.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 2 unsolved in 23920 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 2 unsolved in 14409 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 38735ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 63 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 42 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:27:43] [INFO ] Invariant cache hit.
[2024-05-30 03:27:45] [INFO ] Implicit Places using invariants in 2194 ms returned []
[2024-05-30 03:27:45] [INFO ] Invariant cache hit.
[2024-05-30 03:27:52] [INFO ] Implicit Places using invariants and state equation in 6683 ms returned []
Implicit Place search using SMT with State Equation took 8883 ms to find 0 implicit places.
[2024-05-30 03:27:52] [INFO ] Redundant transitions in 102 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9033 ms. Remains : 4050/4050 places, 3375/3375 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[207] Max Struct:[225]
Ending property specific reduction for Sudoku-COL-AN15-UpperBounds-01 in 296230 ms.
[2024-05-30 03:27:52] [INFO ] Flatten gal took : 116 ms
[2024-05-30 03:27:52] [INFO ] Applying decomposition
[2024-05-30 03:27:52] [INFO ] Flatten gal took : 117 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4545176361698858477.txt' '-o' '/tmp/graph4545176361698858477.bin' '-w' '/tmp/graph4545176361698858477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4545176361698858477.bin' '-l' '-1' '-v' '-w' '/tmp/graph4545176361698858477.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:27:53] [INFO ] Decomposing Gal with order
[2024-05-30 03:27:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:27:54] [INFO ] Removed a total of 6075 redundant transitions.
[2024-05-30 03:27:54] [INFO ] Flatten gal took : 368 ms
[2024-05-30 03:27:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 44 ms.
[2024-05-30 03:27:54] [INFO ] Time to serialize gal into /tmp/UpperBounds4362516500907156423.gal : 43 ms
[2024-05-30 03:27:54] [INFO ] Time to serialize properties into /tmp/UpperBounds10762442662944820770.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4362516500907156423.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10762442662944820770.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds10762442662944820770.prop.

BK_STOP 1717039964185

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="Sudoku-COL-AN15"
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-5568"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN15, 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 r400-tall-171690532500525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN15.tgz
mv Sudoku-COL-AN15 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;