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.r459-smll-167912651300477.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 StigmergyCommit-PT-07a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651300477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 5.4K Feb 26 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 11:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 11:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 5.4M 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 StigmergyCommit-PT-07a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679362403604

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=StigmergyCommit-PT-07a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 01:33:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 01:33:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 01:33:27] [INFO ] Load time of PNML (sax parser for PT used): 744 ms
[2023-03-21 01:33:27] [INFO ] Transformed 292 places.
[2023-03-21 01:33:27] [INFO ] Transformed 7108 transitions.
[2023-03-21 01:33:27] [INFO ] Found NUPN structural information;
[2023-03-21 01:33:27] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 940 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Normalized transition count is 866 out of 890 initially.
// Phase 1: matrix 866 rows 292 cols
[2023-03-21 01:33:27] [INFO ] Computed 9 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 16) seen :10
FORMULA StigmergyCommit-PT-07a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
[2023-03-21 01:33:28] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2023-03-21 01:33:28] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-21 01:33:28] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-21 01:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:29] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2023-03-21 01:33:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:33:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-21 01:33:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:29] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2023-03-21 01:33:29] [INFO ] State equation strengthened by 621 read => feed constraints.
[2023-03-21 01:33:30] [INFO ] [Nat]Added 621 Read/Feed constraints in 280 ms returned sat
[2023-03-21 01:33:30] [INFO ] Deduced a trap composed of 16 places in 451 ms of which 7 ms to minimize.
[2023-03-21 01:33:31] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 2 ms to minimize.
[2023-03-21 01:33:31] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 2 ms to minimize.
[2023-03-21 01:33:31] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 1 ms to minimize.
[2023-03-21 01:33:31] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 2 ms to minimize.
[2023-03-21 01:33:32] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2023-03-21 01:33:32] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2023-03-21 01:33:32] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2023-03-21 01:33:32] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-21 01:33:33] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-21 01:33:33] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2023-03-21 01:33:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3167 ms
[2023-03-21 01:33:33] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 250 ms.
[2023-03-21 01:33:34] [INFO ] Added : 50 causal constraints over 10 iterations in 937 ms. Result :unknown
[2023-03-21 01:33:34] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-21 01:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:34] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2023-03-21 01:33:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:33:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-21 01:33:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:35] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2023-03-21 01:33:35] [INFO ] [Nat]Added 621 Read/Feed constraints in 346 ms returned sat
[2023-03-21 01:33:36] [INFO ] Deduced a trap composed of 18 places in 545 ms of which 3 ms to minimize.
[2023-03-21 01:33:36] [INFO ] Deduced a trap composed of 18 places in 356 ms of which 1 ms to minimize.
[2023-03-21 01:33:36] [INFO ] Deduced a trap composed of 16 places in 336 ms of which 0 ms to minimize.
[2023-03-21 01:33:37] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 1 ms to minimize.
[2023-03-21 01:33:37] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 2 ms to minimize.
[2023-03-21 01:33:37] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2023-03-21 01:33:38] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2023-03-21 01:33:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2528 ms
[2023-03-21 01:33:38] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 150 ms.
[2023-03-21 01:33:39] [INFO ] Added : 63 causal constraints over 13 iterations in 1258 ms. Result :sat
Minimization took 255 ms.
[2023-03-21 01:33:39] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2023-03-21 01:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:40] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2023-03-21 01:33:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:33:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-21 01:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:40] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2023-03-21 01:33:40] [INFO ] [Nat]Added 621 Read/Feed constraints in 173 ms returned sat
[2023-03-21 01:33:40] [INFO ] Deduced a trap composed of 16 places in 293 ms of which 1 ms to minimize.
[2023-03-21 01:33:41] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 1 ms to minimize.
[2023-03-21 01:33:41] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 1 ms to minimize.
[2023-03-21 01:33:41] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 1 ms to minimize.
[2023-03-21 01:33:42] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 1 ms to minimize.
[2023-03-21 01:33:42] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 1 ms to minimize.
[2023-03-21 01:33:42] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 0 ms to minimize.
[2023-03-21 01:33:42] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 0 ms to minimize.
[2023-03-21 01:33:43] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 1 ms to minimize.
[2023-03-21 01:33:43] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 1 ms to minimize.
[2023-03-21 01:33:43] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2023-03-21 01:33:43] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-21 01:33:44] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2023-03-21 01:33:44] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2023-03-21 01:33:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3938 ms
[2023-03-21 01:33:44] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 249 ms.
[2023-03-21 01:33:45] [INFO ] Added : 25 causal constraints over 5 iterations in 580 ms. Result :unknown
[2023-03-21 01:33:45] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-21 01:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:45] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-21 01:33:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:33:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-21 01:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:46] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2023-03-21 01:33:46] [INFO ] [Nat]Added 621 Read/Feed constraints in 228 ms returned sat
[2023-03-21 01:33:46] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 1 ms to minimize.
[2023-03-21 01:33:46] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 1 ms to minimize.
[2023-03-21 01:33:47] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 0 ms to minimize.
[2023-03-21 01:33:47] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 1 ms to minimize.
[2023-03-21 01:33:47] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 1 ms to minimize.
[2023-03-21 01:33:47] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2023-03-21 01:33:47] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2023-03-21 01:33:48] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2023-03-21 01:33:48] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2023-03-21 01:33:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2005 ms
[2023-03-21 01:33:48] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 138 ms.
[2023-03-21 01:33:49] [INFO ] Added : 65 causal constraints over 13 iterations in 1049 ms. Result :sat
Minimization took 200 ms.
[2023-03-21 01:33:49] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-21 01:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:49] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2023-03-21 01:33:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:33:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-21 01:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:50] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2023-03-21 01:33:50] [INFO ] [Nat]Added 621 Read/Feed constraints in 161 ms returned sat
[2023-03-21 01:33:50] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 1 ms to minimize.
[2023-03-21 01:33:51] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 0 ms to minimize.
[2023-03-21 01:33:51] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 0 ms to minimize.
[2023-03-21 01:33:51] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 1 ms to minimize.
[2023-03-21 01:33:51] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 0 ms to minimize.
[2023-03-21 01:33:52] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2023-03-21 01:33:52] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2023-03-21 01:33:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1800 ms
[2023-03-21 01:33:52] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 157 ms.
[2023-03-21 01:33:53] [INFO ] Added : 64 causal constraints over 13 iterations in 1565 ms. Result :sat
Minimization took 368 ms.
[2023-03-21 01:33:54] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-21 01:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:54] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2023-03-21 01:33:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:33:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-21 01:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:33:55] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2023-03-21 01:33:55] [INFO ] [Nat]Added 621 Read/Feed constraints in 217 ms returned sat
[2023-03-21 01:33:55] [INFO ] Deduced a trap composed of 16 places in 424 ms of which 1 ms to minimize.
[2023-03-21 01:33:56] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 1 ms to minimize.
[2023-03-21 01:33:56] [INFO ] Deduced a trap composed of 17 places in 315 ms of which 2 ms to minimize.
[2023-03-21 01:33:57] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 1 ms to minimize.
[2023-03-21 01:33:57] [INFO ] Deduced a trap composed of 16 places in 265 ms of which 1 ms to minimize.
[2023-03-21 01:33:57] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 1 ms to minimize.
[2023-03-21 01:33:57] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 0 ms to minimize.
[2023-03-21 01:33:58] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2023-03-21 01:33:58] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2023-03-21 01:33:58] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 0 ms to minimize.
[2023-03-21 01:33:58] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 0 ms to minimize.
[2023-03-21 01:33:58] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-21 01:33:58] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3508 ms
[2023-03-21 01:33:59] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 151 ms.
[2023-03-21 01:33:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-07a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 890/890 transitions.
Graph (complete) has 651 edges and 292 vertex of which 284 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.11 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 284 transition count 810
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 86 rules applied. Total rules applied 159 place count 237 transition count 771
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 229 transition count 770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 228 transition count 770
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 169 place count 228 transition count 716
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 277 place count 174 transition count 716
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 318 place count 133 transition count 675
Iterating global reduction 4 with 41 rules applied. Total rules applied 359 place count 133 transition count 675
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 400 place count 92 transition count 634
Iterating global reduction 4 with 41 rules applied. Total rules applied 441 place count 92 transition count 634
Ensure Unique test removed 263 transitions
Reduce isomorphic transitions removed 263 transitions.
Iterating post reduction 4 with 263 rules applied. Total rules applied 704 place count 92 transition count 371
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 711 place count 85 transition count 364
Iterating global reduction 5 with 7 rules applied. Total rules applied 718 place count 85 transition count 364
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 725 place count 78 transition count 357
Iterating global reduction 5 with 7 rules applied. Total rules applied 732 place count 78 transition count 357
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 738 place count 78 transition count 351
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 768 place count 63 transition count 336
Drop transitions removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 782 place count 63 transition count 322
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 789 place count 56 transition count 315
Iterating global reduction 7 with 7 rules applied. Total rules applied 796 place count 56 transition count 315
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 803 place count 49 transition count 308
Iterating global reduction 7 with 7 rules applied. Total rules applied 810 place count 49 transition count 308
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 817 place count 42 transition count 301
Iterating global reduction 7 with 7 rules applied. Total rules applied 824 place count 42 transition count 301
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 826 place count 42 transition count 299
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 828 place count 42 transition count 299
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 829 place count 42 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 830 place count 41 transition count 297
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 7 with 8 rules applied. Total rules applied 838 place count 40 transition count 290
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 845 place count 33 transition count 290
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 845 place count 33 transition count 288
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 849 place count 31 transition count 288
Performed 9 Post agglomeration using F-continuation condition with reduction of 247 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 867 place count 22 transition count 32
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 874 place count 22 transition count 25
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 19 rules applied. Total rules applied 893 place count 10 transition count 18
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 900 place count 10 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 901 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 902 place count 9 transition count 9
Applied a total of 902 rules in 329 ms. Remains 9 /292 variables (removed 283) and now considering 9/890 (removed 881) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 9/292 places, 9/890 transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-03-21 01:34:00] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 3) seen :3
FORMULA StigmergyCommit-PT-07a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 34435 ms.
ITS solved all properties within timeout

BK_STOP 1679362441849

--------------------
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="StigmergyCommit-PT-07a"
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 StigmergyCommit-PT-07a, 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 r459-smll-167912651300477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-07a.tgz
mv StigmergyCommit-PT-07a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;