About the Execution of Smart+red for DES-PT-30b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15397.972 | 3600000.00 | 3644022.00 | 10460.00 | 1 1 1 1 ? 1 1 ? 1 1 1 1 1 1 ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r107-tall-167814484200453.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is DES-PT-30b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484200453
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 103K Mar 5 18:22 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 DES-PT-30b-UpperBounds-00
FORMULA_NAME DES-PT-30b-UpperBounds-01
FORMULA_NAME DES-PT-30b-UpperBounds-02
FORMULA_NAME DES-PT-30b-UpperBounds-03
FORMULA_NAME DES-PT-30b-UpperBounds-04
FORMULA_NAME DES-PT-30b-UpperBounds-05
FORMULA_NAME DES-PT-30b-UpperBounds-06
FORMULA_NAME DES-PT-30b-UpperBounds-07
FORMULA_NAME DES-PT-30b-UpperBounds-08
FORMULA_NAME DES-PT-30b-UpperBounds-09
FORMULA_NAME DES-PT-30b-UpperBounds-10
FORMULA_NAME DES-PT-30b-UpperBounds-11
FORMULA_NAME DES-PT-30b-UpperBounds-12
FORMULA_NAME DES-PT-30b-UpperBounds-13
FORMULA_NAME DES-PT-30b-UpperBounds-14
FORMULA_NAME DES-PT-30b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678372517118
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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 14:35:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 14:35:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:35:18] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-09 14:35:18] [INFO ] Transformed 399 places.
[2023-03-09 14:35:18] [INFO ] Transformed 350 transitions.
[2023-03-09 14:35:18] [INFO ] Found NUPN structural information;
[2023-03-09 14:35:18] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 350 rows 399 cols
[2023-03-09 14:35:18] [INFO ] Computed 65 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 85 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :12
FORMULA DES-PT-30b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 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 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
[2023-03-09 14:35:19] [INFO ] Invariant cache hit.
[2023-03-09 14:35:19] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-09 14:35:19] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-09 14:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:19] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-09 14:35:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:19] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-09 14:35:19] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2023-03-09 14:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:19] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2023-03-09 14:35:20] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 3 ms to minimize.
[2023-03-09 14:35:20] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2023-03-09 14:35:20] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 1 ms to minimize.
[2023-03-09 14:35:20] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2023-03-09 14:35:20] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2023-03-09 14:35:20] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2023-03-09 14:35:20] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2023-03-09 14:35:20] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-03-09 14:35:20] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 0 ms to minimize.
[2023-03-09 14:35:21] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2023-03-09 14:35:21] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2023-03-09 14:35:21] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2023-03-09 14:35:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1373 ms
[2023-03-09 14:35:21] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 42 ms.
[2023-03-09 14:35:23] [INFO ] Added : 311 causal constraints over 63 iterations in 2331 ms. Result :sat
Minimization took 225 ms.
[2023-03-09 14:35:23] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 14:35:23] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-09 14:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:24] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-09 14:35:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 14:35:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 30 ms returned sat
[2023-03-09 14:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:24] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-09 14:35:24] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2023-03-09 14:35:24] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 0 ms to minimize.
[2023-03-09 14:35:24] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-03-09 14:35:25] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2023-03-09 14:35:25] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-09 14:35:25] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2023-03-09 14:35:25] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2023-03-09 14:35:25] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 3 ms to minimize.
[2023-03-09 14:35:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1116 ms
[2023-03-09 14:35:25] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 24 ms.
[2023-03-09 14:35:27] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2023-03-09 14:35:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-09 14:35:28] [INFO ] Added : 327 causal constraints over 66 iterations in 2577 ms. Result :sat
Minimization took 306 ms.
[2023-03-09 14:35:28] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 14:35:28] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-09 14:35:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:28] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-03-09 14:35:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 14:35:28] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-09 14:35:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:28] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-09 14:35:28] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-09 14:35:28] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2023-03-09 14:35:29] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2023-03-09 14:35:29] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2023-03-09 14:35:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 319 ms
[2023-03-09 14:35:29] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 17 ms.
[2023-03-09 14:35:31] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2023-03-09 14:35:31] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2023-03-09 14:35:31] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2023-03-09 14:35:31] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2023-03-09 14:35:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 323 ms
[2023-03-09 14:35:31] [INFO ] Added : 278 causal constraints over 56 iterations in 2310 ms. Result :sat
Minimization took 157 ms.
[2023-03-09 14:35:31] [INFO ] [Real]Absence check using 39 positive place invariants in 10 ms returned sat
[2023-03-09 14:35:31] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-09 14:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:31] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-09 14:35:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:31] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 14:35:32] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 300 ms returned sat
[2023-03-09 14:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:34] [INFO ] [Nat]Absence check using state equation in 1949 ms returned sat
[2023-03-09 14:35:34] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2023-03-09 14:35:34] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2023-03-09 14:35:34] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2023-03-09 14:35:34] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2023-03-09 14:35:34] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2023-03-09 14:35:34] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 3 ms to minimize.
[2023-03-09 14:35:35] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2023-03-09 14:35:35] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2023-03-09 14:35:35] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2023-03-09 14:35:35] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 0 ms to minimize.
[2023-03-09 14:35:35] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2023-03-09 14:35:35] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 0 ms to minimize.
[2023-03-09 14:35:35] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 0 ms to minimize.
[2023-03-09 14:35:35] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 0 ms to minimize.
[2023-03-09 14:35:35] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 0 ms to minimize.
[2023-03-09 14:35:35] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2023-03-09 14:35:35] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1643 ms
[2023-03-09 14:35:35] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 19 ms.
[2023-03-09 14:35:36] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 392 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 392 transition count 323
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 371 transition count 323
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 371 transition count 314
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 362 transition count 314
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 343 transition count 295
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 343 transition count 295
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 343 transition count 294
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 342 transition count 294
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 327 transition count 279
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 327 transition count 279
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 327 transition count 264
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 325 transition count 263
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 325 transition count 260
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 322 transition count 260
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 245 transition count 183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 243 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 243 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 242 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 241 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 240 transition count 183
Applied a total of 319 rules in 149 ms. Remains 240 /399 variables (removed 159) and now considering 183/350 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 240/399 places, 183/350 transitions.
// Phase 1: matrix 183 rows 240 cols
[2023-03-09 14:35:38] [INFO ] Computed 63 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47662 resets, run finished after 1725 ms. (steps per millisecond=579 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9106 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9150 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9080 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8994 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties (out of 4) seen :0
[2023-03-09 14:35:43] [INFO ] Invariant cache hit.
[2023-03-09 14:35:43] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 14:35:43] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:35:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:43] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-09 14:35:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2023-03-09 14:35:43] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:35:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:44] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-09 14:35:44] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2023-03-09 14:35:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-09 14:35:44] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-09 14:35:44] [INFO ] Added : 149 causal constraints over 30 iterations in 475 ms. Result :sat
Minimization took 50 ms.
[2023-03-09 14:35:44] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:35:44] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 17 ms returned sat
[2023-03-09 14:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:44] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-09 14:35:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2023-03-09 14:35:44] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-09 14:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:44] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-09 14:35:44] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2023-03-09 14:35:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-09 14:35:44] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 14:35:45] [INFO ] Added : 116 causal constraints over 24 iterations in 373 ms. Result :sat
Minimization took 42 ms.
[2023-03-09 14:35:45] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 14:35:45] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:45] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-09 14:35:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-09 14:35:45] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 17 ms returned sat
[2023-03-09 14:35:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:45] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-09 14:35:45] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-09 14:35:45] [INFO ] Added : 94 causal constraints over 19 iterations in 293 ms. Result :sat
Minimization took 52 ms.
[2023-03-09 14:35:46] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:35:46] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:46] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 14:35:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:35:46] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:46] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-09 14:35:46] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 14:35:46] [INFO ] Added : 101 causal constraints over 21 iterations in 276 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 10 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 240/240 places, 183/183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-09 14:35:47] [INFO ] Invariant cache hit.
[2023-03-09 14:35:47] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-09 14:35:47] [INFO ] Invariant cache hit.
[2023-03-09 14:35:47] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-09 14:35:47] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 14:35:47] [INFO ] Invariant cache hit.
[2023-03-09 14:35:47] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 508 ms. Remains : 240/240 places, 183/183 transitions.
Starting property specific reduction for DES-PT-30b-UpperBounds-04
[2023-03-09 14:35:47] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 484 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 14:35:47] [INFO ] Invariant cache hit.
[2023-03-09 14:35:47] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 14:35:47] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:35:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:47] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-09 14:35:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 14:35:47] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:47] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-09 14:35:48] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2023-03-09 14:35:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-09 14:35:48] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-09 14:35:48] [INFO ] Added : 149 causal constraints over 30 iterations in 462 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 8 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 240/240 places, 183/183 transitions.
[2023-03-09 14:35:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 48082 resets, run finished after 1650 ms. (steps per millisecond=606 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9101 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 1) seen :0
[2023-03-09 14:35:51] [INFO ] Invariant cache hit.
[2023-03-09 14:35:51] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:35:51] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 17 ms returned sat
[2023-03-09 14:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:51] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-09 14:35:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:35:51] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-09 14:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:51] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-09 14:35:51] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2023-03-09 14:35:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-09 14:35:51] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 14:35:51] [INFO ] Added : 149 causal constraints over 30 iterations in 476 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 240/240 places, 183/183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-09 14:35:52] [INFO ] Invariant cache hit.
[2023-03-09 14:35:52] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-09 14:35:52] [INFO ] Invariant cache hit.
[2023-03-09 14:35:52] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-09 14:35:52] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 14:35:52] [INFO ] Invariant cache hit.
[2023-03-09 14:35:52] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 240/240 places, 183/183 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-04 in 5058 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-07
[2023-03-09 14:35:52] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 502 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 14:35:52] [INFO ] Invariant cache hit.
[2023-03-09 14:35:52] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:35:52] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:52] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 14:35:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:35:52] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:52] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-09 14:35:53] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2023-03-09 14:35:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-09 14:35:53] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-09 14:35:53] [INFO ] Added : 116 causal constraints over 24 iterations in 347 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Graph (complete) has 803 edges and 240 vertex of which 236 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 182
Applied a total of 2 rules in 12 ms. Remains 236 /240 variables (removed 4) and now considering 182/183 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-09 14:35:53] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47935 resets, run finished after 1660 ms. (steps per millisecond=602 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9154 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 1) seen :0
[2023-03-09 14:35:56] [INFO ] Invariant cache hit.
[2023-03-09 14:35:56] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 14:35:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 14:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:56] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-09 14:35:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 14:35:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 53 ms returned sat
[2023-03-09 14:35:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:56] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-09 14:35:56] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-09 14:35:56] [INFO ] Added : 119 causal constraints over 24 iterations in 320 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-09 14:35:56] [INFO ] Invariant cache hit.
[2023-03-09 14:35:57] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-09 14:35:57] [INFO ] Invariant cache hit.
[2023-03-09 14:35:57] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-09 14:35:57] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 14:35:57] [INFO ] Invariant cache hit.
[2023-03-09 14:35:57] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 467 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-07 in 4642 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-14
// Phase 1: matrix 183 rows 240 cols
[2023-03-09 14:35:57] [INFO ] Computed 63 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 492 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 14:35:57] [INFO ] Invariant cache hit.
[2023-03-09 14:35:57] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 14:35:57] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:57] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-09 14:35:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:35:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:35:57] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:35:57] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-09 14:35:57] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-09 14:35:57] [INFO ] Added : 94 causal constraints over 19 iterations in 284 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Graph (complete) has 803 edges and 240 vertex of which 236 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 182
Applied a total of 2 rules in 10 ms. Remains 236 /240 variables (removed 4) and now considering 182/183 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-09 14:35:58] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 47755 resets, run finished after 1630 ms. (steps per millisecond=613 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9076 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 1) seen :0
[2023-03-09 14:36:00] [INFO ] Invariant cache hit.
[2023-03-09 14:36:00] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-09 14:36:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 14:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:36:00] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-09 14:36:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:36:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 14:36:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-09 14:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:36:00] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-09 14:36:00] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-09 14:36:01] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2023-03-09 14:36:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-09 14:36:01] [INFO ] Added : 119 causal constraints over 24 iterations in 396 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 12 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-09 14:36:01] [INFO ] Invariant cache hit.
[2023-03-09 14:36:01] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 14:36:01] [INFO ] Invariant cache hit.
[2023-03-09 14:36:01] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-09 14:36:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:36:01] [INFO ] Invariant cache hit.
[2023-03-09 14:36:02] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-14 in 4662 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-15
// Phase 1: matrix 183 rows 240 cols
[2023-03-09 14:36:02] [INFO ] Computed 63 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 469 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 14:36:02] [INFO ] Invariant cache hit.
[2023-03-09 14:36:02] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:36:02] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:36:02] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-09 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:36:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 14:36:02] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:36:02] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-09 14:36:02] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 14:36:02] [INFO ] Added : 101 causal constraints over 21 iterations in 276 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Graph (complete) has 803 edges and 240 vertex of which 236 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 182
Applied a total of 2 rules in 11 ms. Remains 236 /240 variables (removed 4) and now considering 182/183 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-09 14:36:02] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47679 resets, run finished after 1620 ms. (steps per millisecond=617 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9199 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties (out of 1) seen :0
[2023-03-09 14:36:05] [INFO ] Invariant cache hit.
[2023-03-09 14:36:05] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 14:36:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 14:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 14:36:05] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-09 14:36:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 14:36:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 14:36:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2023-03-09 14:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 14:36:05] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-09 14:36:05] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2023-03-09 14:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 14:36:05] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-09 14:36:05] [INFO ] Added : 111 causal constraints over 23 iterations in 331 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-09 14:36:06] [INFO ] Invariant cache hit.
[2023-03-09 14:36:06] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-09 14:36:06] [INFO ] Invariant cache hit.
[2023-03-09 14:36:06] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-09 14:36:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 14:36:06] [INFO ] Invariant cache hit.
[2023-03-09 14:36:06] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-15 in 4610 ms.
[2023-03-09 14:36:06] [INFO ] Flatten gal took : 50 ms
[2023-03-09 14:36:06] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-09 14:36:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 240 places, 183 transitions and 901 arcs took 2 ms.
Total runtime 48333 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 30b
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart
PNML FILE: model.pnml
Petri model created: 240 places, 183 transitions, 901 arcs.
Final Score: 4038.845
Took : 10 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 751936 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102868 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.
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="DES-PT-30b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is DES-PT-30b, 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 r107-tall-167814484200453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b 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 '
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 ;