Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975300477.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d2m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975300477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 SieveSingleMsgMbox-PT-d2m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679182024340

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-18 23:27:05] [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]
[2023-03-18 23:27:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:27:06] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2023-03-18 23:27:06] [INFO ] Transformed 2398 places.
[2023-03-18 23:27:06] [INFO ] Transformed 1954 transitions.
[2023-03-18 23:27:06] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1984 places in 17 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2023-03-18 23:27:06] [INFO ] Computed 6 place invariants in 58 ms
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 946 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
[2023-03-18 23:27:06] [INFO ] Invariant cache hit.
[2023-03-18 23:27:06] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-18 23:27:06] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:27:06] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2023-03-18 23:27:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:27:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 23:27:07] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 23:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:27:07] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2023-03-18 23:27:07] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-18 23:27:07] [INFO ] [Nat]Added 1674 Read/Feed constraints in 334 ms returned sat
[2023-03-18 23:27:08] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 4 ms to minimize.
[2023-03-18 23:27:08] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 1 ms to minimize.
[2023-03-18 23:27:08] [INFO ] Deduced a trap composed of 191 places in 186 ms of which 1 ms to minimize.
[2023-03-18 23:27:09] [INFO ] Deduced a trap composed of 97 places in 249 ms of which 1 ms to minimize.
[2023-03-18 23:27:09] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 2 ms to minimize.
[2023-03-18 23:27:10] [INFO ] Deduced a trap composed of 219 places in 224 ms of which 1 ms to minimize.
[2023-03-18 23:27:10] [INFO ] Deduced a trap composed of 234 places in 278 ms of which 1 ms to minimize.
[2023-03-18 23:27:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2896 ms
[2023-03-18 23:27:11] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 346 ms.
[2023-03-18 23:27:12] [INFO ] Deduced a trap composed of 25 places in 314 ms of which 2 ms to minimize.
[2023-03-18 23:27:12] [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 0
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
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] Max seen :[0]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 373
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 373
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 363
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1169 place count 178 transition count 271
Iterating global reduction 2 with 92 rules applied. Total rules applied 1261 place count 178 transition count 271
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1296 place count 178 transition count 236
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1335 place count 139 transition count 182
Iterating global reduction 3 with 39 rules applied. Total rules applied 1374 place count 139 transition count 182
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1398 place count 139 transition count 158
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1407 place count 130 transition count 145
Iterating global reduction 4 with 9 rules applied. Total rules applied 1416 place count 130 transition count 145
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1425 place count 121 transition count 136
Iterating global reduction 4 with 9 rules applied. Total rules applied 1434 place count 121 transition count 136
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1439 place count 116 transition count 130
Iterating global reduction 4 with 5 rules applied. Total rules applied 1444 place count 116 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1446 place count 116 transition count 128
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1451 place count 111 transition count 123
Iterating global reduction 5 with 5 rules applied. Total rules applied 1456 place count 111 transition count 123
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1459 place count 108 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 1462 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1463 place count 107 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 1464 place count 107 transition count 119
Applied a total of 1464 rules in 139 ms. Remains 107 /414 variables (removed 307) and now considering 119/1954 (removed 1835) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 107/414 places, 119/1954 transitions.
// Phase 1: matrix 119 rows 107 cols
[2023-03-18 23:27:12] [INFO ] Computed 4 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 224781 resets, run finished after 917 ms. (steps per millisecond=1090 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103256 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 1) seen :0
[2023-03-18 23:27:13] [INFO ] Invariant cache hit.
[2023-03-18 23:27:13] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 23:27:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:27:13] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-18 23:27:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:27:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 23:27:13] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:27:14] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-18 23:27:14] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:27:14] [INFO ] [Nat]Added 44 Read/Feed constraints in 7 ms returned sat
[2023-03-18 23:27:14] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2023-03-18 23:27:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-18 23:27:14] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 9 ms.
[2023-03-18 23:27:14] [INFO ] Added : 14 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 107/107 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-18 23:27:14] [INFO ] Invariant cache hit.
[2023-03-18 23:27:14] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-18 23:27:14] [INFO ] Invariant cache hit.
[2023-03-18 23:27:14] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:27:14] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-18 23:27:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 23:27:14] [INFO ] Invariant cache hit.
[2023-03-18 23:27:14] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 107/107 places, 119/119 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-04
[2023-03-18 23:27:14] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2224 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1022 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-18 23:27:14] [INFO ] Invariant cache hit.
[2023-03-18 23:27:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 23:27:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:27:14] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-18 23:27:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:27:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 23:27:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-18 23:27:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:27:14] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-18 23:27:14] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:27:14] [INFO ] [Nat]Added 44 Read/Feed constraints in 7 ms returned sat
[2023-03-18 23:27:14] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2023-03-18 23:27:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-18 23:27:14] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 11 ms.
[2023-03-18 23:27:14] [INFO ] Added : 14 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [486] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 107/107 places, 119/119 transitions.
[2023-03-18 23:27:14] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 224531 resets, run finished after 818 ms. (steps per millisecond=1222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102811 resets, run finished after 413 ms. (steps per millisecond=2421 ) properties (out of 1) seen :0
[2023-03-18 23:27:16] [INFO ] Invariant cache hit.
[2023-03-18 23:27:16] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 23:27:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 23:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:27:16] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-18 23:27:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:27:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 23:27:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:27:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:27:16] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-18 23:27:16] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:27:16] [INFO ] [Nat]Added 44 Read/Feed constraints in 10 ms returned sat
[2023-03-18 23:27:16] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2023-03-18 23:27:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-18 23:27:16] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 6 ms.
[2023-03-18 23:27:16] [INFO ] Added : 14 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [486] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 11 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 107/107 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-18 23:27:16] [INFO ] Invariant cache hit.
[2023-03-18 23:27:16] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 23:27:16] [INFO ] Invariant cache hit.
[2023-03-18 23:27:16] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:27:16] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-18 23:27:16] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 23:27:16] [INFO ] Invariant cache hit.
[2023-03-18 23:27:16] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 107/107 places, 119/119 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-04 in 2330 ms.
[2023-03-18 23:27:17] [INFO ] Flatten gal took : 39 ms
[2023-03-18 23:27:17] [INFO ] Applying decomposition
[2023-03-18 23:27:17] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14101542459121897611.txt' '-o' '/tmp/graph14101542459121897611.bin' '-w' '/tmp/graph14101542459121897611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14101542459121897611.bin' '-l' '-1' '-v' '-w' '/tmp/graph14101542459121897611.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:27:17] [INFO ] Decomposing Gal with order
[2023-03-18 23:27:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:27:17] [INFO ] Removed a total of 113 redundant transitions.
[2023-03-18 23:27:17] [INFO ] Flatten gal took : 47 ms
[2023-03-18 23:27:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 7 ms.
[2023-03-18 23:27:17] [INFO ] Time to serialize gal into /tmp/UpperBounds6111799266329966998.gal : 6 ms
[2023-03-18 23:27:17] [INFO ] Time to serialize properties into /tmp/UpperBounds16229565618465610828.prop : 0 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6111799266329966998.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16229565618465610828.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds16229565618465610828.prop.
Detected timeout of ITS tools.
[2023-03-18 23:47:20] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:47:20] [INFO ] Time to serialize gal into /tmp/UpperBounds12305300588208780446.gal : 3 ms
[2023-03-18 23:47:20] [INFO ] Time to serialize properties into /tmp/UpperBounds9346850916583258980.prop : 0 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12305300588208780446.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9346850916583258980.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds9346850916583258980.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.60494e+13,86.7317,1614676,2,33152,5,6.1949e+06,6,0,549,5.4487e+06,0
Total reachable state count : 16049403360124

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d2m36-UpperBounds-04 :0 <= p36 <= 0
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-04 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m36-UpperBounds-04,0,86.7988,1614676,1,0,6,6.1949e+06,9,1,808,5.4487e+06,4
Total runtime 1301721 ms.

BK_STOP 1679183327688

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="SieveSingleMsgMbox-PT-d2m36"
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-5348"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m36, 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 r421-tajo-167905975300477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m36.tgz
mv SieveSingleMsgMbox-PT-d2m36 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 ;