About the Execution of ITS-Tools for Sudoku-PT-AN16
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532900693.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-PT-AN16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532900693
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 119M
-rw-r--r-- 1 mcc users 1.6M Apr 12 12:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.8M Apr 12 12:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9M Apr 12 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 698K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7M Apr 12 14:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22M Apr 12 14:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7M Apr 12 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40M Apr 12 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 144K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 345K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.3M 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-PT-AN16-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717066596724
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-30 10:56:37] [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 10:56:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 10:56:38] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2024-05-30 10:56:38] [INFO ] Transformed 4864 places.
[2024-05-30 10:56:38] [INFO ] Transformed 4096 transitions.
[2024-05-30 10:56:38] [INFO ] Found NUPN structural information;
[2024-05-30 10:56:38] [INFO ] Parsed PT model containing 4864 places and 4096 transitions and 16384 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 31 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[256, 0, 256, 1, 1, 1, 0, 1, 0, 1, 1] Max Struct:[256, 4096, 256, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Sudoku-PT-AN16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-05 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-06 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-02 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-04 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-07 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-00 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[4096, 1, 1]
// Phase 1: matrix 4096 rows 4864 cols
[2024-05-30 10:56:38] [INFO ] Computed 768 invariants in 80 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[4096, 1, 1]
RANDOM walk for 10000 steps (44 resets) in 3528 ms. (2 steps per ms)
FORMULA Sudoku-PT-AN16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Sudoku-PT-AN16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 986 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[232] Max Struct:[4096]
[2024-05-30 10:56:43] [INFO ] Invariant cache hit.
[2024-05-30 10:56:45] [INFO ] [Real]Absence check using 768 positive place invariants in 1996 ms returned sat
[2024-05-30 10:56:48] [INFO ] [Real]Absence check using state equation in 2145 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[232] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[232] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 231 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 10:56:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[232] Max Struct:[4096]
RANDOM walk for 87022 steps (384 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 49765 steps (0 resets) in 5019 ms. (9 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[232] Max Struct:[4096]
[2024-05-30 10:57:23] [INFO ] Invariant cache hit.
[2024-05-30 10:57:26] [INFO ] [Real]Absence check using 768 positive place invariants in 2349 ms returned sat
[2024-05-30 10:57:38] [INFO ] [Real]Absence check using state equation in 12270 ms returned sat
[2024-05-30 10:57:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 190 ms.
[2024-05-30 10:57:39] [INFO ] Added : 0 causal constraints over 0 iterations in 559 ms. Result :sat
Minimization took 4673 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[232] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[232] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 179 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 138 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 10:57:44] [INFO ] Invariant cache hit.
[2024-05-30 10:57:57] [INFO ] Implicit Places using invariants in 12348 ms returned []
[2024-05-30 10:57:57] [INFO ] Invariant cache hit.
[2024-05-30 10:58:14] [INFO ] Implicit Places using invariants and state equation in 17464 ms returned []
Implicit Place search using SMT with State Equation took 29817 ms to find 0 implicit places.
[2024-05-30 10:58:15] [INFO ] Redundant transitions in 239 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30214 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 10:58:16] [INFO ] Flatten gal took : 722 ms
[2024-05-30 10:58:16] [INFO ] Flatten gal took : 392 ms
[2024-05-30 10:58:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12895007499290672024.gal : 123 ms
[2024-05-30 10:58:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3467740643469255412.prop : 9 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/ReachabilityCardinality12895007499290672024.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3467740643469255412.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 ...329
Loading property file /tmp/ReachabilityCardinality3467740643469255412.prop.
RANDOM walk for 40000 steps (176 resets) in 24533 ms. (1 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5523 ms. (7 steps per ms) remains 1/1 properties
[2024-05-30 10:58:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2438 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2208 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5374ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 273 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 17700 ms. (2 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4971 ms. (8 steps per ms) remains 1/1 properties
Probabilistic random walk after 144970 steps, saw 144928 distinct states, run finished after 15064 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-30 10:58:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 1 solved, 0 unsolved in 2949 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3398ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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:[232] Max Struct:[4096]
Starting property specific reduction for Sudoku-PT-AN16-UpperBounds-01
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[4096]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4096]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4096]
[2024-05-30 10:58:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4096]
RANDOM walk for 10000 steps (44 resets) in 3445 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 1003 ms. (9 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[230] Max Struct:[4096]
[2024-05-30 10:58:57] [INFO ] Invariant cache hit.
[2024-05-30 10:58:59] [INFO ] [Real]Absence check using 768 positive place invariants in 1385 ms returned sat
[2024-05-30 10:59:02] [INFO ] [Real]Absence check using state equation in 2899 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[230] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[230] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 77 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 10:59:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[230] Max Struct:[4096]
RANDOM walk for 87409 steps (386 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 52814 steps (0 resets) in 5039 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[236] Max Struct:[4096]
[2024-05-30 10:59:38] [INFO ] Invariant cache hit.
[2024-05-30 10:59:41] [INFO ] [Real]Absence check using 768 positive place invariants in 2614 ms returned sat
[2024-05-30 10:59:56] [INFO ] [Real]Absence check using state equation in 15452 ms returned sat
[2024-05-30 10:59:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 162 ms.
[2024-05-30 10:59:57] [INFO ] Added : 0 causal constraints over 0 iterations in 480 ms. Result :sat
Minimization took 5666 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[236] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[236] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 79 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 69 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 11:00:03] [INFO ] Invariant cache hit.
[2024-05-30 11:00:14] [INFO ] Implicit Places using invariants in 11266 ms returned []
[2024-05-30 11:00:14] [INFO ] Invariant cache hit.
[2024-05-30 11:00:32] [INFO ] Implicit Places using invariants and state equation in 17293 ms returned []
Implicit Place search using SMT with State Equation took 28561 ms to find 0 implicit places.
[2024-05-30 11:00:32] [INFO ] Redundant transitions in 283 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 28924 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 11:00:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[236] Max Struct:[4096]
RANDOM walk for 87451 steps (386 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 52774 steps (0 resets) in 5103 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[236] Max Struct:[4096]
[2024-05-30 11:01:07] [INFO ] Invariant cache hit.
[2024-05-30 11:01:10] [INFO ] [Real]Absence check using 768 positive place invariants in 2445 ms returned sat
[2024-05-30 11:01:25] [INFO ] [Real]Absence check using state equation in 15149 ms returned sat
[2024-05-30 11:01:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 147 ms.
[2024-05-30 11:01:26] [INFO ] Added : 0 causal constraints over 0 iterations in 454 ms. Result :sat
Minimization took 5584 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[236] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[236] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 82 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 73 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 11:01:32] [INFO ] Invariant cache hit.
[2024-05-30 11:01:43] [INFO ] Implicit Places using invariants in 11023 ms returned []
[2024-05-30 11:01:43] [INFO ] Invariant cache hit.
[2024-05-30 11:02:00] [INFO ] Implicit Places using invariants and state equation in 17102 ms returned []
Implicit Place search using SMT with State Equation took 28132 ms to find 0 implicit places.
[2024-05-30 11:02:00] [INFO ] Redundant transitions in 150 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 28365 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 11:02:01] [INFO ] Flatten gal took : 242 ms
[2024-05-30 11:02:01] [INFO ] Flatten gal took : 434 ms
[2024-05-30 11:02:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17955369605074266933.gal : 79 ms
[2024-05-30 11:02:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6837005373481396612.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/ReachabilityCardinality17955369605074266933.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6837005373481396612.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 ...329
Loading property file /tmp/ReachabilityCardinality6837005373481396612.prop.
RANDOM walk for 40000 steps (176 resets) in 23759 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5239 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5305 ms. (7 steps per ms) remains 2/2 properties
Probabilistic random walk after 193864 steps, saw 193808 distinct states, run finished after 24027 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-30 11:02:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3540 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 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/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3368 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8018ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 81 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 22660 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4903 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4999 ms. (8 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2024-05-30 11:02:51] [INFO ] Flatten gal took : 176 ms
[2024-05-30 11:02:51] [INFO ] Applying decomposition
[2024-05-30 11:02:52] [INFO ] Flatten gal took : 182 ms
Interrupted probabilistic random walk after 161906 steps, run timeout after 24021 ms. (steps per millisecond=6 ) properties seen :0 out of 2
Probabilistic random walk after 161906 steps, saw 161858 distinct states, run finished after 24027 ms. (steps per millisecond=6 ) properties seen :0
[2024-05-30 11:03:14] [INFO ] Invariant cache hit.
[2024-05-30 11:03: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/graph8879995069276815342.txt' '-o' '/tmp/graph8879995069276815342.bin' '-w' '/tmp/graph8879995069276815342.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 11:03:15] [INFO ] Flatten gal took : 189 ms
[2024-05-30 11:03:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4237733317983781061.gal : 38 ms
[2024-05-30 11:03:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7246834604016772534.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/ReachabilityCardinality4237733317983781061.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7246834604016772534.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/ReachabilityCardinality7246834604016772534.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 1 solved, 1 unsolved in 8408 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5762 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 14780ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 76 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 17985 ms. (2 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5147 ms. (7 steps per ms) remains 1/1 properties
Probabilistic random walk after 172283 steps, saw 172233 distinct states, run finished after 18045 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-30 11:03:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 768/4864 variables, 768/4864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4864 variables, 768/5632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4864 variables, 0/5632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4096/8960 variables, 4864/10496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8960 variables, 0/10496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/8960 variables, 0/10496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8960/8960 variables, and 10496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4677 ms.
Refiners :[Domain max(s): 4864/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 4864/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8715 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 13775ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 62 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 59 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 11:04:07] [INFO ] Invariant cache hit.
[2024-05-30 11:04:18] [INFO ] Implicit Places using invariants in 11125 ms returned []
[2024-05-30 11:04:18] [INFO ] Invariant cache hit.
[2024-05-30 11:04:35] [INFO ] Implicit Places using invariants and state equation in 16982 ms returned []
Implicit Place search using SMT with State Equation took 28110 ms to find 0 implicit places.
[2024-05-30 11:04:35] [INFO ] Redundant transitions in 149 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 28340 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[236] Max Struct:[4096]
Ending property specific reduction for Sudoku-PT-AN16-UpperBounds-01 in 342472 ms.
[2024-05-30 11:04:36] [INFO ] Flatten gal took : 163 ms
[2024-05-30 11:04:36] [INFO ] Applying decomposition
[2024-05-30 11:04:36] [INFO ] Flatten gal took : 176 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/graph825797374931775795.txt' '-o' '/tmp/graph825797374931775795.bin' '-w' '/tmp/graph825797374931775795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph825797374931775795.bin' '-l' '-1' '-v' '-w' '/tmp/graph825797374931775795.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:04:36] [INFO ] Decomposing Gal with order
[2024-05-30 11:04:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:04:37] [INFO ] Removed a total of 7424 redundant transitions.
[2024-05-30 11:04:37] [INFO ] Flatten gal took : 441 ms
[2024-05-30 11:04:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 57 ms.
[2024-05-30 11:04:38] [INFO ] Time to serialize gal into /tmp/UpperBounds14488394945682261477.gal : 51 ms
[2024-05-30 11:04:38] [INFO ] Time to serialize properties into /tmp/UpperBounds4122126300206903146.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14488394945682261477.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4122126300206903146.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/UpperBounds4122126300206903146.prop.
ITS-tools command line returned an error code 137
[2024-05-30 11:11:55] [INFO ] Applying decomposition
[2024-05-30 11:11:55] [INFO ] Flatten gal took : 261 ms
[2024-05-30 11:11:55] [INFO ] Decomposing Gal with order
[2024-05-30 11:11:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:11:56] [INFO ] Removed a total of 7631 redundant transitions.
[2024-05-30 11:11:56] [INFO ] Flatten gal took : 316 ms
[2024-05-30 11:11:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2024-05-30 11:11:57] [INFO ] Time to serialize gal into /tmp/UpperBounds12910658038882612975.gal : 28 ms
[2024-05-30 11:11:57] [INFO ] Time to serialize properties into /tmp/UpperBounds11022241188758234913.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/UpperBounds12910658038882612975.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11022241188758234913.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 ...306
Loading property file /tmp/UpperBounds11022241188758234913.prop.
ITS-tools command line returned an error code 137
[2024-05-30 11:20:29] [INFO ] Flatten gal took : 177 ms
[2024-05-30 11:20:29] [INFO ] Input system was already deterministic with 4096 transitions.
[2024-05-30 11:20:29] [INFO ] Transformed 4864 places.
[2024-05-30 11:20:29] [INFO ] Transformed 4096 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 11:20:33] [INFO ] Time to serialize gal into /tmp/UpperBounds14973856421368797274.gal : 30 ms
[2024-05-30 11:20:33] [INFO ] Time to serialize properties into /tmp/UpperBounds9985022334538655237.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/UpperBounds14973856421368797274.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9985022334538655237.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9985022334538655237.prop.
ITS-tools command line returned an error code 137
Total runtime 1903095 ms.
BK_STOP 1717068501029
--------------------
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-PT-AN16"
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-PT-AN16, 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-171690532900693"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN16.tgz
mv Sudoku-PT-AN16 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 '
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 ;