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.r485-tall-167912699400453.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 itstools
Input is Szymanski-PT-b02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699400453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.6K Feb 26 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 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 3.7M 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 Szymanski-PT-b02-UpperBounds-00
FORMULA_NAME Szymanski-PT-b02-UpperBounds-01
FORMULA_NAME Szymanski-PT-b02-UpperBounds-02
FORMULA_NAME Szymanski-PT-b02-UpperBounds-03
FORMULA_NAME Szymanski-PT-b02-UpperBounds-04
FORMULA_NAME Szymanski-PT-b02-UpperBounds-05
FORMULA_NAME Szymanski-PT-b02-UpperBounds-06
FORMULA_NAME Szymanski-PT-b02-UpperBounds-07
FORMULA_NAME Szymanski-PT-b02-UpperBounds-08
FORMULA_NAME Szymanski-PT-b02-UpperBounds-09
FORMULA_NAME Szymanski-PT-b02-UpperBounds-10
FORMULA_NAME Szymanski-PT-b02-UpperBounds-11
FORMULA_NAME Szymanski-PT-b02-UpperBounds-12
FORMULA_NAME Szymanski-PT-b02-UpperBounds-13
FORMULA_NAME Szymanski-PT-b02-UpperBounds-14
FORMULA_NAME Szymanski-PT-b02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679223742924

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=Szymanski-PT-b02
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-19 11:02:24] [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-19 11:02:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:02:24] [INFO ] Load time of PNML (sax parser for PT used): 285 ms
[2023-03-19 11:02:24] [INFO ] Transformed 568 places.
[2023-03-19 11:02:24] [INFO ] Transformed 8320 transitions.
[2023-03-19 11:02:24] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b02-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2733 out of 8064 initially.
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 11:02:25] [INFO ] Computed 3 place invariants in 66 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :3
FORMULA Szymanski-PT-b02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :2
[2023-03-19 11:02:25] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 11:02:25] [INFO ] Computed 3 place invariants in 27 ms
[2023-03-19 11:02:25] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-19 11:02:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 11:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:02:26] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2023-03-19 11:02:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:02:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 11:02:26] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 11:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:02:27] [INFO ] [Nat]Absence check using state equation in 935 ms returned sat
[2023-03-19 11:02:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:02:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:02:30] [INFO ] [Nat]Added 147 Read/Feed constraints in 3695 ms returned sat
[2023-03-19 11:02:31] [INFO ] Deduced a trap composed of 138 places in 663 ms of which 3 ms to minimize.
[2023-03-19 11:02:31] [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.verifyPossible(DeadlockTester.java:916)
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)
[2023-03-19 11:02:31] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 11:02:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 11:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:02:32] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-19 11:02:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:02:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 11:02:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 11:02:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:02:32] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2023-03-19 11:02:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:02:37] [INFO ] [Nat]Added 147 Read/Feed constraints in 4368 ms returned unknown
[2023-03-19 11:02:37] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 11:02:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 11:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:02:37] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2023-03-19 11:02:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:02:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 11:02:37] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 11:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:02:38] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-19 11:02:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:02:42] [INFO ] [Nat]Added 147 Read/Feed constraints in 4491 ms returned unknown
[2023-03-19 11:02:42] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 11:02:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 11:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:02:43] [INFO ] [Real]Absence check using state equation in 569 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 2] Max seen :[0, 0, 0, 2]
FORMULA Szymanski-PT-b02-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 459 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 460 ms. Remains : 305/308 places, 7808/8064 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:02:43] [INFO ] Computed 3 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2578 ms. (steps per millisecond=387 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1001 ms. (steps per millisecond=999 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1022 ms. (steps per millisecond=978 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1032 ms. (steps per millisecond=968 ) properties (out of 3) seen :0
[2023-03-19 11:02:49] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:02:49] [INFO ] Computed 3 place invariants in 21 ms
[2023-03-19 11:02:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 11:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:02:50] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2023-03-19 11:02:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:02:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 11:02:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:02:50] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2023-03-19 11:02:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:02:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:02:56] [INFO ] [Nat]Added 147 Read/Feed constraints in 6062 ms returned unknown
[2023-03-19 11:02:56] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 11:02:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:02:57] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2023-03-19 11:02:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:02:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 11:02:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:02:57] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2023-03-19 11:03:01] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:03:02] [INFO ] [Nat]Added 147 Read/Feed constraints in 4193 ms returned sat
[2023-03-19 11:03:02] [INFO ] Deduced a trap composed of 120 places in 487 ms of which 1 ms to minimize.
[2023-03-19 11:03:03] [INFO ] Deduced a trap composed of 86 places in 528 ms of which 1 ms to minimize.
[2023-03-19 11:03:03] [INFO ] Deduced a trap composed of 201 places in 564 ms of which 1 ms to minimize.
[2023-03-19 11:03:04] [INFO ] Deduced a trap composed of 129 places in 503 ms of which 0 ms to minimize.
[2023-03-19 11:03:05] [INFO ] Deduced a trap composed of 129 places in 507 ms of which 0 ms to minimize.
[2023-03-19 11:03:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2945 ms
[2023-03-19 11:03:05] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 495 ms.
[2023-03-19 11:03:05] [INFO ] Added : 0 causal constraints over 0 iterations in 669 ms. Result :sat
Minimization took 2618 ms.
[2023-03-19 11:03:08] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 11:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:08] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-19 11:03:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:03:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 11:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:09] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2023-03-19 11:03:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:03:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 6036 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 315 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 231 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 11:03:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:03:16] [INFO ] Invariant cache hit.
[2023-03-19 11:03:16] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-19 11:03:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:03:16] [INFO ] Invariant cache hit.
[2023-03-19 11:03:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:03:19] [INFO ] Implicit Places using invariants and state equation in 2372 ms returned []
Implicit Place search using SMT with State Equation took 2897 ms to find 0 implicit places.
[2023-03-19 11:03:19] [INFO ] Redundant transitions in 941 ms returned []
[2023-03-19 11:03:19] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:03:19] [INFO ] Invariant cache hit.
[2023-03-19 11:03:22] [INFO ] Dead Transitions using invariants and state equation in 2236 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6318 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting property specific reduction for Szymanski-PT-b02-UpperBounds-00
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:03:22] [INFO ] Computed 3 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-19 11:03:22] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:03:22] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-19 11:03:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 11:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:22] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2023-03-19 11:03:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:03:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 11:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:23] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2023-03-19 11:03:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:03:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:03:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 4440 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:03:28] [INFO ] Computed 3 place invariants in 13 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 3036 ms. (steps per millisecond=329 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties (out of 1) seen :0
[2023-03-19 11:03:32] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:03:32] [INFO ] Computed 3 place invariants in 23 ms
[2023-03-19 11:03:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 11:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:32] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-19 11:03:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:03:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 11:03:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:33] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2023-03-19 11:03:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:03:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:03:39] [INFO ] [Nat]Added 147 Read/Feed constraints in 6043 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 11:03:39] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:03:39] [INFO ] Invariant cache hit.
[2023-03-19 11:03:40] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-19 11:03:40] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:03:40] [INFO ] Invariant cache hit.
[2023-03-19 11:03:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:03:42] [INFO ] Implicit Places using invariants and state equation in 2672 ms returned []
Implicit Place search using SMT with State Equation took 3161 ms to find 0 implicit places.
[2023-03-19 11:03:43] [INFO ] Redundant transitions in 848 ms returned []
[2023-03-19 11:03:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:03:43] [INFO ] Invariant cache hit.
[2023-03-19 11:03:45] [INFO ] Dead Transitions using invariants and state equation in 2096 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6291 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b02-UpperBounds-00 in 23527 ms.
Starting property specific reduction for Szymanski-PT-b02-UpperBounds-05
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:03:45] [INFO ] Computed 3 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2023-03-19 11:03:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:03:45] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-19 11:03:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 11:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:46] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-19 11:03:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:03:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 11:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:46] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-19 11:03:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:03:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:03:51] [INFO ] [Nat]Added 147 Read/Feed constraints in 4471 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 174 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:03:51] [INFO ] Computed 3 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2693 ms. (steps per millisecond=371 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1064 ms. (steps per millisecond=939 ) properties (out of 1) seen :0
[2023-03-19 11:03:55] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:03:55] [INFO ] Computed 3 place invariants in 17 ms
[2023-03-19 11:03:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 11:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:55] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2023-03-19 11:03:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:03:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 11:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:56] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-19 11:03:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:03:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:04:02] [INFO ] [Nat]Added 147 Read/Feed constraints in 6043 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 193 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 11:04:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:04:02] [INFO ] Invariant cache hit.
[2023-03-19 11:04:03] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-19 11:04:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:04:03] [INFO ] Invariant cache hit.
[2023-03-19 11:04:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:04:05] [INFO ] Implicit Places using invariants and state equation in 2421 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
[2023-03-19 11:04:06] [INFO ] Redundant transitions in 668 ms returned []
[2023-03-19 11:04:06] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:04:06] [INFO ] Invariant cache hit.
[2023-03-19 11:04:08] [INFO ] Dead Transitions using invariants and state equation in 2191 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5971 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b02-UpperBounds-05 in 22980 ms.
Starting property specific reduction for Szymanski-PT-b02-UpperBounds-07
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:04:08] [INFO ] Computed 3 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-19 11:04:08] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:04:08] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-19 11:04:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 11:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:04:09] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2023-03-19 11:04:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:04:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 11:04:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:04:09] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2023-03-19 11:04:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:04:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:04:14] [INFO ] [Nat]Added 147 Read/Feed constraints in 4445 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:04:14] [INFO ] Computed 3 place invariants in 22 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 3209 ms. (steps per millisecond=311 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1407 ms. (steps per millisecond=710 ) properties (out of 1) seen :0
[2023-03-19 11:04:19] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 11:04:19] [INFO ] Computed 3 place invariants in 19 ms
[2023-03-19 11:04:19] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 11:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:04:19] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2023-03-19 11:04:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:04:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 11:04:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:04:20] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2023-03-19 11:04:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:04:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 11:04:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 6039 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 193 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 11:04:26] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:04:26] [INFO ] Invariant cache hit.
[2023-03-19 11:04:27] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-19 11:04:27] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:04:27] [INFO ] Invariant cache hit.
[2023-03-19 11:04:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:04:29] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2637 ms to find 0 implicit places.
[2023-03-19 11:04:30] [INFO ] Redundant transitions in 670 ms returned []
[2023-03-19 11:04:30] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 11:04:30] [INFO ] Invariant cache hit.
[2023-03-19 11:04:32] [INFO ] Dead Transitions using invariants and state equation in 2228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5736 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b02-UpperBounds-07 in 23575 ms.
[2023-03-19 11:04:32] [INFO ] Flatten gal took : 437 ms
[2023-03-19 11:04:33] [INFO ] Applying decomposition
[2023-03-19 11:04:33] [INFO ] Flatten gal took : 222 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/graph744601502928415248.txt' '-o' '/tmp/graph744601502928415248.bin' '-w' '/tmp/graph744601502928415248.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph744601502928415248.bin' '-l' '-1' '-v' '-w' '/tmp/graph744601502928415248.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:04:33] [INFO ] Decomposing Gal with order
[2023-03-19 11:04:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:04:34] [INFO ] Removed a total of 17806 redundant transitions.
[2023-03-19 11:04:34] [INFO ] Flatten gal took : 787 ms
[2023-03-19 11:04:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1013 labels/synchronizations in 350 ms.
[2023-03-19 11:04:35] [INFO ] Time to serialize gal into /tmp/UpperBounds15124640165002098207.gal : 63 ms
[2023-03-19 11:04:35] [INFO ] Time to serialize properties into /tmp/UpperBounds17814106307830560268.prop : 1 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/UpperBounds15124640165002098207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17814106307830560268.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 ...285
Loading property file /tmp/UpperBounds17814106307830560268.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\_mod\_flat,249911,32.5846,792120,2640,1374,1.02334e+06,244651,8311,2.92933e+06,409,1.27343e+06,0
Total reachable state count : 249911

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Szymanski-PT-b02-UpperBounds-00 :0 <= i1.u1.p133 <= 1
FORMULA Szymanski-PT-b02-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Szymanski-PT-b02-UpperBounds-00,0,32.8523,792120,1,0,1.02334e+06,244651,8549,2.92933e+06,440,1.27343e+06,1983
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Szymanski-PT-b02-UpperBounds-05 :0 <= u49.p214 <= 1
FORMULA Szymanski-PT-b02-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Szymanski-PT-b02-UpperBounds-05,0,32.8548,792120,1,0,1.02334e+06,244651,8578,2.92933e+06,449,1.27343e+06,2082
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Szymanski-PT-b02-UpperBounds-07 :0 <= i6.u10.p157 <= 1
FORMULA Szymanski-PT-b02-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Szymanski-PT-b02-UpperBounds-07,0,32.8562,792120,1,0,1.02334e+06,244651,8608,2.92933e+06,449,1.27343e+06,2222
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 164117 ms.

BK_STOP 1679223909383

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="Szymanski-PT-b02"
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 Szymanski-PT-b02, 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 r485-tall-167912699400453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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