About the Execution of ITS-Tools for Sudoku-COL-AN14
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-171690532500517.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Sudoku-COL-AN14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532500517
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.3K Apr 12 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 10:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 10:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 12:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-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 1717038363147
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-30 03:06:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 03:06:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 03:06:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 03:06:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 03:06:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 540 ms
[2024-05-30 03:06:04] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 3332 PT places and 2744.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2024-05-30 03:06:04] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-30 03:06:04] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 03:06:04] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[196, 0, 196, 196] Max Struct:[196, 196, 196, 196]
FORMULA Sudoku-COL-AN14-UpperBounds-13 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-10 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-05 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-03 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-07 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-00 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-30 03:06:04] [INFO ] Invariant cache hit.
[2024-05-30 03:06:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-30 03:06:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-30 03:06:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-30 03:06:05] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[196]
Domain [N(14), N(14)] of place Rows breaks symmetries in sort N
[2024-05-30 03:06:05] [INFO ] Unfolded HLPN to a Petri net with 3332 places and 2744 transitions 10976 arcs in 63 ms.
[2024-05-30 03:06:05] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[196]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[196]
// Phase 1: matrix 2744 rows 3332 cols
[2024-05-30 03:06:05] [INFO ] Computed 588 invariants in 61 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[196]
RANDOM walk for 10000 steps (58 resets) in 2265 ms. (4 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 703 ms. (14 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[176] Max Struct:[196]
[2024-05-30 03:06:08] [INFO ] Invariant cache hit.
[2024-05-30 03:06:09] [INFO ] [Real]Absence check using 588 positive place invariants in 1007 ms returned sat
[2024-05-30 03:06:11] [INFO ] [Real]Absence check using state equation in 2021 ms returned sat
[2024-05-30 03:06:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 209 ms.
[2024-05-30 03:06:12] [INFO ] Added : 0 causal constraints over 0 iterations in 520 ms. Result :sat
Minimization took 551 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[176] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[176] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 200 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 03:06:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[176] Max Struct:[196]
RANDOM walk for 136948 steps (794 resets) in 30001 ms. (4 steps per ms)
BEST_FIRST walk for 69099 steps (0 resets) in 5026 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[178] Max Struct:[196]
[2024-05-30 03:06:48] [INFO ] Invariant cache hit.
[2024-05-30 03:06:49] [INFO ] [Real]Absence check using 588 positive place invariants in 508 ms returned sat
[2024-05-30 03:07:02] [INFO ] [Real]Absence check using state equation in 13098 ms returned sat
[2024-05-30 03:07:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 127 ms.
[2024-05-30 03:07:03] [INFO ] Added : 0 causal constraints over 0 iterations in 368 ms. Result :sat
Minimization took 6348 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[178] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[178] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 125 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 138 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-30 03:07:09] [INFO ] Invariant cache hit.
[2024-05-30 03:07:11] [INFO ] Implicit Places using invariants in 1985 ms returned []
[2024-05-30 03:07:11] [INFO ] Invariant cache hit.
[2024-05-30 03:07:16] [INFO ] Implicit Places using invariants and state equation in 5097 ms returned []
Implicit Place search using SMT with State Equation took 7087 ms to find 0 implicit places.
[2024-05-30 03:07:17] [INFO ] Redundant transitions in 133 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 7379 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 03:07:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[178] Max Struct:[196]
RANDOM walk for 137116 steps (794 resets) in 30001 ms. (4 steps per ms)
BEST_FIRST walk for 68241 steps (0 resets) in 5046 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[180] Max Struct:[196]
[2024-05-30 03:07:52] [INFO ] Invariant cache hit.
[2024-05-30 03:07:55] [INFO ] [Real]Absence check using 588 positive place invariants in 2566 ms returned sat
[2024-05-30 03:08:30] [INFO ] [Real]Absence check using state equation in 35806 ms returned sat
[2024-05-30 03:08:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 129 ms.
[2024-05-30 03:08:31] [INFO ] Added : 0 causal constraints over 0 iterations in 350 ms. Result :sat
Minimization took 5619 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[180] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[180] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 66 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 72 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-30 03:08:37] [INFO ] Invariant cache hit.
[2024-05-30 03:08:38] [INFO ] Implicit Places using invariants in 1659 ms returned []
[2024-05-30 03:08:38] [INFO ] Invariant cache hit.
[2024-05-30 03:08:44] [INFO ] Implicit Places using invariants and state equation in 5764 ms returned []
Implicit Place search using SMT with State Equation took 7425 ms to find 0 implicit places.
[2024-05-30 03:08:44] [INFO ] Redundant transitions in 139 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 7646 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 03:08:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[180] Max Struct:[196]
RANDOM walk for 137736 steps (799 resets) in 30001 ms. (4 steps per ms)
BEST_FIRST walk for 68108 steps (0 resets) in 5017 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[181] Max Struct:[196]
[2024-05-30 03:09:19] [INFO ] Invariant cache hit.
[2024-05-30 03:09:21] [INFO ] [Real]Absence check using 588 positive place invariants in 1567 ms returned sat
[2024-05-30 03:09:37] [INFO ] [Real]Absence check using state equation in 15410 ms returned sat
[2024-05-30 03:09:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 116 ms.
[2024-05-30 03:09:37] [INFO ] Added : 0 causal constraints over 0 iterations in 350 ms. Result :sat
Minimization took 6968 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[181] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[181] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 65 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 71 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-30 03:09:45] [INFO ] Invariant cache hit.
[2024-05-30 03:09:47] [INFO ] Implicit Places using invariants in 2022 ms returned []
[2024-05-30 03:09:47] [INFO ] Invariant cache hit.
[2024-05-30 03:09:52] [INFO ] Implicit Places using invariants and state equation in 5917 ms returned []
Implicit Place search using SMT with State Equation took 7944 ms to find 0 implicit places.
[2024-05-30 03:09:53] [INFO ] Redundant transitions in 73 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 8098 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 03:09:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[181] Max Struct:[196]
RANDOM walk for 137183 steps (796 resets) in 30001 ms. (4 steps per ms)
BEST_FIRST walk for 68305 steps (0 resets) in 5047 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[181] Max Struct:[196]
[2024-05-30 03:10:28] [INFO ] Invariant cache hit.
[2024-05-30 03:10:30] [INFO ] [Real]Absence check using 588 positive place invariants in 1634 ms returned sat
[2024-05-30 03:10:44] [INFO ] [Real]Absence check using state equation in 14580 ms returned sat
[2024-05-30 03:10:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 110 ms.
[2024-05-30 03:10:45] [INFO ] Added : 0 causal constraints over 0 iterations in 369 ms. Result :sat
Minimization took 6699 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[181] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[181] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 79 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 58 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-30 03:10:52] [INFO ] Invariant cache hit.
[2024-05-30 03:10:54] [INFO ] Implicit Places using invariants in 1969 ms returned []
[2024-05-30 03:10:54] [INFO ] Invariant cache hit.
[2024-05-30 03:10:59] [INFO ] Implicit Places using invariants and state equation in 5746 ms returned []
Implicit Place search using SMT with State Equation took 7717 ms to find 0 implicit places.
[2024-05-30 03:11:00] [INFO ] Redundant transitions in 72 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 7853 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 03:11:00] [INFO ] Flatten gal took : 461 ms
[2024-05-30 03:11:01] [INFO ] Flatten gal took : 347 ms
[2024-05-30 03:11:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11559128257478759232.gal : 112 ms
[2024-05-30 03:11:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11793508265329951118.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/ReachabilityCardinality11559128257478759232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11793508265329951118.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11793508265329951118.prop.
RANDOM walk for 40000 steps (231 resets) in 20567 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5622 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5139 ms. (7 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 501
Interrupted probabilistic random walk after 259131 steps, run timeout after 24060 ms. (steps per millisecond=10 ) properties seen :0 out of 2
Probabilistic random walk after 259131 steps, saw 258960 distinct states, run finished after 24069 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-30 03:11:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 588/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4802 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 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/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 588/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10592ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 62 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 3332/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (230 resets) in 14741 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3903 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3629 ms. (11 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2024-05-30 03:11:51] [INFO ] Flatten gal took : 139 ms
[2024-05-30 03:11:51] [INFO ] Applying decomposition
[2024-05-30 03:11:51] [INFO ] Flatten gal took : 132 ms
Probabilistic random walk after 139220 steps, saw 139156 distinct states, run finished after 15038 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-30 03:12:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 03:12:09] [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/graph17157895667095739792.txt' '-o' '/tmp/graph17157895667095739792.bin' '-w' '/tmp/graph17157895667095739792.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:71)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 03:12:09] [INFO ] Flatten gal took : 118 ms
[2024-05-30 03:12:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9078084900271504690.gal : 18 ms
[2024-05-30 03:12:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17067792900353330993.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/ReachabilityCardinality9078084900271504690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17067792900353330993.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/ReachabilityCardinality17067792900353330993.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 2 unsolved in 14906 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 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/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 588/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 501
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45045 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 60381ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 61 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 41 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-30 03:13:05] [INFO ] Invariant cache hit.
[2024-05-30 03:13:07] [INFO ] Implicit Places using invariants in 1968 ms returned []
[2024-05-30 03:13:07] [INFO ] Invariant cache hit.
[2024-05-30 03:13:12] [INFO ] Implicit Places using invariants and state equation in 5511 ms returned []
Implicit Place search using SMT with State Equation took 7485 ms to find 0 implicit places.
[2024-05-30 03:13:12] [INFO ] Redundant transitions in 76 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 7615 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[181] Max Struct:[196]
Starting property specific reduction for Sudoku-COL-AN14-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[196]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[196]
[2024-05-30 03:13:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[196]
RANDOM walk for 10000 steps (58 resets) in 2214 ms. (4 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 725 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[177] Max Struct:[196]
[2024-05-30 03:13:15] [INFO ] Invariant cache hit.
[2024-05-30 03:13:17] [INFO ] [Real]Absence check using 588 positive place invariants in 1140 ms returned sat
[2024-05-30 03:13:20] [INFO ] [Real]Absence check using state equation in 3537 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[177] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[177] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 40 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 03:13:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[177] Max Struct:[196]
RANDOM walk for 136325 steps (791 resets) in 30001 ms. (4 steps per ms)
BEST_FIRST walk for 69837 steps (0 resets) in 5021 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[179] Max Struct:[196]
[2024-05-30 03:13:55] [INFO ] Invariant cache hit.
[2024-05-30 03:13:57] [INFO ] [Real]Absence check using 588 positive place invariants in 845 ms returned sat
[2024-05-30 03:14:17] [INFO ] [Real]Absence check using state equation in 20438 ms returned sat
[2024-05-30 03:14:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 112 ms.
[2024-05-30 03:14:18] [INFO ] Added : 0 causal constraints over 0 iterations in 349 ms. Result :sat
Minimization took 7131 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[179] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[179] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 41 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 32 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-30 03:14:25] [INFO ] Invariant cache hit.
[2024-05-30 03:14:27] [INFO ] Implicit Places using invariants in 1932 ms returned []
[2024-05-30 03:14:27] [INFO ] Invariant cache hit.
[2024-05-30 03:14:32] [INFO ] Implicit Places using invariants and state equation in 5595 ms returned []
Implicit Place search using SMT with State Equation took 7542 ms to find 0 implicit places.
[2024-05-30 03:14:33] [INFO ] Redundant transitions in 73 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 7658 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 03:14:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[179] Max Struct:[196]
RANDOM walk for 137602 steps (798 resets) in 30001 ms. (4 steps per ms)
BEST_FIRST walk for 70546 steps (0 resets) in 5032 ms. (14 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[179] Max Struct:[196]
[2024-05-30 03:15:08] [INFO ] Invariant cache hit.
[2024-05-30 03:15:09] [INFO ] [Real]Absence check using 588 positive place invariants in 811 ms returned sat
[2024-05-30 03:15:28] [INFO ] [Real]Absence check using state equation in 19383 ms returned sat
[2024-05-30 03:15:28] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 101 ms.
[2024-05-30 03:15:29] [INFO ] Added : 0 causal constraints over 0 iterations in 328 ms. Result :sat
Minimization took 6980 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[179] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[179] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 59 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 37 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-30 03:15:36] [INFO ] Invariant cache hit.
[2024-05-30 03:15:38] [INFO ] Implicit Places using invariants in 1829 ms returned []
[2024-05-30 03:15:38] [INFO ] Invariant cache hit.
[2024-05-30 03:15:43] [INFO ] Implicit Places using invariants and state equation in 5274 ms returned []
Implicit Place search using SMT with State Equation took 7124 ms to find 0 implicit places.
[2024-05-30 03:15:43] [INFO ] Redundant transitions in 67 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 7245 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 03:15:43] [INFO ] Flatten gal took : 332 ms
[2024-05-30 03:15:44] [INFO ] Flatten gal took : 270 ms
[2024-05-30 03:15:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3996179206200649052.gal : 172 ms
[2024-05-30 03:15:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3659527065881147389.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/ReachabilityCardinality3996179206200649052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3659527065881147389.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/ReachabilityCardinality3659527065881147389.prop.
RANDOM walk for 40000 steps (230 resets) in 22846 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4409 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4067 ms. (9 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 501
Interrupted probabilistic random walk after 256728 steps, run timeout after 24001 ms. (steps per millisecond=10 ) properties seen :0 out of 2
Probabilistic random walk after 256728 steps, saw 256562 distinct states, run finished after 24002 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-30 03:16:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 588/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4897 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 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/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 588/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3336 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8887ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 1833 ms.
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 73 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 3332/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (229 resets) in 12327 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3593 ms. (11 steps per ms) remains 1/1 properties
Detected timeout of ITS tools.
[2024-05-30 03:16:34] [INFO ] Flatten gal took : 105 ms
[2024-05-30 03:16:34] [INFO ] Applying decomposition
[2024-05-30 03:16:34] [INFO ] Flatten gal took : 107 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/graph13051631023875486613.txt' '-o' '/tmp/graph13051631023875486613.bin' '-w' '/tmp/graph13051631023875486613.weights'
Probabilistic random walk after 155841 steps, saw 155770 distinct states, run finished after 12016 ms. (steps per millisecond=12 ) properties seen :0
[2024-05-30 03:16:43] [INFO ] Invariant cache hit.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13051631023875486613.bin' '-l' '-1' '-v' '-w' '/tmp/graph13051631023875486613.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:16:43] [INFO ] Decomposing Gal with order
[2024-05-30 03:16:43] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 0 (INCLUDED_ONLY) 0/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 03:16:45] [INFO ] Removed a total of 5309 redundant transitions.
[2024-05-30 03:16:46] [INFO ] Flatten gal took : 2101 ms
[2024-05-30 03:16:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 386 labels/synchronizations in 127 ms.
[2024-05-30 03:16:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1783424459655329528.gal : 23 ms
[2024-05-30 03:16:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16703957690723966446.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1783424459655329528.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16703957690723966446.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/ReachabilityCardinality16703957690723966446.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9454 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 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/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9508 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 19265ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 69 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 32 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-30 03:17:02] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 216
[2024-05-30 03:17:04] [INFO ] Implicit Places using invariants in 1870 ms returned []
[2024-05-30 03:17:04] [INFO ] Invariant cache hit.
[2024-05-30 03:17:09] [INFO ] Implicit Places using invariants and state equation in 5571 ms returned []
Implicit Place search using SMT with State Equation took 7460 ms to find 0 implicit places.
[2024-05-30 03:17:10] [INFO ] Redundant transitions in 69 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7570 ms. Remains : 3332/3332 places, 2744/2744 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[179] Max Struct:[196]
Ending property specific reduction for Sudoku-COL-AN14-UpperBounds-01 in 237292 ms.
[2024-05-30 03:17:10] [INFO ] Flatten gal took : 124 ms
[2024-05-30 03:17:10] [INFO ] Applying decomposition
[2024-05-30 03:17:10] [INFO ] Flatten gal took : 101 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/graph4444870532134415515.txt' '-o' '/tmp/graph4444870532134415515.bin' '-w' '/tmp/graph4444870532134415515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4444870532134415515.bin' '-l' '-1' '-v' '-w' '/tmp/graph4444870532134415515.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:17:10] [INFO ] Decomposing Gal with order
[2024-05-30 03:17:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:17:11] [INFO ] Removed a total of 4900 redundant transitions.
[2024-05-30 03:17:11] [INFO ] Flatten gal took : 202 ms
[2024-05-30 03:17:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 24 ms.
[2024-05-30 03:17:11] [INFO ] Time to serialize gal into /tmp/UpperBounds13516129993820845771.gal : 30 ms
[2024-05-30 03:17:11] [INFO ] Time to serialize properties into /tmp/UpperBounds10609582002745514097.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/UpperBounds13516129993820845771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10609582002745514097.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/UpperBounds10609582002745514097.prop.
ITS-tools command line returned an error code 137
[2024-05-30 03:23:08] [INFO ] Applying decomposition
[2024-05-30 03:23:08] [INFO ] Flatten gal took : 110 ms
[2024-05-30 03:23:09] [INFO ] Decomposing Gal with order
[2024-05-30 03:23:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:23:09] [INFO ] Removed a total of 6874 redundant transitions.
[2024-05-30 03:23:10] [INFO ] Flatten gal took : 238 ms
[2024-05-30 03:23:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2024-05-30 03:23:10] [INFO ] Time to serialize gal into /tmp/UpperBounds14384512287462929887.gal : 21 ms
[2024-05-30 03:23:10] [INFO ] Time to serialize properties into /tmp/UpperBounds9057226135766147490.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/UpperBounds14384512287462929887.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9057226135766147490.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/UpperBounds9057226135766147490.prop.
ITS-tools command line returned an error code 137
[2024-05-30 03:29:28] [INFO ] Flatten gal took : 122 ms
[2024-05-30 03:29:28] [INFO ] Input system was already deterministic with 2744 transitions.
[2024-05-30 03:29:28] [INFO ] Transformed 3332 places.
[2024-05-30 03:29:28] [INFO ] Transformed 2744 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 03:29:30] [INFO ] Time to serialize gal into /tmp/UpperBounds7372115669061313439.gal : 14 ms
[2024-05-30 03:29:30] [INFO ] Time to serialize properties into /tmp/UpperBounds17613149104434373808.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/UpperBounds7372115669061313439.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17613149104434373808.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/UpperBounds17613149104434373808.prop.
ITS-tools command line returned an error code 137
Total runtime 1769679 ms.
BK_STOP 1717040134091
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-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-5568"
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 r400-tall-171690532500517"
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 '
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 ;