About the Execution of Smart+red for Philosophers-COL-000500
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r299-tall-167873952600133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Philosophers-COL-000500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873952600133
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 9.1K Feb 25 14:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 14:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 25 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 31K Mar 5 18:23 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 Philosophers-COL-000500-UpperBounds-00
FORMULA_NAME Philosophers-COL-000500-UpperBounds-01
FORMULA_NAME Philosophers-COL-000500-UpperBounds-02
FORMULA_NAME Philosophers-COL-000500-UpperBounds-03
FORMULA_NAME Philosophers-COL-000500-UpperBounds-04
FORMULA_NAME Philosophers-COL-000500-UpperBounds-05
FORMULA_NAME Philosophers-COL-000500-UpperBounds-06
FORMULA_NAME Philosophers-COL-000500-UpperBounds-07
FORMULA_NAME Philosophers-COL-000500-UpperBounds-08
FORMULA_NAME Philosophers-COL-000500-UpperBounds-09
FORMULA_NAME Philosophers-COL-000500-UpperBounds-10
FORMULA_NAME Philosophers-COL-000500-UpperBounds-11
FORMULA_NAME Philosophers-COL-000500-UpperBounds-12
FORMULA_NAME Philosophers-COL-000500-UpperBounds-13
FORMULA_NAME Philosophers-COL-000500-UpperBounds-14
FORMULA_NAME Philosophers-COL-000500-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679447006890
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000500
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 01:03:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 01:03:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:03:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 01:03:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 01:03:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 574 ms
[2023-03-22 01:03:28] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 2500 PT places and 2500.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 01:03:29] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-22 01:03:29] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-22 01:03:29] [INFO ] Computed 2 place invariants in 5 ms
FORMULA Philosophers-COL-000500-UpperBounds-14 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-13 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-11 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-10 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-09 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-05 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-04 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-02 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 01:03:29] [INFO ] Invariant cache hit.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 01:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 01:03:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 01:03:29] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 01:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:03:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 01:03:29] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 01:03:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 01:03:29] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:03:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 01:03:29] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 01:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 01:03:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 01:03:29] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:03:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 01:03:29] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 01:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 01:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:03:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 01:03:29] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [500, 250, 250, 500, 500, 250, 250]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 500) 500) 500)]] contains successor/predecessor on variables of sort Philo
[2023-03-22 01:03:29] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions 8000 arcs in 55 ms.
[2023-03-22 01:03:29] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1396 ms. (steps per millisecond=7 ) properties (out of 7) seen :995
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 7) seen :11
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-22 01:03:32] [INFO ] Computed 1000 place invariants in 34 ms
[2023-03-22 01:03:33] [INFO ] [Real]Absence check using 1000 positive place invariants in 280 ms returned sat
[2023-03-22 01:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:34] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2023-03-22 01:03:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:34] [INFO ] [Nat]Absence check using 1000 positive place invariants in 250 ms returned sat
[2023-03-22 01:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:35] [INFO ] [Nat]Absence check using state equation in 1003 ms returned sat
[2023-03-22 01:03:35] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 116 ms.
[2023-03-22 01:03:37] [INFO ] Added : 56 causal constraints over 12 iterations in 1680 ms. Result :sat
Minimization took 385 ms.
[2023-03-22 01:03:38] [INFO ] [Real]Absence check using 1000 positive place invariants in 222 ms returned sat
[2023-03-22 01:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:39] [INFO ] [Real]Absence check using state equation in 1009 ms returned sat
[2023-03-22 01:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:39] [INFO ] [Nat]Absence check using 1000 positive place invariants in 226 ms returned sat
[2023-03-22 01:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:41] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2023-03-22 01:03:41] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 124 ms.
[2023-03-22 01:03:43] [INFO ] Added : 84 causal constraints over 17 iterations in 2098 ms. Result :sat
Minimization took 488 ms.
[2023-03-22 01:03:44] [INFO ] [Real]Absence check using 1000 positive place invariants in 201 ms returned sat
[2023-03-22 01:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:45] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2023-03-22 01:03:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:45] [INFO ] [Nat]Absence check using 1000 positive place invariants in 207 ms returned sat
[2023-03-22 01:03:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:46] [INFO ] [Nat]Absence check using state equation in 1012 ms returned sat
[2023-03-22 01:03:46] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 119 ms.
[2023-03-22 01:03:48] [INFO ] Added : 84 causal constraints over 17 iterations in 2101 ms. Result :sat
Minimization took 504 ms.
[2023-03-22 01:03:49] [INFO ] [Real]Absence check using 1000 positive place invariants in 266 ms returned sat
[2023-03-22 01:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:50] [INFO ] [Real]Absence check using state equation in 956 ms returned sat
[2023-03-22 01:03:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:51] [INFO ] [Nat]Absence check using 1000 positive place invariants in 250 ms returned sat
[2023-03-22 01:03:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:52] [INFO ] [Nat]Absence check using state equation in 1055 ms returned sat
[2023-03-22 01:03:52] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 120 ms.
[2023-03-22 01:03:54] [INFO ] Added : 56 causal constraints over 12 iterations in 1624 ms. Result :sat
Minimization took 380 ms.
[2023-03-22 01:03:55] [INFO ] [Real]Absence check using 1000 positive place invariants in 249 ms returned sat
[2023-03-22 01:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:56] [INFO ] [Real]Absence check using state equation in 959 ms returned sat
[2023-03-22 01:03:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:03:56] [INFO ] [Nat]Absence check using 1000 positive place invariants in 247 ms returned sat
[2023-03-22 01:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:03:57] [INFO ] [Nat]Absence check using state equation in 1007 ms returned sat
[2023-03-22 01:03:57] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 96 ms.
[2023-03-22 01:03:59] [INFO ] Added : 56 causal constraints over 12 iterations in 1555 ms. Result :sat
Minimization took 376 ms.
[2023-03-22 01:04:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 196 ms returned sat
[2023-03-22 01:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:04:01] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2023-03-22 01:04:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:04:01] [INFO ] [Nat]Absence check using 1000 positive place invariants in 208 ms returned sat
[2023-03-22 01:04:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:04:02] [INFO ] [Nat]Absence check using state equation in 996 ms returned sat
[2023-03-22 01:04:02] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 95 ms.
[2023-03-22 01:04:04] [INFO ] Added : 84 causal constraints over 17 iterations in 2106 ms. Result :sat
Minimization took 491 ms.
[2023-03-22 01:04:05] [INFO ] [Real]Absence check using 1000 positive place invariants in 205 ms returned sat
[2023-03-22 01:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:04:06] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2023-03-22 01:04:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:04:07] [INFO ] [Nat]Absence check using 1000 positive place invariants in 205 ms returned sat
[2023-03-22 01:04:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:04:08] [INFO ] [Nat]Absence check using state equation in 974 ms returned sat
[2023-03-22 01:04:08] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 95 ms.
[2023-03-22 01:04:10] [INFO ] Added : 84 causal constraints over 17 iterations in 2103 ms. Result :sat
Minimization took 515 ms.
Current structural bounds on expressions (after SMT) : [500, 250, 250, 500, 500, 250, 250] Max seen :[221, 83, 83, 221, 221, 83, 83]
FORMULA Philosophers-COL-000500-UpperBounds-08 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-00 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Free-agglomeration rule (complex) applied 1000 times.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2500 transition count 1500
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 2500 place count 1500 transition count 1000
Applied a total of 2500 rules in 531 ms. Remains 1500 /2500 variables (removed 1000) and now considering 1000/2500 (removed 1500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 1500/2500 places, 1000/2500 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-22 01:04:58] [INFO ] Computed 1000 place invariants in 7 ms
Finished random walk after 253179 steps, including 0 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=8 )
Finished Best-First random walk after 188745 steps, including 0 resets, run visited all 4 properties in 5004 ms. (steps per millisecond=37 )
Finished Best-First random walk after 186114 steps, including 0 resets, run visited all 4 properties in 5005 ms. (steps per millisecond=37 )
Finished Best-First random walk after 178257 steps, including 0 resets, run visited all 4 properties in 5002 ms. (steps per millisecond=35 )
Finished Best-First random walk after 177619 steps, including 0 resets, run visited all 4 properties in 5003 ms. (steps per millisecond=35 )
[2023-03-22 01:05:48] [INFO ] Invariant cache hit.
[2023-03-22 01:05:48] [INFO ] [Real]Absence check using 1000 positive place invariants in 264 ms returned sat
[2023-03-22 01:05:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:05:49] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2023-03-22 01:05:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:05:49] [INFO ] [Nat]Absence check using 1000 positive place invariants in 259 ms returned sat
[2023-03-22 01:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:05:49] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2023-03-22 01:05:50] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 43 ms.
[2023-03-22 01:05:50] [INFO ] Added : 0 causal constraints over 0 iterations in 142 ms. Result :sat
Minimization took 218 ms.
[2023-03-22 01:05:50] [INFO ] [Real]Absence check using 1000 positive place invariants in 253 ms returned sat
[2023-03-22 01:05:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:05:51] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-22 01:05:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:05:51] [INFO ] [Nat]Absence check using 1000 positive place invariants in 255 ms returned sat
[2023-03-22 01:05:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:05:52] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2023-03-22 01:05:52] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-22 01:05:52] [INFO ] Added : 0 causal constraints over 0 iterations in 128 ms. Result :sat
Minimization took 212 ms.
[2023-03-22 01:05:52] [INFO ] [Real]Absence check using 1000 positive place invariants in 247 ms returned sat
[2023-03-22 01:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:05:53] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2023-03-22 01:05:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:05:53] [INFO ] [Nat]Absence check using 1000 positive place invariants in 246 ms returned sat
[2023-03-22 01:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:05:54] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2023-03-22 01:05:54] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 39 ms.
[2023-03-22 01:05:54] [INFO ] Added : 0 causal constraints over 0 iterations in 133 ms. Result :sat
Minimization took 211 ms.
[2023-03-22 01:05:55] [INFO ] [Real]Absence check using 1000 positive place invariants in 243 ms returned sat
[2023-03-22 01:05:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:05:55] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2023-03-22 01:05:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:05:56] [INFO ] [Nat]Absence check using 1000 positive place invariants in 258 ms returned sat
[2023-03-22 01:05:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:05:56] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2023-03-22 01:05:56] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 42 ms.
[2023-03-22 01:05:56] [INFO ] Added : 0 causal constraints over 0 iterations in 134 ms. Result :sat
Minimization took 210 ms.
Current structural bounds on expressions (after SMT) : [250, 250, 250, 250] Max seen :[247, 247, 247, 247]
FORMULA Philosophers-COL-000500-UpperBounds-15 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-12 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-06 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-01 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 150727 ms.
ITS solved all properties within timeout
BK_STOP 1679447159859
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-000500"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is Philosophers-COL-000500, 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 r299-tall-167873952600133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000500.tgz
mv Philosophers-COL-000500 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 ;