fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r258-tall-165303545300149
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Sudoku-COL-AN14

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
581.896 133054.00 146430.00 1477.00 196 196 196 196 196 196 196 196 196 196 196 196 196 196 196 196 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 7.6K Apr 30 12:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 12:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 11:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 11:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 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-AN14-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653081178002

Running Version 202205111006
[2022-05-20 21:12:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 21:12:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:12:59] [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.
[2022-05-20 21:12:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 21:12:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 523 ms
[2022-05-20 21:12:59] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 3332 PT places and 2744.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2022-05-20 21:12:59] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2022-05-20 21:12:59] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 21:12:59] [INFO ] Computed 3 place invariants in 5 ms
FORMULA Sudoku-COL-AN14-UpperBounds-14 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-13 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-12 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-11 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-09 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-08 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-06 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-05 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-03 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-02 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-01 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-00 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 21:12:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 21:12:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-20 21:12:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:12:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-20 21:12:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:12:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-20 21:12:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:12:59] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-20 21:12:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 21:12:59] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2022-05-20 21:13:00] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2022-05-20 21:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-20 21:13:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:13:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-20 21:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-20 21:13:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 21:13:00] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 9 ms.
[2022-05-20 21:13:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-20 21:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:00] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 21:13:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:13:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-20 21:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-20 21:13:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 21:13:00] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
[2022-05-20 21:13:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-20 21:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:00] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 21:13:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:13:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-20 21:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-20 21:13:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 21:13:00] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [196, 196, 196, 196]
Domain [N(14), N(14)] of place Rows breaks symmetries in sort N
[2022-05-20 21:13:00] [INFO ] Unfolded HLPN to a Petri net with 3332 places and 2744 transitions 10976 arcs in 50 ms.
[2022-05-20 21:13:00] [INFO ] Unfolded 4 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 3947 ms. (steps per millisecond=2 ) properties (out of 4) seen :708
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 4) seen :8
// Phase 1: matrix 2744 rows 3332 cols
[2022-05-20 21:13:06] [INFO ] Computed 588 place invariants in 39 ms
[2022-05-20 21:13:08] [INFO ] [Real]Absence check using 588 positive place invariants in 1793 ms returned sat
[2022-05-20 21:13:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:10] [INFO ] [Real]Absence check using state equation in 2005 ms returned sat
[2022-05-20 21:13:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:13:11] [INFO ] [Nat]Absence check using 588 positive place invariants in 566 ms returned sat
[2022-05-20 21:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:13] [INFO ] [Nat]Absence check using state equation in 1571 ms returned sat
[2022-05-20 21:13:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 96 ms.
[2022-05-20 21:13:13] [INFO ] Added : 0 causal constraints over 0 iterations in 334 ms. Result :sat
Minimization took 2005 ms.
[2022-05-20 21:13:18] [INFO ] [Real]Absence check using 588 positive place invariants in 1790 ms returned sat
[2022-05-20 21:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:20] [INFO ] [Real]Absence check using state equation in 2189 ms returned sat
[2022-05-20 21:13:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:13:21] [INFO ] [Nat]Absence check using 588 positive place invariants in 539 ms returned sat
[2022-05-20 21:13:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:22] [INFO ] [Nat]Absence check using state equation in 1518 ms returned sat
[2022-05-20 21:13:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 115 ms.
[2022-05-20 21:13:23] [INFO ] Added : 0 causal constraints over 0 iterations in 355 ms. Result :sat
Minimization took 2160 ms.
[2022-05-20 21:13:27] [INFO ] [Real]Absence check using 588 positive place invariants in 1849 ms returned sat
[2022-05-20 21:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:29] [INFO ] [Real]Absence check using state equation in 2089 ms returned sat
[2022-05-20 21:13:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:13:30] [INFO ] [Nat]Absence check using 588 positive place invariants in 511 ms returned sat
[2022-05-20 21:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:32] [INFO ] [Nat]Absence check using state equation in 1498 ms returned sat
[2022-05-20 21:13:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 102 ms.
[2022-05-20 21:13:32] [INFO ] Added : 0 causal constraints over 0 iterations in 334 ms. Result :sat
Minimization took 2251 ms.
[2022-05-20 21:13:36] [INFO ] [Real]Absence check using 588 positive place invariants in 1833 ms returned sat
[2022-05-20 21:13:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:39] [INFO ] [Real]Absence check using state equation in 2127 ms returned sat
[2022-05-20 21:13:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:13:40] [INFO ] [Nat]Absence check using 588 positive place invariants in 546 ms returned sat
[2022-05-20 21:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:13:41] [INFO ] [Nat]Absence check using state equation in 1608 ms returned sat
[2022-05-20 21:13:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 108 ms.
[2022-05-20 21:13:42] [INFO ] Added : 0 causal constraints over 0 iterations in 323 ms. Result :sat
Minimization took 2094 ms.
Current structural bounds on expressions (after SMT) : [196, 196, 196, 196] Max seen :[177, 177, 177, 177]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 176 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3332/3332 places, 2744/2744 transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2022-05-20 21:13:44] [INFO ] Computed 588 place invariants in 14 ms
Finished random walk after 79075 steps, including 458 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 87137 steps, including 0 resets, run visited all 4 properties in 5003 ms. (steps per millisecond=17 )
Finished Best-First random walk after 75736 steps, including 0 resets, run visited all 4 properties in 5057 ms. (steps per millisecond=14 )
Finished Best-First random walk after 92338 steps, including 0 resets, run visited all 4 properties in 5024 ms. (steps per millisecond=18 )
Finished Best-First random walk after 89843 steps, including 0 resets, run visited all 4 properties in 5009 ms. (steps per millisecond=17 )
// Phase 1: matrix 2744 rows 3332 cols
[2022-05-20 21:14:34] [INFO ] Computed 588 place invariants in 18 ms
[2022-05-20 21:14:35] [INFO ] [Real]Absence check using 588 positive place invariants in 563 ms returned sat
[2022-05-20 21:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:14:36] [INFO ] [Real]Absence check using state equation in 1598 ms returned sat
[2022-05-20 21:14:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:14:38] [INFO ] [Nat]Absence check using 588 positive place invariants in 750 ms returned sat
[2022-05-20 21:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:14:39] [INFO ] [Nat]Absence check using state equation in 1668 ms returned sat
[2022-05-20 21:14:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 103 ms.
[2022-05-20 21:14:40] [INFO ] Added : 0 causal constraints over 0 iterations in 343 ms. Result :sat
Minimization took 1979 ms.
[2022-05-20 21:14:43] [INFO ] [Real]Absence check using 588 positive place invariants in 537 ms returned sat
[2022-05-20 21:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:14:44] [INFO ] [Real]Absence check using state equation in 1538 ms returned sat
[2022-05-20 21:14:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:14:45] [INFO ] [Nat]Absence check using 588 positive place invariants in 710 ms returned sat
[2022-05-20 21:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:14:47] [INFO ] [Nat]Absence check using state equation in 1674 ms returned sat
[2022-05-20 21:14:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 79 ms.
[2022-05-20 21:14:48] [INFO ] Added : 0 causal constraints over 0 iterations in 321 ms. Result :sat
Minimization took 2129 ms.
[2022-05-20 21:14:51] [INFO ] [Real]Absence check using 588 positive place invariants in 551 ms returned sat
[2022-05-20 21:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:14:52] [INFO ] [Real]Absence check using state equation in 1544 ms returned sat
[2022-05-20 21:14:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:14:53] [INFO ] [Nat]Absence check using 588 positive place invariants in 699 ms returned sat
[2022-05-20 21:14:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:14:55] [INFO ] [Nat]Absence check using state equation in 1675 ms returned sat
[2022-05-20 21:14:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 92 ms.
[2022-05-20 21:14:55] [INFO ] Added : 0 causal constraints over 0 iterations in 305 ms. Result :sat
Minimization took 2093 ms.
[2022-05-20 21:14:58] [INFO ] [Real]Absence check using 588 positive place invariants in 537 ms returned sat
[2022-05-20 21:14:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:15:00] [INFO ] [Real]Absence check using state equation in 1552 ms returned sat
[2022-05-20 21:15:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:15:01] [INFO ] [Nat]Absence check using 588 positive place invariants in 714 ms returned sat
[2022-05-20 21:15:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:15:03] [INFO ] [Nat]Absence check using state equation in 1595 ms returned sat
[2022-05-20 21:15:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 97 ms.
[2022-05-20 21:15:03] [INFO ] Added : 0 causal constraints over 0 iterations in 319 ms. Result :sat
Minimization took 2024 ms.
Current structural bounds on expressions (after SMT) : [196, 196, 196, 196] Max seen :[178, 178, 178, 178]
FORMULA Sudoku-COL-AN14-UpperBounds-15 196 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN14-UpperBounds-10 196 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN14-UpperBounds-07 196 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN14-UpperBounds-04 196 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 131902 ms.

BK_STOP 1653081311056

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-AN14"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN14, 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 r258-tall-165303545300149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN14.tgz
mv Sudoku-COL-AN14 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 ;