Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636279900101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is EisenbergMcGuire-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636279900101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K May 18 16:42 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 EisenbergMcGuire-PT-05-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716538743344

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 08:19:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 08:19:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:19:06] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-05-24 08:19:06] [INFO ] Transformed 295 places.
[2024-05-24 08:19:06] [INFO ] Transformed 800 transitions.
[2024-05-24 08:19:06] [INFO ] Found NUPN structural information;
[2024-05-24 08:19:06] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 339 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
FORMULA EisenbergMcGuire-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 465 out of 800 initially.
// Phase 1: matrix 465 rows 295 cols
[2024-05-24 08:19:06] [INFO ] Computed 16 invariants in 34 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :11
FORMULA EisenbergMcGuire-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-00 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
[2024-05-24 08:19:06] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2024-05-24 08:19:06] [INFO ] Computed 16 invariants in 6 ms
[2024-05-24 08:19:07] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-05-24 08:19:07] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 10 ms returned sat
[2024-05-24 08:19:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:07] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2024-05-24 08:19:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:19:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-24 08:19:07] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:07] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-05-24 08:19:07] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-24 08:19:07] [INFO ] [Nat]Added 196 Read/Feed constraints in 65 ms returned sat
[2024-05-24 08:19:08] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 5 ms to minimize.
[2024-05-24 08:19:08] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 1 ms to minimize.
[2024-05-24 08:19:08] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 2 ms to minimize.
[2024-05-24 08:19:08] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-05-24 08:19:09] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 1 ms to minimize.
[2024-05-24 08:19:09] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 1 ms to minimize.
[2024-05-24 08:19:09] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 1 ms to minimize.
[2024-05-24 08:19:09] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 0 ms to minimize.
[2024-05-24 08:19:09] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-05-24 08:19:09] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-05-24 08:19:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1904 ms
[2024-05-24 08:19:09] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 56 ms.
[2024-05-24 08:19:12] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2024-05-24 08:19:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-24 08:19:12] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-24 08:19:12] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:12] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-24 08:19:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:19:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-05-24 08:19:13] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 8 ms returned sat
[2024-05-24 08:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:13] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-24 08:19:13] [INFO ] [Nat]Added 196 Read/Feed constraints in 31 ms returned sat
[2024-05-24 08:19:13] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 61 ms.
[2024-05-24 08:19:15] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 0 ms to minimize.
[2024-05-24 08:19:15] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2024-05-24 08:19:15] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 0 ms to minimize.
[2024-05-24 08:19:15] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 0 ms to minimize.
[2024-05-24 08:19:15] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:19:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 780 ms
[2024-05-24 08:19:16] [INFO ] Added : 227 causal constraints over 46 iterations in 2799 ms. Result :sat
Minimization took 263 ms.
[2024-05-24 08:19:16] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-24 08:19:16] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:16] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-24 08:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:19:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-24 08:19:16] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:16] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-24 08:19:16] [INFO ] [Nat]Added 196 Read/Feed constraints in 27 ms returned sat
[2024-05-24 08:19:17] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2024-05-24 08:19:17] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2024-05-24 08:19:17] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 0 ms to minimize.
[2024-05-24 08:19:17] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2024-05-24 08:19:17] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 0 ms to minimize.
[2024-05-24 08:19:17] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-05-24 08:19:17] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-24 08:19:17] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-24 08:19:17] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2024-05-24 08:19:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1091 ms
[2024-05-24 08:19:18] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 43 ms.
[2024-05-24 08:19:19] [INFO ] Added : 225 causal constraints over 45 iterations in 1938 ms. Result :sat
Minimization took 198 ms.
[2024-05-24 08:19:20] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-24 08:19:20] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 10 ms returned sat
[2024-05-24 08:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:20] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-24 08:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:19:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-24 08:19:20] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:20] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-24 08:19:20] [INFO ] [Nat]Added 196 Read/Feed constraints in 34 ms returned sat
[2024-05-24 08:19:20] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2024-05-24 08:19:21] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2024-05-24 08:19:21] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 0 ms to minimize.
[2024-05-24 08:19:21] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2024-05-24 08:19:21] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2024-05-24 08:19:21] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-05-24 08:19:21] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 1 ms to minimize.
[2024-05-24 08:19:21] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2024-05-24 08:19:22] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:19:22] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 3 ms to minimize.
[2024-05-24 08:19:22] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2024-05-24 08:19:22] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-05-24 08:19:22] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
[2024-05-24 08:19:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1742 ms
[2024-05-24 08:19:22] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 51 ms.
[2024-05-24 08:19:25] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 0 ms to minimize.
[2024-05-24 08:19:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-05-24 08:19:25] [INFO ] Added : 279 causal constraints over 56 iterations in 2805 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 290 transition count 717
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 212 transition count 717
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 186 place count 192 transition count 617
Iterating global reduction 2 with 20 rules applied. Total rules applied 206 place count 192 transition count 617
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 246 place count 172 transition count 597
Applied a total of 246 rules in 170 ms. Remains 172 /295 variables (removed 123) and now considering 597/800 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 172/295 places, 597/800 transitions.
Normalized transition count is 262 out of 597 initially.
// Phase 1: matrix 262 rows 172 cols
[2024-05-24 08:19:25] [INFO ] Computed 16 invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1452 ms. (steps per millisecond=688 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=2188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 4) seen :0
[2024-05-24 08:19:29] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2024-05-24 08:19:29] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:19:29] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:19:29] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 08:19:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:29] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-24 08:19:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:19:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:19:29] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:19:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:29] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-24 08:19:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:19:29] [INFO ] [Nat]Added 116 Read/Feed constraints in 21 ms returned sat
[2024-05-24 08:19:29] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:19:29] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:19:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2024-05-24 08:19:29] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 23 ms.
[2024-05-24 08:19:29] [INFO ] Added : 19 causal constraints over 4 iterations in 121 ms. Result :sat
Minimization took 42 ms.
[2024-05-24 08:19:29] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-24 08:19:29] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:19:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:29] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-24 08:19:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:19:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:19:29] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:19:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:29] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-24 08:19:29] [INFO ] [Nat]Added 116 Read/Feed constraints in 18 ms returned sat
[2024-05-24 08:19:30] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:19:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-24 08:19:30] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 23 ms.
[2024-05-24 08:19:30] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 0 ms to minimize.
[2024-05-24 08:19:30] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:19:30] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 0 ms to minimize.
[2024-05-24 08:19:30] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 0 ms to minimize.
[2024-05-24 08:19:31] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 1 ms to minimize.
[2024-05-24 08:19:31] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-24 08:19:31] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2024-05-24 08:19:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 832 ms
[2024-05-24 08:19:31] [INFO ] Added : 103 causal constraints over 22 iterations in 1386 ms. Result :sat
Minimization took 80 ms.
[2024-05-24 08:19:31] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-24 08:19:31] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:19:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:31] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-24 08:19:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:19:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-24 08:19:31] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 08:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:31] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-24 08:19:31] [INFO ] [Nat]Added 116 Read/Feed constraints in 19 ms returned sat
[2024-05-24 08:19:31] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 25 ms.
[2024-05-24 08:19:32] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2024-05-24 08:19:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-24 08:19:32] [INFO ] Added : 59 causal constraints over 12 iterations in 437 ms. Result :sat
Minimization took 53 ms.
[2024-05-24 08:19:32] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-24 08:19:32] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:19:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:32] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-24 08:19:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:19:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-24 08:19:32] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:19:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:32] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-24 08:19:32] [INFO ] [Nat]Added 116 Read/Feed constraints in 19 ms returned sat
[2024-05-24 08:19:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-24 08:19:32] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-24 08:19:32] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-24 08:19:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 145 ms
[2024-05-24 08:19:32] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 26 ms.
[2024-05-24 08:19:33] [INFO ] Added : 53 causal constraints over 11 iterations in 262 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 172 transition count 596
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 171 transition count 596
Applied a total of 2 rules in 32 ms. Remains 171 /172 variables (removed 1) and now considering 596/597 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 171/172 places, 596/597 transitions.
Normalized transition count is 261 out of 596 initially.
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:19:33] [INFO ] Computed 16 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1336 ms. (steps per millisecond=748 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=2421 ) properties (out of 1) seen :0
[2024-05-24 08:19:35] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:19:35] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:19:35] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-24 08:19:35] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:35] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-24 08:19:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:19:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:19:35] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:19:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:35] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-24 08:19:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:19:35] [INFO ] [Nat]Added 116 Read/Feed constraints in 25 ms returned sat
[2024-05-24 08:19:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-24 08:19:35] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:19:35] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
[2024-05-24 08:19:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
[2024-05-24 08:19:35] [INFO ] Computed and/alt/rep : 262/886/202 causal constraints (skipped 54 transitions) in 21 ms.
[2024-05-24 08:19:35] [INFO ] Added : 44 causal constraints over 9 iterations in 214 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 33 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 171/171 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 21 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-24 08:19:36] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:19:36] [INFO ] Invariant cache hit.
[2024-05-24 08:19:36] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-24 08:19:36] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:19:36] [INFO ] Invariant cache hit.
[2024-05-24 08:19:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:19:36] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2024-05-24 08:19:36] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-24 08:19:36] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:19:36] [INFO ] Invariant cache hit.
[2024-05-24 08:19:37] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1386 ms. Remains : 171/171 places, 596/596 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-15
Normalized transition count is 261 out of 596 initially.
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:19:37] [INFO ] Computed 16 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2024-05-24 08:19:37] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:19:37] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:19:37] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:19:37] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:19:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:37] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-24 08:19:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:19:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-24 08:19:37] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:19:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:37] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-24 08:19:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:19:37] [INFO ] [Nat]Added 116 Read/Feed constraints in 18 ms returned sat
[2024-05-24 08:19:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-24 08:19:37] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2024-05-24 08:19:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:19:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2024-05-24 08:19:37] [INFO ] Computed and/alt/rep : 262/886/202 causal constraints (skipped 54 transitions) in 22 ms.
[2024-05-24 08:19:38] [INFO ] Added : 44 causal constraints over 9 iterations in 207 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 17 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 171/171 places, 596/596 transitions.
Normalized transition count is 261 out of 596 initially.
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:19:38] [INFO ] Computed 16 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1343 ms. (steps per millisecond=744 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 1) seen :0
[2024-05-24 08:19:40] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 08:19:40] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 08:19:40] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 08:19:40] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 08:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:40] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-24 08:19:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:19:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-24 08:19:40] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 08:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:19:40] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-24 08:19:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:19:40] [INFO ] [Nat]Added 116 Read/Feed constraints in 18 ms returned sat
[2024-05-24 08:19:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-24 08:19:40] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2024-05-24 08:19:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-24 08:19:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 150 ms
[2024-05-24 08:19:40] [INFO ] Computed and/alt/rep : 262/886/202 causal constraints (skipped 54 transitions) in 20 ms.
[2024-05-24 08:19:40] [INFO ] Added : 44 causal constraints over 9 iterations in 206 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 17 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 171/171 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 16 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-24 08:19:40] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:19:40] [INFO ] Invariant cache hit.
[2024-05-24 08:19:41] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-24 08:19:41] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:19:41] [INFO ] Invariant cache hit.
[2024-05-24 08:19:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 08:19:41] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2024-05-24 08:19:41] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 08:19:41] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 08:19:41] [INFO ] Invariant cache hit.
[2024-05-24 08:19:42] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1265 ms. Remains : 171/171 places, 596/596 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-15 in 4686 ms.
[2024-05-24 08:19:42] [INFO ] Flatten gal took : 132 ms
[2024-05-24 08:19:42] [INFO ] Applying decomposition
[2024-05-24 08:19:42] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12722295016853692082.txt' '-o' '/tmp/graph12722295016853692082.bin' '-w' '/tmp/graph12722295016853692082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12722295016853692082.bin' '-l' '-1' '-v' '-w' '/tmp/graph12722295016853692082.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:19:42] [INFO ] Decomposing Gal with order
[2024-05-24 08:19:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:19:43] [INFO ] Removed a total of 998 redundant transitions.
[2024-05-24 08:19:43] [INFO ] Flatten gal took : 233 ms
[2024-05-24 08:19:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 31 ms.
[2024-05-24 08:19:43] [INFO ] Time to serialize gal into /tmp/UpperBounds8643119661106167364.gal : 14 ms
[2024-05-24 08:19:43] [INFO ] Time to serialize properties into /tmp/UpperBounds15674722355359908191.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8643119661106167364.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15674722355359908191.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds15674722355359908191.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.26109e+06,149.447,2163028,24848,3161,3.06283e+06,39814,1275,5.80592e+06,268,539090,0
Total reachable state count : 4261091

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property EisenbergMcGuire-PT-05-UpperBounds-15 :0 <= i10.u11.p33_0_0 <= 1
FORMULA EisenbergMcGuire-PT-05-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-05-UpperBounds-15,0,152.139,2163028,1,0,3.06283e+06,39814,1480,5.80592e+06,293,539090,3803
Total runtime 189588 ms.

BK_STOP 1716538936553

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is EisenbergMcGuire-PT-05, 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 r175-smll-171636279900101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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