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-165277016200077.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-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016200077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 135K Apr 30 09:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 571K Apr 30 09:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 372K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 200K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 34K 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 535K 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-5-UpperBounds-00
FORMULA_NAME Peterson-PT-5-UpperBounds-01
FORMULA_NAME Peterson-PT-5-UpperBounds-02
FORMULA_NAME Peterson-PT-5-UpperBounds-03
FORMULA_NAME Peterson-PT-5-UpperBounds-04
FORMULA_NAME Peterson-PT-5-UpperBounds-05
FORMULA_NAME Peterson-PT-5-UpperBounds-06
FORMULA_NAME Peterson-PT-5-UpperBounds-07
FORMULA_NAME Peterson-PT-5-UpperBounds-08
FORMULA_NAME Peterson-PT-5-UpperBounds-09
FORMULA_NAME Peterson-PT-5-UpperBounds-10
FORMULA_NAME Peterson-PT-5-UpperBounds-11
FORMULA_NAME Peterson-PT-5-UpperBounds-12
FORMULA_NAME Peterson-PT-5-UpperBounds-13
FORMULA_NAME Peterson-PT-5-UpperBounds-14
FORMULA_NAME Peterson-PT-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652782531715

Running Version 202205111006
[2022-05-17 10:15:32] [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 10:15:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 10:15:33] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2022-05-17 10:15:33] [INFO ] Transformed 834 places.
[2022-05-17 10:15:33] [INFO ] Transformed 1242 transitions.
[2022-05-17 10:15:33] [INFO ] Found NUPN structural information;
[2022-05-17 10:15:33] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2022-05-17 10:15:33] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
FORMULA Peterson-PT-5-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1122 out of 1242 initially.
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:15:33] [INFO ] Computed 23 place invariants in 40 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :30
FORMULA Peterson-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :18
[2022-05-17 10:15:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:15:33] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 10:15:33] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2022-05-17 10:15:33] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 10:15:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:34] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-05-17 10:15:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:15:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2022-05-17 10:15:34] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:15:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:34] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2022-05-17 10:15:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:15:34] [INFO ] [Nat]Added 205 Read/Feed constraints in 92 ms returned sat
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 4 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 2 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 0 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 1 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 1 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1766 ms
[2022-05-17 10:15:36] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned unsat
[2022-05-17 10:15:36] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned unsat
[2022-05-17 10:15:36] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2022-05-17 10:15:36] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:15:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:37] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2022-05-17 10:15:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:15:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2022-05-17 10:15:37] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 10:15:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:37] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2022-05-17 10:15:37] [INFO ] [Nat]Added 205 Read/Feed constraints in 104 ms returned sat
[2022-05-17 10:15:38] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 1 ms to minimize.
[2022-05-17 10:15:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2022-05-17 10:15:38] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 54 ms.
[2022-05-17 10:15:41] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 1 ms to minimize.
[2022-05-17 10:15:42] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 1 ms to minimize.
[2022-05-17 10:15:42] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 1 ms to minimize.
[2022-05-17 10:15:42] [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 3
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.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
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 10:15:42] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-05-17 10:15:42] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 10:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:42] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2022-05-17 10:15:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:15:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2022-05-17 10:15:43] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-17 10:15:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:43] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2022-05-17 10:15:43] [INFO ] [Nat]Added 205 Read/Feed constraints in 97 ms returned sat
[2022-05-17 10:15:43] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 1 ms to minimize.
[2022-05-17 10:15:43] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2022-05-17 10:15:44] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2022-05-17 10:15:44] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 0 ms to minimize.
[2022-05-17 10:15:44] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2022-05-17 10:15:45] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2022-05-17 10:15:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1595 ms
[2022-05-17 10:15:45] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-05-17 10:15:45] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:15:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:45] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2022-05-17 10:15:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:15:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2022-05-17 10:15:45] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:15:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:45] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2022-05-17 10:15:46] [INFO ] [Nat]Added 205 Read/Feed constraints in 107 ms returned sat
[2022-05-17 10:15:46] [INFO ] Deduced a trap composed of 49 places in 260 ms of which 1 ms to minimize.
[2022-05-17 10:15:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2022-05-17 10:15:46] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 57 ms.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 1 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 0 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 2 places in 329 ms of which 0 ms to minimize.
[2022-05-17 10: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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
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 10:15:50] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-05-17 10:15:50] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:51] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2022-05-17 10:15:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:15:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2022-05-17 10:15:51] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:15:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:51] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2022-05-17 10:15:51] [INFO ] [Nat]Added 205 Read/Feed constraints in 23 ms returned sat
[2022-05-17 10:15:51] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 67 ms.
[2022-05-17 10:15:54] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 0 ms to minimize.
[2022-05-17 10:15:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2022-05-17 10:15:55] [INFO ] Added : 235 causal constraints over 48 iterations in 3421 ms. Result :sat
Minimization took 168 ms.
[2022-05-17 10:15:55] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-05-17 10:15:55] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:55] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2022-05-17 10:15:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:15:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2022-05-17 10:15:56] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:15:56] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2022-05-17 10:15:56] [INFO ] [Nat]Added 205 Read/Feed constraints in 26 ms returned sat
[2022-05-17 10:15:56] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 57 ms.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 63 places in 238 ms of which 1 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 1 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 660 ms
[2022-05-17 10:16:00] [INFO ] Added : 236 causal constraints over 48 iterations in 3622 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : [5, 6, 6, 180, 5, 180, 1, 1] Max seen :[5, 6, 6, 3, 5, 3, 0, 0]
FORMULA Peterson-PT-5-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 181 out of 834 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 834 transition count 1093
Reduce places removed 149 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 299 rules applied. Total rules applied 448 place count 685 transition count 943
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 598 place count 535 transition count 943
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 598 place count 535 transition count 883
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 718 place count 475 transition count 883
Applied a total of 718 rules in 106 ms. Remains 475 /834 variables (removed 359) and now considering 883/1242 (removed 359) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/834 places, 883/1242 transitions.
Normalized transition count is 763 out of 883 initially.
// Phase 1: matrix 763 rows 475 cols
[2022-05-17 10:16:00] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5041 ms. (steps per millisecond=198 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2512 ms. (steps per millisecond=398 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2501 ms. (steps per millisecond=399 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 935 ms. (steps per millisecond=1069 ) properties (out of 3) seen :10
[2022-05-17 10:16:11] [INFO ] Flow matrix only has 763 transitions (discarded 120 similar events)
// Phase 1: matrix 763 rows 475 cols
[2022-05-17 10:16:11] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 10:16:11] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 10:16:11] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:16:12] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-05-17 10:16:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:16:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 10:16:12] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:16:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:16:12] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2022-05-17 10:16:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:12] [INFO ] [Nat]Added 205 Read/Feed constraints in 76 ms returned sat
[2022-05-17 10:16:12] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2022-05-17 10:16:12] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 1 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 0 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 1 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 1 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 1 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 3 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 1 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 1 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 1 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 1 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 0 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 1 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 0 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 0 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 1 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 1 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 0 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 0 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 1 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5115 ms
[2022-05-17 10:16:17] [INFO ] Computed and/alt/rep : 697/1753/697 causal constraints (skipped 60 transitions) in 38 ms.
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 0 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 0 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 0 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 182 places in 150 ms of which 0 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 0 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 124 places in 147 ms of which 0 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 1 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 1 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 0 ms to minimize.
[2022-05-17 10:16:22] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 1 ms to minimize.
[2022-05-17 10:16:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2380 ms
[2022-05-17 10:16:22] [INFO ] Added : 229 causal constraints over 46 iterations in 4578 ms. Result :sat
Minimization took 229 ms.
[2022-05-17 10:16:22] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:16:22] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:16:22] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2022-05-17 10:16:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:16:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:16:22] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:16:23] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2022-05-17 10:16:23] [INFO ] [Nat]Added 205 Read/Feed constraints in 69 ms returned sat
[2022-05-17 10:16:23] [INFO ] Deduced a trap composed of 27 places in 309 ms of which 1 ms to minimize.
[2022-05-17 10:16:23] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 1 ms to minimize.
[2022-05-17 10:16:23] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 2 ms to minimize.
[2022-05-17 10:16:24] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 0 ms to minimize.
[2022-05-17 10:16:24] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 0 ms to minimize.
[2022-05-17 10:16:24] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2022-05-17 10:16:24] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2022-05-17 10:16:24] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2022-05-17 10:16:25] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2022-05-17 10:16:25] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 0 ms to minimize.
[2022-05-17 10:16:25] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2022-05-17 10:16:25] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 0 ms to minimize.
[2022-05-17 10:16:25] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 0 ms to minimize.
[2022-05-17 10:16:25] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2022-05-17 10:16:26] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 0 ms to minimize.
[2022-05-17 10:16:26] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 0 ms to minimize.
[2022-05-17 10:16:26] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2022-05-17 10:16:26] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 0 ms to minimize.
[2022-05-17 10:16:26] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 0 ms to minimize.
[2022-05-17 10:16:27] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 0 ms to minimize.
[2022-05-17 10:16:27] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 0 ms to minimize.
[2022-05-17 10:16:27] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2022-05-17 10:16:27] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 1 ms to minimize.
[2022-05-17 10:16:27] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 0 ms to minimize.
[2022-05-17 10:16:27] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 0 ms to minimize.
[2022-05-17 10:16:28] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 1 ms to minimize.
[2022-05-17 10:16:28] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 0 ms to minimize.
[2022-05-17 10:16:28] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:16:28] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5189 ms
[2022-05-17 10:16:28] [INFO ] Computed and/alt/rep : 697/1753/697 causal constraints (skipped 60 transitions) in 36 ms.
[2022-05-17 10:16:30] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2022-05-17 10:16:30] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
[2022-05-17 10:16:31] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 0 ms to minimize.
[2022-05-17 10:16:31] [INFO ] Deduced a trap composed of 182 places in 139 ms of which 1 ms to minimize.
[2022-05-17 10:16:31] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 1 ms to minimize.
[2022-05-17 10:16:31] [INFO ] Deduced a trap composed of 124 places in 137 ms of which 1 ms to minimize.
[2022-05-17 10:16:31] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 1 ms to minimize.
[2022-05-17 10:16:32] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2022-05-17 10:16:32] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 0 ms to minimize.
[2022-05-17 10:16:32] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 1 ms to minimize.
[2022-05-17 10:16:32] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 1 ms to minimize.
[2022-05-17 10:16:32] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 1 ms to minimize.
[2022-05-17 10:16:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2286 ms
[2022-05-17 10:16:32] [INFO ] Added : 229 causal constraints over 46 iterations in 4567 ms. Result :sat
Minimization took 241 ms.
[2022-05-17 10:16:33] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:16:33] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:16:33] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2022-05-17 10:16:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:16:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 10:16:33] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:16:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:16:33] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-05-17 10:16:33] [INFO ] [Nat]Added 205 Read/Feed constraints in 22 ms returned sat
[2022-05-17 10:16:33] [INFO ] Computed and/alt/rep : 697/1753/697 causal constraints (skipped 60 transitions) in 36 ms.
[2022-05-17 10:16:34] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2022-05-17 10:16:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 10:16:34] [INFO ] Added : 68 causal constraints over 14 iterations in 851 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [180, 180, 1] Max seen :[5, 5, 0]
Support contains 181 out of 475 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 883/883 transitions.
Applied a total of 0 rules in 26 ms. Remains 475 /475 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 883/883 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 883/883 transitions.
Applied a total of 0 rules in 20 ms. Remains 475 /475 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2022-05-17 10:16:34] [INFO ] Flow matrix only has 763 transitions (discarded 120 similar events)
// Phase 1: matrix 763 rows 475 cols
[2022-05-17 10:16:34] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 10:16:35] [INFO ] Implicit Places using invariants in 223 ms returned [439, 451, 452, 453, 454, 455]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 226 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 469/475 places, 883/883 transitions.
Applied a total of 0 rules in 17 ms. Remains 469 /469 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 469/475 places, 883/883 transitions.
Normalized transition count is 763 out of 883 initially.
// Phase 1: matrix 763 rows 469 cols
[2022-05-17 10:16:35] [INFO ] Computed 17 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4899 ms. (steps per millisecond=204 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2446 ms. (steps per millisecond=408 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2468 ms. (steps per millisecond=405 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties (out of 3) seen :10
[2022-05-17 10:16:45] [INFO ] Flow matrix only has 763 transitions (discarded 120 similar events)
// Phase 1: matrix 763 rows 469 cols
[2022-05-17 10:16:45] [INFO ] Computed 17 place invariants in 9 ms
[2022-05-17 10:16:45] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:16:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:16:46] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2022-05-17 10:16:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:16:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 10:16:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:16:46] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-05-17 10:16:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:46] [INFO ] [Nat]Added 205 Read/Feed constraints in 66 ms returned sat
[2022-05-17 10:16:46] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 0 ms to minimize.
[2022-05-17 10:16:46] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2022-05-17 10:16:46] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2022-05-17 10:16:47] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2022-05-17 10:16:47] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2022-05-17 10:16:47] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 0 ms to minimize.
[2022-05-17 10:16:47] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 1 ms to minimize.
[2022-05-17 10:16:47] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 0 ms to minimize.
[2022-05-17 10:16:48] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2022-05-17 10:16:48] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2022-05-17 10:16:48] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2022-05-17 10:16:48] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 1 ms to minimize.
[2022-05-17 10:16:48] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 1 ms to minimize.
[2022-05-17 10:16:49] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 0 ms to minimize.
[2022-05-17 10:16:49] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2022-05-17 10:16:49] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 0 ms to minimize.
[2022-05-17 10:16:49] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 1 ms to minimize.
[2022-05-17 10:16:49] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 0 ms to minimize.
[2022-05-17 10:16:49] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-05-17 10:16:50] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 0 ms to minimize.
[2022-05-17 10:16:50] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 1 ms to minimize.
[2022-05-17 10:16:50] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2022-05-17 10:16:50] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 0 ms to minimize.
[2022-05-17 10:16:50] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4048 ms
[2022-05-17 10:16:50] [INFO ] Computed and/alt/rep : 697/1753/697 causal constraints (skipped 60 transitions) in 47 ms.
[2022-05-17 10:16:52] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2022-05-17 10:16:52] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2022-05-17 10:16:53] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2022-05-17 10:16:53] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 0 ms to minimize.
[2022-05-17 10:16:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 714 ms
[2022-05-17 10:16:53] [INFO ] Added : 228 causal constraints over 46 iterations in 2939 ms. Result :sat
Minimization took 180 ms.
[2022-05-17 10:16:53] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:16:53] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-05-17 10:16:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:16:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 10:16:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:16:54] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2022-05-17 10:16:54] [INFO ] [Nat]Added 205 Read/Feed constraints in 63 ms returned sat
[2022-05-17 10:16:54] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 0 ms to minimize.
[2022-05-17 10:16:54] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2022-05-17 10:16:54] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2022-05-17 10:16:54] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2022-05-17 10:16:55] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 0 ms to minimize.
[2022-05-17 10:16:55] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 0 ms to minimize.
[2022-05-17 10:16:55] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 1 ms to minimize.
[2022-05-17 10:16:55] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2022-05-17 10:16:55] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2022-05-17 10:16:55] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2022-05-17 10:16:56] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2022-05-17 10:16:56] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 1 ms to minimize.
[2022-05-17 10:16:56] [INFO ] Deduced a trap composed of 68 places in 153 ms of which 0 ms to minimize.
[2022-05-17 10:16:56] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 0 ms to minimize.
[2022-05-17 10:16:56] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2022-05-17 10:16:56] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 0 ms to minimize.
[2022-05-17 10:16:57] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 1 ms to minimize.
[2022-05-17 10:16:57] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 0 ms to minimize.
[2022-05-17 10:16:57] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2022-05-17 10:16:57] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 0 ms to minimize.
[2022-05-17 10:16:57] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2022-05-17 10:16:57] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 1 ms to minimize.
[2022-05-17 10:16:58] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
[2022-05-17 10:16:58] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3873 ms
[2022-05-17 10:16:58] [INFO ] Computed and/alt/rep : 697/1753/697 causal constraints (skipped 60 transitions) in 36 ms.
[2022-05-17 10:17:00] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2022-05-17 10:17:00] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 0 ms to minimize.
[2022-05-17 10:17:00] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2022-05-17 10:17:00] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 0 ms to minimize.
[2022-05-17 10:17:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 710 ms
[2022-05-17 10:17:01] [INFO ] Added : 228 causal constraints over 46 iterations in 2903 ms. Result :sat
Minimization took 180 ms.
[2022-05-17 10:17:01] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:17:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:01] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-05-17 10:17:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:17:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:17:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:01] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-05-17 10:17:01] [INFO ] [Nat]Added 205 Read/Feed constraints in 22 ms returned sat
[2022-05-17 10:17:01] [INFO ] Computed and/alt/rep : 697/1753/697 causal constraints (skipped 60 transitions) in 35 ms.
[2022-05-17 10:17:02] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2022-05-17 10:17:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 10:17:02] [INFO ] Added : 68 causal constraints over 14 iterations in 784 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [180, 180, 1] Max seen :[5, 5, 0]
Support contains 181 out of 469 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 469/469 places, 883/883 transitions.
Applied a total of 0 rules in 16 ms. Remains 469 /469 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 469/469 places, 883/883 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 469/469 places, 883/883 transitions.
Applied a total of 0 rules in 14 ms. Remains 469 /469 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2022-05-17 10:17:02] [INFO ] Flow matrix only has 763 transitions (discarded 120 similar events)
// Phase 1: matrix 763 rows 469 cols
[2022-05-17 10:17:02] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 10:17:03] [INFO ] Implicit Places using invariants in 208 ms returned []
[2022-05-17 10:17:03] [INFO ] Flow matrix only has 763 transitions (discarded 120 similar events)
// Phase 1: matrix 763 rows 469 cols
[2022-05-17 10:17:03] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:17:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:04] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2022-05-17 10:17:04] [INFO ] Redundant transitions in 50 ms returned []
[2022-05-17 10:17:04] [INFO ] Flow matrix only has 763 transitions (discarded 120 similar events)
// Phase 1: matrix 763 rows 469 cols
[2022-05-17 10:17:04] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:17:04] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 469/469 places, 883/883 transitions.
Starting property specific reduction for Peterson-PT-5-UpperBounds-05
Normalized transition count is 763 out of 883 initially.
// Phase 1: matrix 763 rows 469 cols
[2022-05-17 10:17:04] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
[2022-05-17 10:17:04] [INFO ] Flow matrix only has 763 transitions (discarded 120 similar events)
// Phase 1: matrix 763 rows 469 cols
[2022-05-17 10:17:04] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:17:04] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 10:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:04] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2022-05-17 10:17:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:17:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:05] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2022-05-17 10:17:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:05] [INFO ] [Nat]Added 205 Read/Feed constraints in 52 ms returned sat
[2022-05-17 10:17:05] [INFO ] Deduced a trap composed of 109 places in 125 ms of which 0 ms to minimize.
[2022-05-17 10:17:05] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2022-05-17 10:17:05] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2022-05-17 10:17:05] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 1 ms to minimize.
[2022-05-17 10:17:06] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2022-05-17 10:17:06] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2022-05-17 10:17:06] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:17:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1061 ms
[2022-05-17 10:17:06] [INFO ] Computed and/alt/rep : 697/1753/697 causal constraints (skipped 60 transitions) in 37 ms.
[2022-05-17 10:17:07] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2022-05-17 10:17:07] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 0 ms to minimize.
[2022-05-17 10:17:07] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2022-05-17 10:17:07] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 0 ms to minimize.
[2022-05-17 10:17:08] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 0 ms to minimize.
[2022-05-17 10:17:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 962 ms
[2022-05-17 10:17:08] [INFO ] Added : 67 causal constraints over 15 iterations in 1872 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : [180] Max seen :[3]
Support contains 180 out of 469 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 469/469 places, 883/883 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 468 transition count 882
Applied a total of 2 rules in 19 ms. Remains 468 /469 variables (removed 1) and now considering 882/883 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/469 places, 882/883 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:08] [INFO ] Computed 17 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3193 ms. (steps per millisecond=313 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2223 ms. (steps per millisecond=449 ) properties (out of 1) seen :2
[2022-05-17 10:17:13] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:13] [INFO ] Computed 17 place invariants in 8 ms
[2022-05-17 10:17:14] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:17:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:14] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2022-05-17 10:17:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:17:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:17:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:14] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2022-05-17 10:17:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:14] [INFO ] [Nat]Added 205 Read/Feed constraints in 57 ms returned sat
[2022-05-17 10:17:14] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 1 ms to minimize.
[2022-05-17 10:17:14] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 0 ms to minimize.
[2022-05-17 10:17:15] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2022-05-17 10:17:15] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2022-05-17 10:17:15] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 0 ms to minimize.
[2022-05-17 10:17:15] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 1 ms to minimize.
[2022-05-17 10:17:15] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2022-05-17 10:17:15] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2022-05-17 10:17:16] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2022-05-17 10:17:16] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 1 ms to minimize.
[2022-05-17 10:17:16] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2022-05-17 10:17:16] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 1 ms to minimize.
[2022-05-17 10:17:16] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2022-05-17 10:17:16] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 0 ms to minimize.
[2022-05-17 10:17:17] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2022-05-17 10:17:17] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2022-05-17 10:17:17] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2800 ms
[2022-05-17 10:17:17] [INFO ] Computed and/alt/rep : 696/1752/696 causal constraints (skipped 60 transitions) in 35 ms.
[2022-05-17 10:17:18] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 0 ms to minimize.
[2022-05-17 10:17:18] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2022-05-17 10:17:18] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 0 ms to minimize.
[2022-05-17 10:17:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 520 ms
[2022-05-17 10:17:19] [INFO ] Added : 107 causal constraints over 23 iterations in 1683 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : [180] Max seen :[5]
Support contains 180 out of 468 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 12 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 13 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2022-05-17 10:17:19] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:19] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:17:19] [INFO ] Implicit Places using invariants in 183 ms returned []
[2022-05-17 10:17:19] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:19] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:17:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:20] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
[2022-05-17 10:17:20] [INFO ] Redundant transitions in 118 ms returned []
[2022-05-17 10:17:20] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:20] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:17:21] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:21] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3183 ms. (steps per millisecond=314 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2256 ms. (steps per millisecond=443 ) properties (out of 1) seen :1
[2022-05-17 10:17:26] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:26] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-17 10:17:26] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:26] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-05-17 10:17:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:17:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 21 ms returned sat
[2022-05-17 10:17:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:27] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-05-17 10:17:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:27] [INFO ] [Nat]Added 205 Read/Feed constraints in 58 ms returned sat
[2022-05-17 10:17:27] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 0 ms to minimize.
[2022-05-17 10:17:27] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
[2022-05-17 10:17:27] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 3 ms to minimize.
[2022-05-17 10:17:27] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2022-05-17 10:17:28] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 0 ms to minimize.
[2022-05-17 10:17:28] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 1 ms to minimize.
[2022-05-17 10:17:28] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2022-05-17 10:17:28] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2022-05-17 10:17:28] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2022-05-17 10:17:28] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 0 ms to minimize.
[2022-05-17 10:17:29] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2022-05-17 10:17:29] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 1 ms to minimize.
[2022-05-17 10:17:29] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2022-05-17 10:17:29] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 0 ms to minimize.
[2022-05-17 10:17:29] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 1 ms to minimize.
[2022-05-17 10:17:29] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2022-05-17 10:17:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2802 ms
[2022-05-17 10:17:30] [INFO ] Computed and/alt/rep : 696/1752/696 causal constraints (skipped 60 transitions) in 51 ms.
[2022-05-17 10:17:31] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 0 ms to minimize.
[2022-05-17 10:17:31] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 0 ms to minimize.
[2022-05-17 10:17:31] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 0 ms to minimize.
[2022-05-17 10:17:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 524 ms
[2022-05-17 10:17:31] [INFO ] Added : 107 causal constraints over 23 iterations in 1694 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : [180] Max seen :[5]
Support contains 180 out of 468 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 12 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 12 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2022-05-17 10:17:31] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:31] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:17:32] [INFO ] Implicit Places using invariants in 181 ms returned []
[2022-05-17 10:17:32] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:32] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:17:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:33] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
[2022-05-17 10:17:33] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-17 10:17:33] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:33] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:17:33] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:33] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3171 ms. (steps per millisecond=315 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2248 ms. (steps per millisecond=444 ) properties (out of 1) seen :4
[2022-05-17 10:17:39] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:39] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 10:17:39] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [6] Max seen :[6]
FORMULA Peterson-PT-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Peterson-PT-5-UpperBounds-05 in 34596 ms.
Starting property specific reduction for Peterson-PT-5-UpperBounds-07
Normalized transition count is 763 out of 883 initially.
// Phase 1: matrix 763 rows 469 cols
[2022-05-17 10:17:39] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :4
[2022-05-17 10:17:39] [INFO ] Flow matrix only has 763 transitions (discarded 120 similar events)
// Phase 1: matrix 763 rows 469 cols
[2022-05-17 10:17:39] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:17:39] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 10:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:39] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2022-05-17 10:17:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:17:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:39] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-05-17 10:17:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:39] [INFO ] [Nat]Added 205 Read/Feed constraints in 65 ms returned sat
[2022-05-17 10:17:40] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2022-05-17 10:17:40] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2022-05-17 10:17:40] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 0 ms to minimize.
[2022-05-17 10:17:40] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2022-05-17 10:17:40] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 1 ms to minimize.
[2022-05-17 10:17:40] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2022-05-17 10:17:41] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2022-05-17 10:17:41] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2022-05-17 10:17:41] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 0 ms to minimize.
[2022-05-17 10:17:41] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 1 ms to minimize.
[2022-05-17 10:17:41] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2022-05-17 10:17:41] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 1 ms to minimize.
[2022-05-17 10:17:41] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 0 ms to minimize.
[2022-05-17 10:17:42] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 0 ms to minimize.
[2022-05-17 10:17:42] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 0 ms to minimize.
[2022-05-17 10:17:42] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 1 ms to minimize.
[2022-05-17 10:17:42] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 0 ms to minimize.
[2022-05-17 10:17:42] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 0 ms to minimize.
[2022-05-17 10:17:42] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 0 ms to minimize.
[2022-05-17 10:17:43] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:17:43] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3226 ms
[2022-05-17 10:17:43] [INFO ] Computed and/alt/rep : 697/1753/697 causal constraints (skipped 60 transitions) in 34 ms.
[2022-05-17 10:17:44] [INFO ] Added : 105 causal constraints over 21 iterations in 1119 ms. Result :sat
Minimization took 259 ms.
Current structural bounds on expressions (after SMT) : [180] Max seen :[4]
Support contains 180 out of 469 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 469/469 places, 883/883 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 468 transition count 882
Applied a total of 2 rules in 15 ms. Remains 468 /469 variables (removed 1) and now considering 882/883 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/469 places, 882/883 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:44] [INFO ] Computed 17 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3161 ms. (steps per millisecond=316 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2180 ms. (steps per millisecond=458 ) properties (out of 1) seen :3
[2022-05-17 10:17:50] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2022-05-17 10:17:50] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 10:17:50] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [6] Max seen :[6]
FORMULA Peterson-PT-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Peterson-PT-5-UpperBounds-07 in 10961 ms.
Starting property specific reduction for Peterson-PT-5-UpperBounds-09
Normalized transition count is 763 out of 883 initially.
// Phase 1: matrix 763 rows 469 cols
[2022-05-17 10:17:50] [INFO ] Computed 17 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2022-05-17 10:17:50] [INFO ] Flow matrix only has 763 transitions (discarded 120 similar events)
// Phase 1: matrix 763 rows 469 cols
[2022-05-17 10:17:50] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:17:50] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 10:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:50] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-05-17 10:17:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:17:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:17:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:50] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-17 10:17:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:50] [INFO ] [Nat]Added 205 Read/Feed constraints in 19 ms returned sat
[2022-05-17 10:17:50] [INFO ] Computed and/alt/rep : 697/1753/697 causal constraints (skipped 60 transitions) in 45 ms.
[2022-05-17 10:17:51] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2022-05-17 10:17:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2022-05-17 10:17:51] [INFO ] Added : 68 causal constraints over 14 iterations in 791 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 469 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 469/469 places, 881/881 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 468 transition count 825
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 413 transition count 825
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 111 place count 413 transition count 700
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 361 place count 288 transition count 700
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 419 place count 259 transition count 671
Applied a total of 419 rules in 35 ms. Remains 259 /469 variables (removed 210) and now considering 671/881 (removed 210) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/469 places, 671/881 transitions.
Normalized transition count is 551 out of 671 initially.
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 10:17:51] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1380 ms. (steps per millisecond=724 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=2227 ) properties (out of 1) seen :0
[2022-05-17 10:17:53] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 10:17:53] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:17:53] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 10:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:53] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-05-17 10:17:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:17:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 10:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:17:53] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-17 10:17:53] [INFO ] State equation strengthened by 204 read => feed constraints.
[2022-05-17 10:17:53] [INFO ] [Nat]Added 204 Read/Feed constraints in 16 ms returned sat
[2022-05-17 10:17:53] [INFO ] Computed and/alt/rep : 485/1534/485 causal constraints (skipped 60 transitions) in 27 ms.
[2022-05-17 10:17:54] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:17:54] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:17:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2022-05-17 10:17:54] [INFO ] Added : 36 causal constraints over 8 iterations in 541 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 14 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 671/671 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 10 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2022-05-17 10:17:54] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 10:17:54] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:17:54] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-17 10:17:54] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 10:17:54] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:17:54] [INFO ] State equation strengthened by 204 read => feed constraints.
[2022-05-17 10:17:55] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2022-05-17 10:17:55] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 10:17:55] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 10:17:55] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:17:55] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 671/671 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-09 in 5428 ms.
[2022-05-17 10:17:55] [INFO ] Flatten gal took : 119 ms
[2022-05-17 10:17:55] [INFO ] Applying decomposition
[2022-05-17 10:17:55] [INFO ] Flatten gal took : 45 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/graph10731831031743444718.txt' '-o' '/tmp/graph10731831031743444718.bin' '-w' '/tmp/graph10731831031743444718.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10731831031743444718.bin' '-l' '-1' '-v' '-w' '/tmp/graph10731831031743444718.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:17:56] [INFO ] Decomposing Gal with order
[2022-05-17 10:17:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:17:56] [INFO ] Removed a total of 1156 redundant transitions.
[2022-05-17 10:17:56] [INFO ] Flatten gal took : 110 ms
[2022-05-17 10:17:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 23 ms.
[2022-05-17 10:17:56] [INFO ] Time to serialize gal into /tmp/UpperBounds3218363454221167616.gal : 16 ms
[2022-05-17 10:17:56] [INFO ] Time to serialize properties into /tmp/UpperBounds2854053400462924697.prop : 0 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/UpperBounds3218363454221167616.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2854053400462924697.prop' '--nowitness'

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...274
Loading property file /tmp/UpperBounds2854053400462924697.prop.
Detected timeout of ITS tools.
[2022-05-17 10:38:43] [INFO ] Applying decomposition
[2022-05-17 10:38:43] [INFO ] Flatten gal took : 30 ms
[2022-05-17 10:38:43] [INFO ] Decomposing Gal with order
[2022-05-17 10:38:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:38:44] [INFO ] Removed a total of 771 redundant transitions.
[2022-05-17 10:38:44] [INFO ] Flatten gal took : 90 ms
[2022-05-17 10:38:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 14 ms.
[2022-05-17 10:38:44] [INFO ] Time to serialize gal into /tmp/UpperBounds13705789130721402156.gal : 6 ms
[2022-05-17 10:38:44] [INFO ] Time to serialize properties into /tmp/UpperBounds4835726102298671402.prop : 86 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/UpperBounds13705789130721402156.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4835726102298671402.prop' '--nowitness'

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...275
Loading property file /tmp/UpperBounds4835726102298671402.prop.
Detected timeout of ITS tools.
[2022-05-17 10:59:31] [INFO ] Flatten gal took : 27 ms
[2022-05-17 10:59:31] [INFO ] Input system was already deterministic with 883 transitions.
[2022-05-17 10:59:31] [INFO ] Transformed 469 places.
[2022-05-17 10:59:31] [INFO ] Transformed 883 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 10:59:31] [INFO ] Time to serialize gal into /tmp/UpperBounds8042378527063585622.gal : 4 ms
[2022-05-17 10:59:31] [INFO ] Time to serialize properties into /tmp/UpperBounds6780681151436501887.prop : 0 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/UpperBounds8042378527063585622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6780681151436501887.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...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6780681151436501887.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-5"
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-5, 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-165277016200077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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