Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016200085.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016200085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 230K Apr 30 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 935K Apr 30 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 857K Apr 30 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 96K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 275K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 293K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 40K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 877K May 10 09:34 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 Peterson-PT-6-UpperBounds-00
FORMULA_NAME Peterson-PT-6-UpperBounds-01
FORMULA_NAME Peterson-PT-6-UpperBounds-02
FORMULA_NAME Peterson-PT-6-UpperBounds-03
FORMULA_NAME Peterson-PT-6-UpperBounds-04
FORMULA_NAME Peterson-PT-6-UpperBounds-05
FORMULA_NAME Peterson-PT-6-UpperBounds-06
FORMULA_NAME Peterson-PT-6-UpperBounds-07
FORMULA_NAME Peterson-PT-6-UpperBounds-08
FORMULA_NAME Peterson-PT-6-UpperBounds-09
FORMULA_NAME Peterson-PT-6-UpperBounds-10
FORMULA_NAME Peterson-PT-6-UpperBounds-11
FORMULA_NAME Peterson-PT-6-UpperBounds-12
FORMULA_NAME Peterson-PT-6-UpperBounds-13
FORMULA_NAME Peterson-PT-6-UpperBounds-14
FORMULA_NAME Peterson-PT-6-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652786140694

Running Version 202205111006
[2022-05-17 11:15:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 11:15:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 11:15:43] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2022-05-17 11:15:43] [INFO ] Transformed 1330 places.
[2022-05-17 11:15:43] [INFO ] Transformed 2030 transitions.
[2022-05-17 11:15:43] [INFO ] Found NUPN structural information;
[2022-05-17 11:15:43] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2022-05-17 11:15:43] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 272 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
FORMULA Peterson-PT-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1820 out of 2030 initially.
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:15:43] [INFO ] Computed 27 place invariants in 37 ms
FORMULA Peterson-PT-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 13) seen :37
FORMULA Peterson-PT-6-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :23
[2022-05-17 11:15:43] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 11:15:43] [INFO ] Computed 27 place invariants in 14 ms
[2022-05-17 11:15:44] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned unsat
[2022-05-17 11:15:44] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned unsat
[2022-05-17 11:15:44] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2022-05-17 11:15:44] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 20 ms returned sat
[2022-05-17 11:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:15:45] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2022-05-17 11:15:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:15:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2022-05-17 11:15:45] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 11:15:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:15:46] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2022-05-17 11:15:46] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:15:46] [INFO ] [Nat]Added 330 Read/Feed constraints in 464 ms returned sat
[2022-05-17 11:15:47] [INFO ] Deduced a trap composed of 99 places in 633 ms of which 5 ms to minimize.
[2022-05-17 11:15:47] [INFO ] Deduced a trap composed of 12 places in 598 ms of which 1 ms to minimize.
[2022-05-17 11:15:48] [INFO ] Deduced a trap composed of 12 places in 574 ms of which 2 ms to minimize.
[2022-05-17 11:15:49] [INFO ] Deduced a trap composed of 16 places in 609 ms of which 3 ms to minimize.
[2022-05-17 11:15:49] [INFO ] Deduced a trap composed of 203 places in 619 ms of which 1 ms to minimize.
[2022-05-17 11:15:50] [INFO ] Deduced a trap composed of 24 places in 592 ms of which 1 ms to minimize.
[2022-05-17 11:15:50] [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 2
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-17 11:15:50] [INFO ] [Real]Absence check using 20 positive place invariants in 36 ms returned unsat
[2022-05-17 11:15:51] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned unsat
[2022-05-17 11:15:51] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned unsat
[2022-05-17 11:15:51] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2022-05-17 11:15:51] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-17 11:15:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:15:52] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2022-05-17 11:15:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:15:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2022-05-17 11:15:52] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-17 11:15:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:15:52] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2022-05-17 11:15:52] [INFO ] [Nat]Added 330 Read/Feed constraints in 44 ms returned sat
[2022-05-17 11:15:53] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 119 ms.
[2022-05-17 11:15:53] [INFO ] Added : 27 causal constraints over 6 iterations in 790 ms. Result :sat
Minimization took 145 ms.
[2022-05-17 11:15:54] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2022-05-17 11:15:54] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-17 11:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:15:54] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2022-05-17 11:15:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:15:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2022-05-17 11:15:54] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 11:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:15:55] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2022-05-17 11:15:55] [INFO ] [Nat]Added 330 Read/Feed constraints in 60 ms returned sat
[2022-05-17 11:15:55] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 102 ms.
[2022-05-17 11:15:59] [INFO ] Added : 225 causal constraints over 45 iterations in 4138 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [7, 7, 294, 7, 7, 7, 1, 1] Max seen :[7, 7, 5, 7, 7, 7, 0, 0]
FORMULA Peterson-PT-6-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-6-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 294 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 1 with 504 rules applied. Total rules applied 756 place count 1078 transition count 1526
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 1008 place count 826 transition count 1526
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1008 place count 826 transition count 1442
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1176 place count 742 transition count 1442
Applied a total of 1176 rules in 206 ms. Remains 742 /1330 variables (removed 588) and now considering 1442/2030 (removed 588) transitions.
Finished structural reductions, in 1 iterations. Remains : 742/1330 places, 1442/2030 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 11:16:00] [INFO ] Computed 27 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4666 ms. (steps per millisecond=214 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3499 ms. (steps per millisecond=285 ) properties (out of 1) seen :2
[2022-05-17 11:16:08] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 11:16:08] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-17 11:16:08] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 11:16:08] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-17 11:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:16:09] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-05-17 11:16:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:16:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 11:16:09] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-17 11:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:16:09] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2022-05-17 11:16:09] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:16:09] [INFO ] [Nat]Added 330 Read/Feed constraints in 177 ms returned sat
[2022-05-17 11:16:10] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 1 ms to minimize.
[2022-05-17 11:16:10] [INFO ] Deduced a trap composed of 49 places in 263 ms of which 1 ms to minimize.
[2022-05-17 11:16:10] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 1 ms to minimize.
[2022-05-17 11:16:11] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 1 ms to minimize.
[2022-05-17 11:16:11] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 0 ms to minimize.
[2022-05-17 11:16:11] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 1 ms to minimize.
[2022-05-17 11:16:12] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 1 ms to minimize.
[2022-05-17 11:16:12] [INFO ] Deduced a trap composed of 76 places in 281 ms of which 1 ms to minimize.
[2022-05-17 11:16:12] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 1 ms to minimize.
[2022-05-17 11:16:13] [INFO ] Deduced a trap composed of 129 places in 272 ms of which 0 ms to minimize.
[2022-05-17 11:16:13] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 1 ms to minimize.
[2022-05-17 11:16:13] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 1 ms to minimize.
[2022-05-17 11:16:13] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 1 ms to minimize.
[2022-05-17 11:16:14] [INFO ] Deduced a trap composed of 58 places in 260 ms of which 1 ms to minimize.
[2022-05-17 11:16:14] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 1 ms to minimize.
[2022-05-17 11:16:14] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 1 ms to minimize.
[2022-05-17 11:16:15] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 0 ms to minimize.
[2022-05-17 11:16:15] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 0 ms to minimize.
[2022-05-17 11:16:15] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 1 ms to minimize.
[2022-05-17 11:16:16] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 1 ms to minimize.
[2022-05-17 11:16:16] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 1 ms to minimize.
[2022-05-17 11:16:16] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 2 ms to minimize.
[2022-05-17 11:16:17] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 0 ms to minimize.
[2022-05-17 11:16:17] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 0 ms to minimize.
[2022-05-17 11:16:17] [INFO ] Deduced a trap composed of 103 places in 238 ms of which 1 ms to minimize.
[2022-05-17 11:16:17] [INFO ] Deduced a trap composed of 78 places in 241 ms of which 0 ms to minimize.
[2022-05-17 11:16:18] [INFO ] Deduced a trap composed of 62 places in 238 ms of which 1 ms to minimize.
[2022-05-17 11:16:18] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 1 ms to minimize.
[2022-05-17 11:16:18] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 5 ms to minimize.
[2022-05-17 11:16:19] [INFO ] Deduced a trap composed of 111 places in 217 ms of which 0 ms to minimize.
[2022-05-17 11:16:19] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 1 ms to minimize.
[2022-05-17 11:16:19] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 0 ms to minimize.
[2022-05-17 11:16:19] [INFO ] Deduced a trap composed of 82 places in 216 ms of which 0 ms to minimize.
[2022-05-17 11:16:20] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 0 ms to minimize.
[2022-05-17 11:16:20] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 0 ms to minimize.
[2022-05-17 11:16:20] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 1 ms to minimize.
[2022-05-17 11:16:20] [INFO ] Deduced a trap composed of 78 places in 218 ms of which 0 ms to minimize.
[2022-05-17 11:16:21] [INFO ] Deduced a trap composed of 78 places in 232 ms of which 1 ms to minimize.
[2022-05-17 11:16:21] [INFO ] Deduced a trap composed of 124 places in 222 ms of which 1 ms to minimize.
[2022-05-17 11:16:21] [INFO ] Deduced a trap composed of 78 places in 224 ms of which 1 ms to minimize.
[2022-05-17 11:16:21] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 0 ms to minimize.
[2022-05-17 11:16:22] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 1 ms to minimize.
[2022-05-17 11:16:22] [INFO ] Deduced a trap composed of 62 places in 227 ms of which 1 ms to minimize.
[2022-05-17 11:16:22] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 0 ms to minimize.
[2022-05-17 11:16:23] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 1 ms to minimize.
[2022-05-17 11:16:23] [INFO ] Deduced a trap composed of 60 places in 167 ms of which 1 ms to minimize.
[2022-05-17 11:16:23] [INFO ] Deduced a trap composed of 70 places in 229 ms of which 1 ms to minimize.
[2022-05-17 11:16:24] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 1 ms to minimize.
[2022-05-17 11:16:24] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 1 ms to minimize.
[2022-05-17 11:16:24] [INFO ] Deduced a trap composed of 62 places in 201 ms of which 0 ms to minimize.
[2022-05-17 11:16:24] [INFO ] Deduced a trap composed of 62 places in 227 ms of which 12 ms to minimize.
[2022-05-17 11:16:25] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 1 ms to minimize.
[2022-05-17 11:16:25] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 1 ms to minimize.
[2022-05-17 11:16:25] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 0 ms to minimize.
[2022-05-17 11:16:25] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 15638 ms
[2022-05-17 11:16:25] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 70 ms.
[2022-05-17 11:16:32] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 0 ms to minimize.
[2022-05-17 11:16:33] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 1 ms to minimize.
[2022-05-17 11:16:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 489 ms
[2022-05-17 11:16:33] [INFO ] Added : 397 causal constraints over 81 iterations in 7737 ms. Result :sat
Minimization took 372 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 742 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 38 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 742/742 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 26 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 11:16:33] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 11:16:33] [INFO ] Computed 27 place invariants in 9 ms
[2022-05-17 11:16:34] [INFO ] Implicit Places using invariants in 379 ms returned [714, 715, 717, 734, 735, 736, 737]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 384 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 735/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 26 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 735/742 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:16:34] [INFO ] Computed 20 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4758 ms. (steps per millisecond=210 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3412 ms. (steps per millisecond=293 ) properties (out of 1) seen :1
[2022-05-17 11:16:42] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:16:42] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 11:16:42] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 11:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:16:42] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2022-05-17 11:16:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:16:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 11:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:16:43] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2022-05-17 11:16:43] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:16:43] [INFO ] [Nat]Added 330 Read/Feed constraints in 222 ms returned sat
[2022-05-17 11:16:43] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 0 ms to minimize.
[2022-05-17 11:16:44] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 1 ms to minimize.
[2022-05-17 11:16:44] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 1 ms to minimize.
[2022-05-17 11:16:44] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 3 ms to minimize.
[2022-05-17 11:16:45] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 3 ms to minimize.
[2022-05-17 11:16:45] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 9 ms to minimize.
[2022-05-17 11:16:45] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 1 ms to minimize.
[2022-05-17 11:16:46] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 1 ms to minimize.
[2022-05-17 11:16:46] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 1 ms to minimize.
[2022-05-17 11:16:46] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 0 ms to minimize.
[2022-05-17 11:16:46] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 0 ms to minimize.
[2022-05-17 11:16:47] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 1 ms to minimize.
[2022-05-17 11:16:47] [INFO ] Deduced a trap composed of 76 places in 241 ms of which 0 ms to minimize.
[2022-05-17 11:16:47] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 1 ms to minimize.
[2022-05-17 11:16:48] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 0 ms to minimize.
[2022-05-17 11:16:48] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 0 ms to minimize.
[2022-05-17 11:16:48] [INFO ] Deduced a trap composed of 91 places in 239 ms of which 1 ms to minimize.
[2022-05-17 11:16:48] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 0 ms to minimize.
[2022-05-17 11:16:49] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 1 ms to minimize.
[2022-05-17 11:16:49] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 1 ms to minimize.
[2022-05-17 11:16:49] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 1 ms to minimize.
[2022-05-17 11:16:49] [INFO ] Deduced a trap composed of 68 places in 219 ms of which 0 ms to minimize.
[2022-05-17 11:16:50] [INFO ] Deduced a trap composed of 60 places in 219 ms of which 0 ms to minimize.
[2022-05-17 11:16:50] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 0 ms to minimize.
[2022-05-17 11:16:50] [INFO ] Deduced a trap composed of 74 places in 232 ms of which 1 ms to minimize.
[2022-05-17 11:16:51] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 1 ms to minimize.
[2022-05-17 11:16:51] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 0 ms to minimize.
[2022-05-17 11:16:51] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 0 ms to minimize.
[2022-05-17 11:16:51] [INFO ] Deduced a trap composed of 91 places in 218 ms of which 1 ms to minimize.
[2022-05-17 11:16:52] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 0 ms to minimize.
[2022-05-17 11:16:52] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 1 ms to minimize.
[2022-05-17 11:16:52] [INFO ] Deduced a trap composed of 111 places in 214 ms of which 0 ms to minimize.
[2022-05-17 11:16:52] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 0 ms to minimize.
[2022-05-17 11:16:53] [INFO ] Deduced a trap composed of 92 places in 194 ms of which 1 ms to minimize.
[2022-05-17 11:16:53] [INFO ] Deduced a trap composed of 92 places in 183 ms of which 0 ms to minimize.
[2022-05-17 11:16:53] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 1 ms to minimize.
[2022-05-17 11:16:53] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 0 ms to minimize.
[2022-05-17 11:16:54] [INFO ] Deduced a trap composed of 112 places in 155 ms of which 1 ms to minimize.
[2022-05-17 11:16:54] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 0 ms to minimize.
[2022-05-17 11:16:54] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 0 ms to minimize.
[2022-05-17 11:16:54] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 0 ms to minimize.
[2022-05-17 11:16:54] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 11062 ms
[2022-05-17 11:16:54] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 54 ms.
[2022-05-17 11:17:00] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 0 ms to minimize.
[2022-05-17 11:17:00] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 0 ms to minimize.
[2022-05-17 11:17:00] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 1 ms to minimize.
[2022-05-17 11:17:01] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 0 ms to minimize.
[2022-05-17 11:17:01] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 1 ms to minimize.
[2022-05-17 11:17:02] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 0 ms to minimize.
[2022-05-17 11:17:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2128 ms
[2022-05-17 11:17:02] [INFO ] Added : 319 causal constraints over 65 iterations in 7862 ms. Result :sat
Minimization took 455 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 23 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 22 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 11:17:03] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:03] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 11:17:03] [INFO ] Implicit Places using invariants in 338 ms returned []
[2022-05-17 11:17:03] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:03] [INFO ] Computed 20 place invariants in 11 ms
[2022-05-17 11:17:04] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:17:06] [INFO ] Implicit Places using invariants and state equation in 2996 ms returned []
Implicit Place search using SMT with State Equation took 3337 ms to find 0 implicit places.
[2022-05-17 11:17:06] [INFO ] Redundant transitions in 95 ms returned []
[2022-05-17 11:17:06] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:06] [INFO ] Computed 20 place invariants in 10 ms
[2022-05-17 11:17:07] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting property specific reduction for Peterson-PT-6-UpperBounds-03
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:07] [INFO ] Computed 20 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :2
[2022-05-17 11:17:07] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:07] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 11:17:07] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 11:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:17:08] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2022-05-17 11:17:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:17:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2022-05-17 11:17:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:17:08] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2022-05-17 11:17:08] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:17:08] [INFO ] [Nat]Added 330 Read/Feed constraints in 147 ms returned sat
[2022-05-17 11:17:08] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 1 ms to minimize.
[2022-05-17 11:17:09] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 0 ms to minimize.
[2022-05-17 11:17:09] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 1 ms to minimize.
[2022-05-17 11:17:09] [INFO ] Deduced a trap composed of 63 places in 253 ms of which 0 ms to minimize.
[2022-05-17 11:17:10] [INFO ] Deduced a trap composed of 12 places in 267 ms of which 0 ms to minimize.
[2022-05-17 11:17:10] [INFO ] Deduced a trap composed of 48 places in 239 ms of which 0 ms to minimize.
[2022-05-17 11:17:10] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 1 ms to minimize.
[2022-05-17 11:17:11] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2022-05-17 11:17:11] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2022-05-17 11:17:11] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 1 ms to minimize.
[2022-05-17 11:17:11] [INFO ] Deduced a trap composed of 50 places in 253 ms of which 1 ms to minimize.
[2022-05-17 11:17:12] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 1 ms to minimize.
[2022-05-17 11:17:12] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 1 ms to minimize.
[2022-05-17 11:17:12] [INFO ] Deduced a trap composed of 86 places in 236 ms of which 1 ms to minimize.
[2022-05-17 11:17:13] [INFO ] Deduced a trap composed of 86 places in 230 ms of which 1 ms to minimize.
[2022-05-17 11:17:13] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 4441 ms
Current structural bounds on expressions (after SMT) : [294] Max seen :[4]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 27 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:13] [INFO ] Computed 20 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4879 ms. (steps per millisecond=204 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3395 ms. (steps per millisecond=294 ) properties (out of 1) seen :1
[2022-05-17 11:17:21] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:21] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-17 11:17:21] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 11:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:17:21] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2022-05-17 11:17:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:17:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 11:17:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:17:22] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2022-05-17 11:17:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:17:22] [INFO ] [Nat]Added 330 Read/Feed constraints in 211 ms returned sat
[2022-05-17 11:17:22] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 1 ms to minimize.
[2022-05-17 11:17:23] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 1 ms to minimize.
[2022-05-17 11:17:23] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 0 ms to minimize.
[2022-05-17 11:17:23] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2022-05-17 11:17:24] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 0 ms to minimize.
[2022-05-17 11:17:24] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 0 ms to minimize.
[2022-05-17 11:17:24] [INFO ] Deduced a trap composed of 18 places in 259 ms of which 0 ms to minimize.
[2022-05-17 11:17:24] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 1 ms to minimize.
[2022-05-17 11:17:25] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 0 ms to minimize.
[2022-05-17 11:17:25] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 1 ms to minimize.
[2022-05-17 11:17:25] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 0 ms to minimize.
[2022-05-17 11:17:26] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 1 ms to minimize.
[2022-05-17 11:17:26] [INFO ] Deduced a trap composed of 76 places in 233 ms of which 0 ms to minimize.
[2022-05-17 11:17:26] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 0 ms to minimize.
[2022-05-17 11:17:27] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 0 ms to minimize.
[2022-05-17 11:17:27] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 1 ms to minimize.
[2022-05-17 11:17:27] [INFO ] Deduced a trap composed of 91 places in 242 ms of which 1 ms to minimize.
[2022-05-17 11:17:27] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 1 ms to minimize.
[2022-05-17 11:17:28] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 1 ms to minimize.
[2022-05-17 11:17:28] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 0 ms to minimize.
[2022-05-17 11:17:28] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 1 ms to minimize.
[2022-05-17 11:17:28] [INFO ] Deduced a trap composed of 68 places in 218 ms of which 1 ms to minimize.
[2022-05-17 11:17:29] [INFO ] Deduced a trap composed of 60 places in 216 ms of which 0 ms to minimize.
[2022-05-17 11:17:29] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 1 ms to minimize.
[2022-05-17 11:17:29] [INFO ] Deduced a trap composed of 74 places in 227 ms of which 0 ms to minimize.
[2022-05-17 11:17:30] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 0 ms to minimize.
[2022-05-17 11:17:30] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 1 ms to minimize.
[2022-05-17 11:17:30] [INFO ] Deduced a trap composed of 48 places in 243 ms of which 0 ms to minimize.
[2022-05-17 11:17:30] [INFO ] Deduced a trap composed of 91 places in 222 ms of which 0 ms to minimize.
[2022-05-17 11:17:31] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 0 ms to minimize.
[2022-05-17 11:17:31] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 0 ms to minimize.
[2022-05-17 11:17:31] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 0 ms to minimize.
[2022-05-17 11:17:31] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 0 ms to minimize.
[2022-05-17 11:17:32] [INFO ] Deduced a trap composed of 92 places in 188 ms of which 1 ms to minimize.
[2022-05-17 11:17:32] [INFO ] Deduced a trap composed of 92 places in 189 ms of which 1 ms to minimize.
[2022-05-17 11:17:32] [INFO ] Deduced a trap composed of 60 places in 154 ms of which 1 ms to minimize.
[2022-05-17 11:17:32] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 1 ms to minimize.
[2022-05-17 11:17:33] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 0 ms to minimize.
[2022-05-17 11:17:33] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 1 ms to minimize.
[2022-05-17 11:17:33] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 1 ms to minimize.
[2022-05-17 11:17:33] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 0 ms to minimize.
[2022-05-17 11:17:33] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 11120 ms
[2022-05-17 11:17:33] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 70 ms.
[2022-05-17 11:17:39] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 0 ms to minimize.
[2022-05-17 11:17:39] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 1 ms to minimize.
[2022-05-17 11:17:39] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 1 ms to minimize.
[2022-05-17 11:17:40] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 0 ms to minimize.
[2022-05-17 11:17:40] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 0 ms to minimize.
[2022-05-17 11:17:41] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 0 ms to minimize.
[2022-05-17 11:17:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2069 ms
[2022-05-17 11:17:41] [INFO ] Added : 319 causal constraints over 65 iterations in 7700 ms. Result :sat
Minimization took 466 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 18 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 17 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 11:17:42] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:42] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-17 11:17:42] [INFO ] Implicit Places using invariants in 305 ms returned []
[2022-05-17 11:17:42] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:42] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 11:17:43] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:17:45] [INFO ] Implicit Places using invariants and state equation in 3078 ms returned []
Implicit Place search using SMT with State Equation took 3385 ms to find 0 implicit places.
[2022-05-17 11:17:45] [INFO ] Redundant transitions in 74 ms returned []
[2022-05-17 11:17:45] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:45] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 11:17:46] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:46] [INFO ] Computed 20 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4970 ms. (steps per millisecond=201 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3449 ms. (steps per millisecond=289 ) properties (out of 1) seen :2
[2022-05-17 11:17:54] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:17:54] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 11:17:55] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 11:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:17:55] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2022-05-17 11:17:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:17:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 11:17:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:17:55] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2022-05-17 11:17:55] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:17:55] [INFO ] [Nat]Added 330 Read/Feed constraints in 196 ms returned sat
[2022-05-17 11:17:56] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 0 ms to minimize.
[2022-05-17 11:17:56] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 1 ms to minimize.
[2022-05-17 11:17:56] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 1 ms to minimize.
[2022-05-17 11:17:57] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 0 ms to minimize.
[2022-05-17 11:17:57] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 1 ms to minimize.
[2022-05-17 11:17:57] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 1 ms to minimize.
[2022-05-17 11:17:58] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 0 ms to minimize.
[2022-05-17 11:17:58] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 1 ms to minimize.
[2022-05-17 11:17:58] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 1 ms to minimize.
[2022-05-17 11:17:58] [INFO ] Deduced a trap composed of 52 places in 251 ms of which 1 ms to minimize.
[2022-05-17 11:17:59] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 1 ms to minimize.
[2022-05-17 11:17:59] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 1 ms to minimize.
[2022-05-17 11:17:59] [INFO ] Deduced a trap composed of 76 places in 236 ms of which 0 ms to minimize.
[2022-05-17 11:18:00] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 0 ms to minimize.
[2022-05-17 11:18:00] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 1 ms to minimize.
[2022-05-17 11:18:00] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 1 ms to minimize.
[2022-05-17 11:18:00] [INFO ] Deduced a trap composed of 91 places in 252 ms of which 1 ms to minimize.
[2022-05-17 11:18:01] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 1 ms to minimize.
[2022-05-17 11:18:01] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 0 ms to minimize.
[2022-05-17 11:18:01] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 0 ms to minimize.
[2022-05-17 11:18:02] [INFO ] Deduced a trap composed of 55 places in 248 ms of which 0 ms to minimize.
[2022-05-17 11:18:02] [INFO ] Deduced a trap composed of 68 places in 241 ms of which 0 ms to minimize.
[2022-05-17 11:18:02] [INFO ] Deduced a trap composed of 60 places in 238 ms of which 0 ms to minimize.
[2022-05-17 11:18:02] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 1 ms to minimize.
[2022-05-17 11:18:03] [INFO ] Deduced a trap composed of 74 places in 248 ms of which 0 ms to minimize.
[2022-05-17 11:18:03] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 1 ms to minimize.
[2022-05-17 11:18:03] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 0 ms to minimize.
[2022-05-17 11:18:04] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 0 ms to minimize.
[2022-05-17 11:18:04] [INFO ] Deduced a trap composed of 91 places in 218 ms of which 1 ms to minimize.
[2022-05-17 11:18:04] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 1 ms to minimize.
[2022-05-17 11:18:04] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 1 ms to minimize.
[2022-05-17 11:18:05] [INFO ] Deduced a trap composed of 111 places in 215 ms of which 1 ms to minimize.
[2022-05-17 11:18:05] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 0 ms to minimize.
[2022-05-17 11:18:05] [INFO ] Deduced a trap composed of 92 places in 188 ms of which 1 ms to minimize.
[2022-05-17 11:18:05] [INFO ] Deduced a trap composed of 92 places in 186 ms of which 0 ms to minimize.
[2022-05-17 11:18:06] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 0 ms to minimize.
[2022-05-17 11:18:06] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 0 ms to minimize.
[2022-05-17 11:18:06] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 1 ms to minimize.
[2022-05-17 11:18:06] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 0 ms to minimize.
[2022-05-17 11:18:06] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 1 ms to minimize.
[2022-05-17 11:18:07] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 0 ms to minimize.
[2022-05-17 11:18:07] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 11246 ms
[2022-05-17 11:18:07] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 57 ms.
[2022-05-17 11:18:12] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 0 ms to minimize.
[2022-05-17 11:18:13] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 0 ms to minimize.
[2022-05-17 11:18:13] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 1 ms to minimize.
[2022-05-17 11:18:13] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 0 ms to minimize.
[2022-05-17 11:18:14] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 1 ms to minimize.
[2022-05-17 11:18:14] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 0 ms to minimize.
[2022-05-17 11:18:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2062 ms
[2022-05-17 11:18:14] [INFO ] Added : 319 causal constraints over 65 iterations in 7704 ms. Result :sat
Minimization took 458 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 16 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 21 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 11:18:15] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:18:15] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 11:18:16] [INFO ] Implicit Places using invariants in 346 ms returned []
[2022-05-17 11:18:16] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:18:16] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 11:18:16] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 11:18:19] [INFO ] Implicit Places using invariants and state equation in 2933 ms returned []
Implicit Place search using SMT with State Equation took 3282 ms to find 0 implicit places.
[2022-05-17 11:18:19] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-17 11:18:19] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 11:18:19] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 11:18:19] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Ending property specific reduction for Peterson-PT-6-UpperBounds-03 in 72215 ms.
[2022-05-17 11:18:20] [INFO ] Flatten gal took : 115 ms
[2022-05-17 11:18:20] [INFO ] Applying decomposition
[2022-05-17 11:18:20] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12611070772853665856.txt' '-o' '/tmp/graph12611070772853665856.bin' '-w' '/tmp/graph12611070772853665856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12611070772853665856.bin' '-l' '-1' '-v' '-w' '/tmp/graph12611070772853665856.weights' '-q' '0' '-e' '0.001'
[2022-05-17 11:18:20] [INFO ] Decomposing Gal with order
[2022-05-17 11:18:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:18:20] [INFO ] Removed a total of 2000 redundant transitions.
[2022-05-17 11:18:20] [INFO ] Flatten gal took : 146 ms
[2022-05-17 11:18:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 24 ms.
[2022-05-17 11:18:20] [INFO ] Time to serialize gal into /tmp/UpperBounds15529789222552868179.gal : 19 ms
[2022-05-17 11:18:20] [INFO ] Time to serialize properties into /tmp/UpperBounds10510946947800159810.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15529789222552868179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10510946947800159810.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/UpperBounds10510946947800159810.prop.
Detected timeout of ITS tools.
[2022-05-17 11:39:29] [INFO ] Applying decomposition
[2022-05-17 11:39:30] [INFO ] Flatten gal took : 365 ms
[2022-05-17 11:39:30] [INFO ] Decomposing Gal with order
[2022-05-17 11:39:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:39:31] [INFO ] Removed a total of 1380 redundant transitions.
[2022-05-17 11:39:31] [INFO ] Flatten gal took : 634 ms
[2022-05-17 11:39:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 126 ms.
[2022-05-17 11:39:31] [INFO ] Time to serialize gal into /tmp/UpperBounds5571445264521201047.gal : 32 ms
[2022-05-17 11:39:31] [INFO ] Time to serialize properties into /tmp/UpperBounds2256122544702369785.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5571445264521201047.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2256122544702369785.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds2256122544702369785.prop.
Detected timeout of ITS tools.
[2022-05-17 12:00:53] [INFO ] Flatten gal took : 520 ms
[2022-05-17 12:00:55] [INFO ] Input system was already deterministic with 1442 transitions.
[2022-05-17 12:00:55] [INFO ] Transformed 735 places.
[2022-05-17 12:00:55] [INFO ] Transformed 1442 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 12:00:56] [INFO ] Time to serialize gal into /tmp/UpperBounds17432192292114230376.gal : 25 ms
[2022-05-17 12:00:56] [INFO ] Time to serialize properties into /tmp/UpperBounds7064999018643933054.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17432192292114230376.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7064999018643933054.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7064999018643933054.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Peterson-PT-6"
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-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-6, 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 r168-tall-165277016200085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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