About the Execution of Marcie+red for ASLink-PT-07b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9627.020 | 3600000.00 | 3693777.00 | 146.20 | 1 1 1 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.r010-oct2-167813598600117.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ASLink-PT-07b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598600117
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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 1.1M 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 ASLink-PT-07b-UpperBounds-00
FORMULA_NAME ASLink-PT-07b-UpperBounds-01
FORMULA_NAME ASLink-PT-07b-UpperBounds-02
FORMULA_NAME ASLink-PT-07b-UpperBounds-03
FORMULA_NAME ASLink-PT-07b-UpperBounds-04
FORMULA_NAME ASLink-PT-07b-UpperBounds-05
FORMULA_NAME ASLink-PT-07b-UpperBounds-06
FORMULA_NAME ASLink-PT-07b-UpperBounds-07
FORMULA_NAME ASLink-PT-07b-UpperBounds-08
FORMULA_NAME ASLink-PT-07b-UpperBounds-09
FORMULA_NAME ASLink-PT-07b-UpperBounds-10
FORMULA_NAME ASLink-PT-07b-UpperBounds-11
FORMULA_NAME ASLink-PT-07b-UpperBounds-12
FORMULA_NAME ASLink-PT-07b-UpperBounds-13
FORMULA_NAME ASLink-PT-07b-UpperBounds-14
FORMULA_NAME ASLink-PT-07b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678667116163
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 00:25:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 00:25:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:25:18] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-13 00:25:18] [INFO ] Transformed 3222 places.
[2023-03-13 00:25:18] [INFO ] Transformed 3986 transitions.
[2023-03-13 00:25:18] [INFO ] Found NUPN structural information;
[2023-03-13 00:25:18] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3986 rows 3222 cols
[2023-03-13 00:25:19] [INFO ] Computed 316 place invariants in 209 ms
Incomplete random walk after 10000 steps, including 15 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :9
FORMULA ASLink-PT-07b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :1
FORMULA ASLink-PT-07b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-13 00:25:19] [INFO ] Invariant cache hit.
[2023-03-13 00:25:20] [INFO ] [Real]Absence check using 75 positive place invariants in 93 ms returned sat
[2023-03-13 00:25:20] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 98 ms returned sat
[2023-03-13 00:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:25:24] [INFO ] [Real]Absence check using state equation in 3330 ms returned sat
[2023-03-13 00:25:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:25:25] [INFO ] [Nat]Absence check using 75 positive place invariants in 137 ms returned sat
[2023-03-13 00:25:25] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 130 ms returned sat
[2023-03-13 00:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:25:29] [INFO ] [Nat]Absence check using state equation in 4136 ms returned unknown
[2023-03-13 00:25:30] [INFO ] [Real]Absence check using 75 positive place invariants in 67 ms returned sat
[2023-03-13 00:25:30] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 161 ms returned sat
[2023-03-13 00:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:25:32] [INFO ] [Real]Absence check using state equation in 2638 ms returned sat
[2023-03-13 00:25:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:25:33] [INFO ] [Nat]Absence check using 75 positive place invariants in 68 ms returned sat
[2023-03-13 00:25:34] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 119 ms returned sat
[2023-03-13 00:25:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:25:38] [INFO ] [Nat]Absence check using state equation in 4125 ms returned unknown
[2023-03-13 00:25:38] [INFO ] [Real]Absence check using 75 positive place invariants in 60 ms returned sat
[2023-03-13 00:25:38] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 170 ms returned sat
[2023-03-13 00:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:25:42] [INFO ] [Real]Absence check using state equation in 3043 ms returned sat
[2023-03-13 00:25:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:25:42] [INFO ] [Nat]Absence check using 75 positive place invariants in 62 ms returned sat
[2023-03-13 00:25:43] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 257 ms returned sat
[2023-03-13 00:25:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:25:47] [INFO ] [Nat]Absence check using state equation in 4048 ms returned unknown
[2023-03-13 00:25:47] [INFO ] [Real]Absence check using 75 positive place invariants in 60 ms returned sat
[2023-03-13 00:25:47] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 139 ms returned sat
[2023-03-13 00:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:25:50] [INFO ] [Real]Absence check using state equation in 2941 ms returned sat
[2023-03-13 00:25:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:25:51] [INFO ] [Nat]Absence check using 75 positive place invariants in 87 ms returned sat
[2023-03-13 00:25:51] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 207 ms returned sat
[2023-03-13 00:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:25:54] [INFO ] [Nat]Absence check using state equation in 2207 ms returned sat
[2023-03-13 00:25:56] [INFO ] Deduced a trap composed of 157 places in 2477 ms of which 36 ms to minimize.
[2023-03-13 00:25:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:25:57] [INFO ] [Real]Absence check using 75 positive place invariants in 66 ms returned sat
[2023-03-13 00:25:57] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 153 ms returned sat
[2023-03-13 00:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:25:59] [INFO ] [Real]Absence check using state equation in 2337 ms returned sat
[2023-03-13 00:26:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:26:00] [INFO ] [Nat]Absence check using 75 positive place invariants in 63 ms returned sat
[2023-03-13 00:26:00] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 123 ms returned sat
[2023-03-13 00:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:26:05] [INFO ] [Nat]Absence check using state equation in 4235 ms returned unknown
[2023-03-13 00:26:05] [INFO ] [Real]Absence check using 75 positive place invariants in 77 ms returned sat
[2023-03-13 00:26:05] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 116 ms returned sat
[2023-03-13 00:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:26:09] [INFO ] [Real]Absence check using state equation in 4039 ms returned sat
[2023-03-13 00:26:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:26:10] [INFO ] [Nat]Absence check using 75 positive place invariants in 85 ms returned sat
[2023-03-13 00:26:10] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 102 ms returned sat
[2023-03-13 00:26:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:26:15] [INFO ] [Nat]Absence check using state equation in 4241 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions removed 748 transitions
Trivial Post-agglo rules discarded 748 transitions
Performed 748 trivial Post agglomeration. Transition count delta: 748
Iterating post reduction 0 with 748 rules applied. Total rules applied 748 place count 3222 transition count 3238
Reduce places removed 748 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 782 rules applied. Total rules applied 1530 place count 2474 transition count 3204
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1539 place count 2465 transition count 3204
Performed 747 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 747 Pre rules applied. Total rules applied 1539 place count 2465 transition count 2457
Deduced a syphon composed of 747 places in 6 ms
Ensure Unique test removed 73 places
Reduce places removed 820 places and 0 transitions.
Iterating global reduction 3 with 1567 rules applied. Total rules applied 3106 place count 1645 transition count 2457
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 3 with 54 rules applied. Total rules applied 3160 place count 1637 transition count 2411
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 47 rules applied. Total rules applied 3207 place count 1591 transition count 2410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3208 place count 1590 transition count 2410
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 28 Pre rules applied. Total rules applied 3208 place count 1590 transition count 2382
Deduced a syphon composed of 28 places in 13 ms
Ensure Unique test removed 27 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 83 rules applied. Total rules applied 3291 place count 1535 transition count 2382
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 27 Pre rules applied. Total rules applied 3291 place count 1535 transition count 2355
Deduced a syphon composed of 27 places in 12 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 3345 place count 1508 transition count 2355
Discarding 103 places :
Symmetric choice reduction at 6 with 103 rule applications. Total rules 3448 place count 1405 transition count 2252
Iterating global reduction 6 with 103 rules applied. Total rules applied 3551 place count 1405 transition count 2252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3552 place count 1405 transition count 2251
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 34 Pre rules applied. Total rules applied 3552 place count 1405 transition count 2217
Deduced a syphon composed of 34 places in 12 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 69 rules applied. Total rules applied 3621 place count 1370 transition count 2217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3621 place count 1370 transition count 2216
Deduced a syphon composed of 1 places in 12 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 3624 place count 1368 transition count 2216
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 3632 place count 1360 transition count 2165
Iterating global reduction 7 with 8 rules applied. Total rules applied 3640 place count 1360 transition count 2165
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 3640 place count 1360 transition count 2158
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 3654 place count 1353 transition count 2158
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3655 place count 1352 transition count 2150
Iterating global reduction 7 with 1 rules applied. Total rules applied 3656 place count 1352 transition count 2150
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3657 place count 1351 transition count 2142
Iterating global reduction 7 with 1 rules applied. Total rules applied 3658 place count 1351 transition count 2142
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3659 place count 1350 transition count 2134
Iterating global reduction 7 with 1 rules applied. Total rules applied 3660 place count 1350 transition count 2134
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3661 place count 1349 transition count 2126
Iterating global reduction 7 with 1 rules applied. Total rules applied 3662 place count 1349 transition count 2126
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3663 place count 1348 transition count 2118
Iterating global reduction 7 with 1 rules applied. Total rules applied 3664 place count 1348 transition count 2118
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3665 place count 1347 transition count 2110
Iterating global reduction 7 with 1 rules applied. Total rules applied 3666 place count 1347 transition count 2110
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3667 place count 1346 transition count 2102
Iterating global reduction 7 with 1 rules applied. Total rules applied 3668 place count 1346 transition count 2102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3669 place count 1345 transition count 2094
Iterating global reduction 7 with 1 rules applied. Total rules applied 3670 place count 1345 transition count 2094
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3671 place count 1344 transition count 2086
Iterating global reduction 7 with 1 rules applied. Total rules applied 3672 place count 1344 transition count 2086
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3673 place count 1343 transition count 2078
Iterating global reduction 7 with 1 rules applied. Total rules applied 3674 place count 1343 transition count 2078
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3675 place count 1342 transition count 2070
Iterating global reduction 7 with 1 rules applied. Total rules applied 3676 place count 1342 transition count 2070
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3677 place count 1341 transition count 2062
Iterating global reduction 7 with 1 rules applied. Total rules applied 3678 place count 1341 transition count 2062
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3679 place count 1340 transition count 2054
Iterating global reduction 7 with 1 rules applied. Total rules applied 3680 place count 1340 transition count 2054
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3681 place count 1339 transition count 2046
Iterating global reduction 7 with 1 rules applied. Total rules applied 3682 place count 1339 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3683 place count 1338 transition count 2038
Iterating global reduction 7 with 1 rules applied. Total rules applied 3684 place count 1338 transition count 2038
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3685 place count 1337 transition count 2030
Iterating global reduction 7 with 1 rules applied. Total rules applied 3686 place count 1337 transition count 2030
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 3 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 7 with 372 rules applied. Total rules applied 4058 place count 1151 transition count 1844
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4059 place count 1150 transition count 1843
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 4061 place count 1149 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4062 place count 1148 transition count 1842
Iterating global reduction 7 with 1 rules applied. Total rules applied 4063 place count 1148 transition count 1842
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 4065 place count 1148 transition count 1840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4066 place count 1147 transition count 1840
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4068 place count 1146 transition count 1849
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 4076 place count 1146 transition count 1841
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 4084 place count 1138 transition count 1841
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 4090 place count 1138 transition count 1835
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 4096 place count 1132 transition count 1835
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4097 place count 1131 transition count 1834
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 11 with 21 rules applied. Total rules applied 4118 place count 1117 transition count 1827
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 4125 place count 1110 transition count 1827
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 20 Pre rules applied. Total rules applied 4125 place count 1110 transition count 1807
Deduced a syphon composed of 20 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 13 with 41 rules applied. Total rules applied 4166 place count 1089 transition count 1807
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 13 with 8 rules applied. Total rules applied 4174 place count 1081 transition count 1807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 4174 place count 1081 transition count 1806
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4176 place count 1080 transition count 1806
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 30 rules applied. Total rules applied 4206 place count 1065 transition count 1791
Discarding 7 places :
Symmetric choice reduction at 14 with 7 rule applications. Total rules 4213 place count 1058 transition count 1784
Iterating global reduction 14 with 7 rules applied. Total rules applied 4220 place count 1058 transition count 1784
Free-agglomeration rule applied 7 times.
Iterating global reduction 14 with 7 rules applied. Total rules applied 4227 place count 1058 transition count 1777
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 4234 place count 1051 transition count 1777
Applied a total of 4234 rules in 2445 ms. Remains 1051 /3222 variables (removed 2171) and now considering 1777/3986 (removed 2209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2445 ms. Remains : 1051/3222 places, 1777/3986 transitions.
// Phase 1: matrix 1777 rows 1051 cols
[2023-03-13 00:26:17] [INFO ] Computed 182 place invariants in 92 ms
Incomplete random walk after 1000000 steps, including 10655 resets, run finished after 3746 ms. (steps per millisecond=266 ) properties (out of 6) seen :3
FORMULA ASLink-PT-07b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1522 resets, run finished after 1619 ms. (steps per millisecond=617 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1539 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1531 resets, run finished after 1749 ms. (steps per millisecond=571 ) properties (out of 3) seen :0
[2023-03-13 00:26:26] [INFO ] Invariant cache hit.
[2023-03-13 00:26:26] [INFO ] [Real]Absence check using 50 positive place invariants in 19 ms returned sat
[2023-03-13 00:26:26] [INFO ] [Real]Absence check using 50 positive and 132 generalized place invariants in 44 ms returned sat
[2023-03-13 00:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:26:27] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2023-03-13 00:26:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:26:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 77 ms returned sat
[2023-03-13 00:26:28] [INFO ] [Nat]Absence check using 50 positive and 132 generalized place invariants in 128 ms returned sat
[2023-03-13 00:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:26:29] [INFO ] [Nat]Absence check using state equation in 985 ms returned sat
[2023-03-13 00:26:29] [INFO ] Computed and/alt/rep : 699/2661/699 causal constraints (skipped 1041 transitions) in 145 ms.
[2023-03-13 00:26:32] [INFO ] Added : 133 causal constraints over 27 iterations in 3208 ms. Result :sat
Minimization took 468 ms.
[2023-03-13 00:26:33] [INFO ] [Real]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-13 00:26:33] [INFO ] [Real]Absence check using 50 positive and 132 generalized place invariants in 69 ms returned sat
[2023-03-13 00:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:26:34] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2023-03-13 00:26:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:26:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 49 ms returned sat
[2023-03-13 00:26:34] [INFO ] [Nat]Absence check using 50 positive and 132 generalized place invariants in 71 ms returned sat
[2023-03-13 00:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:26:35] [INFO ] [Nat]Absence check using state equation in 1071 ms returned sat
[2023-03-13 00:26:36] [INFO ] Computed and/alt/rep : 699/2661/699 causal constraints (skipped 1041 transitions) in 145 ms.
[2023-03-13 00:26:47] [INFO ] Deduced a trap composed of 85 places in 554 ms of which 14 ms to minimize.
[2023-03-13 00:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 712 ms
[2023-03-13 00:26:47] [INFO ] Added : 519 causal constraints over 104 iterations in 11571 ms. Result :sat
Minimization took 625 ms.
[2023-03-13 00:26:48] [INFO ] [Real]Absence check using 50 positive place invariants in 28 ms returned sat
[2023-03-13 00:26:48] [INFO ] [Real]Absence check using 50 positive and 132 generalized place invariants in 84 ms returned sat
[2023-03-13 00:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:26:49] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2023-03-13 00:26:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:26:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-13 00:26:49] [INFO ] [Nat]Absence check using 50 positive and 132 generalized place invariants in 25 ms returned sat
[2023-03-13 00:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:26:50] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2023-03-13 00:26:50] [INFO ] Deduced a trap composed of 139 places in 555 ms of which 2 ms to minimize.
[2023-03-13 00:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 682 ms
[2023-03-13 00:26:51] [INFO ] Computed and/alt/rep : 699/2661/699 causal constraints (skipped 1041 transitions) in 97 ms.
[2023-03-13 00:27:00] [INFO ] Added : 145 causal constraints over 29 iterations in 9861 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1051 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1051/1051 places, 1777/1777 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1051 transition count 1776
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1050 transition count 1776
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 1050 transition count 1773
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 1047 transition count 1773
Applied a total of 8 rules in 55 ms. Remains 1047 /1051 variables (removed 4) and now considering 1773/1777 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 1047/1051 places, 1773/1777 transitions.
// Phase 1: matrix 1773 rows 1047 cols
[2023-03-13 00:27:05] [INFO ] Computed 182 place invariants in 98 ms
Incomplete random walk after 1000000 steps, including 10893 resets, run finished after 2910 ms. (steps per millisecond=343 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1532 resets, run finished after 1360 ms. (steps per millisecond=735 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1539 resets, run finished after 1374 ms. (steps per millisecond=727 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1537 resets, run finished after 1365 ms. (steps per millisecond=732 ) properties (out of 3) seen :0
[2023-03-13 00:27:12] [INFO ] Invariant cache hit.
[2023-03-13 00:27:12] [INFO ] [Real]Absence check using 49 positive place invariants in 14 ms returned sat
[2023-03-13 00:27:12] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 91 ms returned sat
[2023-03-13 00:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:27:13] [INFO ] [Real]Absence check using state equation in 793 ms returned sat
[2023-03-13 00:27:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:27:13] [INFO ] [Nat]Absence check using 49 positive place invariants in 44 ms returned sat
[2023-03-13 00:27:13] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 84 ms returned sat
[2023-03-13 00:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:27:14] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2023-03-13 00:27:14] [INFO ] Computed and/alt/rep : 695/2657/695 causal constraints (skipped 1041 transitions) in 121 ms.
[2023-03-13 00:27:20] [INFO ] Added : 95 causal constraints over 19 iterations in 5550 ms. Result :sat
Minimization took 555 ms.
[2023-03-13 00:27:21] [INFO ] [Real]Absence check using 49 positive place invariants in 77 ms returned sat
[2023-03-13 00:27:21] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 43 ms returned sat
[2023-03-13 00:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:27:21] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2023-03-13 00:27:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:27:22] [INFO ] [Nat]Absence check using 49 positive place invariants in 16 ms returned sat
[2023-03-13 00:27:22] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 29 ms returned sat
[2023-03-13 00:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:27:22] [INFO ] [Nat]Absence check using state equation in 902 ms returned sat
[2023-03-13 00:27:23] [INFO ] Computed and/alt/rep : 695/2657/695 causal constraints (skipped 1041 transitions) in 138 ms.
[2023-03-13 00:27:36] [INFO ] Added : 507 causal constraints over 102 iterations in 12957 ms. Result :sat
Minimization took 612 ms.
[2023-03-13 00:27:36] [INFO ] [Real]Absence check using 49 positive place invariants in 15 ms returned sat
[2023-03-13 00:27:36] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 47 ms returned sat
[2023-03-13 00:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:27:37] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2023-03-13 00:27:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:27:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 21 ms returned sat
[2023-03-13 00:27:37] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 26 ms returned sat
[2023-03-13 00:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:27:38] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2023-03-13 00:27:38] [INFO ] Computed and/alt/rep : 695/2657/695 causal constraints (skipped 1041 transitions) in 94 ms.
[2023-03-13 00:27:51] [INFO ] Added : 498 causal constraints over 100 iterations in 13127 ms. Result :sat
Minimization took 664 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1047 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1047/1047 places, 1773/1773 transitions.
Applied a total of 0 rules in 33 ms. Remains 1047 /1047 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1047/1047 places, 1773/1773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1047/1047 places, 1773/1773 transitions.
Applied a total of 0 rules in 31 ms. Remains 1047 /1047 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
[2023-03-13 00:27:56] [INFO ] Invariant cache hit.
[2023-03-13 00:27:57] [INFO ] Implicit Places using invariants in 1181 ms returned [1, 18, 19, 31, 48, 66, 136, 140, 149, 150, 152, 169, 187, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 504, 508, 509, 520, 521, 523, 540, 558, 627, 631, 632, 643, 644, 646, 663, 681, 750, 754, 755, 766, 767, 769, 786, 804, 873, 877, 878, 881, 892, 893, 894, 912, 914, 918, 936, 937, 938, 939, 951, 957, 963, 969, 975, 981, 987, 993, 999, 1005, 1011]
Discarding 77 places :
Implicit Place search using SMT only with invariants took 1202 ms to find 77 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 970/1047 places, 1773/1773 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 970 transition count 1632
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 148 rules applied. Total rules applied 289 place count 829 transition count 1625
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 289 place count 829 transition count 1590
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 360 place count 793 transition count 1590
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 372 place count 789 transition count 1582
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 380 place count 781 transition count 1582
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 395 place count 766 transition count 1567
Iterating global reduction 4 with 15 rules applied. Total rules applied 410 place count 766 transition count 1567
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 413 place count 766 transition count 1564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 413 place count 766 transition count 1563
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 415 place count 765 transition count 1563
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 418 place count 762 transition count 1557
Iterating global reduction 5 with 3 rules applied. Total rules applied 421 place count 762 transition count 1557
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 422 place count 761 transition count 1556
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 761 transition count 1556
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 424 place count 760 transition count 1554
Iterating global reduction 5 with 1 rules applied. Total rules applied 425 place count 760 transition count 1554
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 529 place count 708 transition count 1502
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 535 place count 702 transition count 1496
Iterating global reduction 5 with 6 rules applied. Total rules applied 541 place count 702 transition count 1496
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 547 place count 702 transition count 1490
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 551 place count 700 transition count 1491
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 567 place count 700 transition count 1475
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 584 place count 683 transition count 1475
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 605 place count 683 transition count 1475
Applied a total of 605 rules in 364 ms. Remains 683 /970 variables (removed 287) and now considering 1475/1773 (removed 298) transitions.
// Phase 1: matrix 1475 rows 683 cols
[2023-03-13 00:27:57] [INFO ] Computed 99 place invariants in 10 ms
[2023-03-13 00:27:58] [INFO ] Implicit Places using invariants in 869 ms returned [72, 91, 97, 100, 102, 105, 106, 175, 181, 184, 186, 189, 194, 195, 247, 264, 270, 273, 275, 280, 281, 333, 350, 356, 359, 361, 366, 367, 419, 436, 442, 445, 447, 452, 453, 505, 522, 528, 531, 533, 538, 539, 591, 608, 614, 617, 619]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 886 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 636/1047 places, 1475/1773 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 614 transition count 1453
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 614 transition count 1453
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 607 transition count 1446
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 607 transition count 1446
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 84 place count 594 transition count 1433
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 85 place count 594 transition count 1432
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 106 place count 594 transition count 1411
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 127 place count 573 transition count 1411
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 573 transition count 1405
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 139 place count 567 transition count 1405
Applied a total of 139 rules in 162 ms. Remains 567 /636 variables (removed 69) and now considering 1405/1475 (removed 70) transitions.
// Phase 1: matrix 1405 rows 567 cols
[2023-03-13 00:27:58] [INFO ] Computed 52 place invariants in 10 ms
[2023-03-13 00:27:59] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-13 00:27:59] [INFO ] Invariant cache hit.
[2023-03-13 00:28:00] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 567/1047 places, 1405/1773 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4547 ms. Remains : 567/1047 places, 1405/1773 transitions.
Successfully produced net in file /tmp/petri1000_3377339389450377185.dot
Successfully produced net in file /tmp/petri1001_13685002846203862246.dot
Successfully produced net in file /tmp/petri1002_5487525089354829246.dot
Successfully produced net in file /tmp/petri1003_7246225735010810037.dot
Successfully produced net in file /tmp/petri1004_11123937682780162012.dot
Successfully produced net in file /tmp/petri1005_5103980455957328118.dot
Successfully produced net in file /tmp/petri1006_2048435871007196247.dot
Drop transitions removed 7 transitions
Dominated transitions for bounds rules discarded 7 transitions
// Phase 1: matrix 1398 rows 567 cols
[2023-03-13 00:28:00] [INFO ] Computed 52 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 17172 resets, run finished after 2237 ms. (steps per millisecond=447 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3259 resets, run finished after 755 ms. (steps per millisecond=1324 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3233 resets, run finished after 719 ms. (steps per millisecond=1390 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3241 resets, run finished after 738 ms. (steps per millisecond=1355 ) properties (out of 3) seen :0
[2023-03-13 00:28:05] [INFO ] Invariant cache hit.
[2023-03-13 00:28:05] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-13 00:28:05] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 22 ms returned sat
[2023-03-13 00:28:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:06] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2023-03-13 00:28:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:28:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-13 00:28:06] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 80 ms returned sat
[2023-03-13 00:28:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:07] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2023-03-13 00:28:07] [INFO ] Computed and/alt/rep : 322/1457/322 causal constraints (skipped 1039 transitions) in 139 ms.
[2023-03-13 00:28:08] [INFO ] Added : 45 causal constraints over 9 iterations in 1146 ms. Result :sat
Minimization took 223 ms.
[2023-03-13 00:28:08] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-13 00:28:08] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 23 ms returned sat
[2023-03-13 00:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:09] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2023-03-13 00:28:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:28:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2023-03-13 00:28:09] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 41 ms returned sat
[2023-03-13 00:28:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:10] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2023-03-13 00:28:10] [INFO ] Computed and/alt/rep : 322/1457/322 causal constraints (skipped 1039 transitions) in 109 ms.
[2023-03-13 00:28:11] [INFO ] Added : 34 causal constraints over 7 iterations in 1065 ms. Result :sat
Minimization took 277 ms.
[2023-03-13 00:28:11] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-13 00:28:11] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 16 ms returned sat
[2023-03-13 00:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:12] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-13 00:28:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:28:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-13 00:28:12] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 13 ms returned sat
[2023-03-13 00:28:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:13] [INFO ] [Nat]Absence check using state equation in 1251 ms returned sat
[2023-03-13 00:28:13] [INFO ] Computed and/alt/rep : 322/1457/322 causal constraints (skipped 1039 transitions) in 95 ms.
[2023-03-13 00:28:14] [INFO ] Added : 28 causal constraints over 6 iterations in 742 ms. Result :sat
Minimization took 255 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ASLink-PT-07b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 1398/1398 transitions.
Graph (complete) has 3449 edges and 567 vertex of which 560 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 560 transition count 1397
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 3 place count 559 transition count 1397
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 559 transition count 1397
Applied a total of 10 rules in 41 ms. Remains 559 /567 variables (removed 8) and now considering 1397/1398 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 559/567 places, 1397/1398 transitions.
// Phase 1: matrix 1397 rows 559 cols
[2023-03-13 00:28:16] [INFO ] Computed 52 place invariants in 43 ms
Incomplete random walk after 1000000 steps, including 17465 resets, run finished after 2425 ms. (steps per millisecond=412 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3278 resets, run finished after 780 ms. (steps per millisecond=1282 ) properties (out of 1) seen :0
[2023-03-13 00:28:19] [INFO ] Invariant cache hit.
[2023-03-13 00:28:19] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-13 00:28:19] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 17 ms returned sat
[2023-03-13 00:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:19] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-13 00:28:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:28:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-13 00:28:20] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 14 ms returned sat
[2023-03-13 00:28:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:20] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2023-03-13 00:28:20] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2023-03-13 00:28:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-13 00:28:21] [INFO ] Computed and/alt/rep : 321/1454/321 causal constraints (skipped 1039 transitions) in 98 ms.
[2023-03-13 00:28:21] [INFO ] Added : 26 causal constraints over 6 iterations in 869 ms. Result :sat
Minimization took 335 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 1397/1397 transitions.
Applied a total of 0 rules in 19 ms. Remains 559 /559 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 559/559 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 1397/1397 transitions.
Applied a total of 0 rules in 18 ms. Remains 559 /559 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-13 00:28:22] [INFO ] Invariant cache hit.
[2023-03-13 00:28:23] [INFO ] Implicit Places using invariants in 424 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 426 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 558/559 places, 1397/1397 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 557 transition count 1396
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 557 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 556 transition count 1395
Applied a total of 4 rules in 80 ms. Remains 556 /558 variables (removed 2) and now considering 1395/1397 (removed 2) transitions.
// Phase 1: matrix 1395 rows 556 cols
[2023-03-13 00:28:23] [INFO ] Computed 51 place invariants in 9 ms
[2023-03-13 00:28:23] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-13 00:28:23] [INFO ] Invariant cache hit.
[2023-03-13 00:28:24] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1589 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 556/559 places, 1395/1397 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2113 ms. Remains : 556/559 places, 1395/1397 transitions.
[2023-03-13 00:28:24] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17233 resets, run finished after 2089 ms. (steps per millisecond=478 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3211 resets, run finished after 821 ms. (steps per millisecond=1218 ) properties (out of 1) seen :0
[2023-03-13 00:28:27] [INFO ] Invariant cache hit.
[2023-03-13 00:28:27] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-13 00:28:27] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 28 ms returned sat
[2023-03-13 00:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:28] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2023-03-13 00:28:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:28:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-13 00:28:28] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 12 ms returned sat
[2023-03-13 00:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:29] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2023-03-13 00:28:29] [INFO ] Computed and/alt/rep : 312/1381/312 causal constraints (skipped 1046 transitions) in 103 ms.
[2023-03-13 00:28:29] [INFO ] Added : 16 causal constraints over 4 iterations in 547 ms. Result :sat
Minimization took 199 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 19 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 556/556 places, 1395/1395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 17 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2023-03-13 00:28:30] [INFO ] Invariant cache hit.
[2023-03-13 00:28:30] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-13 00:28:30] [INFO ] Invariant cache hit.
[2023-03-13 00:28:32] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 2059 ms to find 0 implicit places.
[2023-03-13 00:28:32] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-13 00:28:32] [INFO ] Invariant cache hit.
[2023-03-13 00:28:33] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2756 ms. Remains : 556/556 places, 1395/1395 transitions.
Starting property specific reduction for ASLink-PT-07b-UpperBounds-12
[2023-03-13 00:28:33] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 184 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-13 00:28:33] [INFO ] Invariant cache hit.
[2023-03-13 00:28:33] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-13 00:28:33] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 25 ms returned sat
[2023-03-13 00:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:33] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2023-03-13 00:28:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:28:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-13 00:28:33] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 14 ms returned sat
[2023-03-13 00:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:34] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2023-03-13 00:28:34] [INFO ] Computed and/alt/rep : 312/1381/312 causal constraints (skipped 1046 transitions) in 93 ms.
[2023-03-13 00:28:35] [INFO ] Added : 16 causal constraints over 4 iterations in 568 ms. Result :sat
Minimization took 210 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 19 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 556/556 places, 1395/1395 transitions.
[2023-03-13 00:28:35] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17232 resets, run finished after 2420 ms. (steps per millisecond=413 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3263 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 1) seen :0
[2023-03-13 00:28:38] [INFO ] Invariant cache hit.
[2023-03-13 00:28:39] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-13 00:28:39] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 83 ms returned sat
[2023-03-13 00:28:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:39] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2023-03-13 00:28:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 00:28:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-13 00:28:39] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 12 ms returned sat
[2023-03-13 00:28:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 00:28:40] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2023-03-13 00:28:40] [INFO ] Computed and/alt/rep : 312/1381/312 causal constraints (skipped 1046 transitions) in 95 ms.
[2023-03-13 00:28:41] [INFO ] Added : 16 causal constraints over 4 iterations in 538 ms. Result :sat
Minimization took 210 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 20 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 556/556 places, 1395/1395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 19 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2023-03-13 00:28:41] [INFO ] Invariant cache hit.
[2023-03-13 00:28:42] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-13 00:28:42] [INFO ] Invariant cache hit.
[2023-03-13 00:28:43] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1839 ms to find 0 implicit places.
[2023-03-13 00:28:43] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-13 00:28:43] [INFO ] Invariant cache hit.
[2023-03-13 00:28:43] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2458 ms. Remains : 556/556 places, 1395/1395 transitions.
Ending property specific reduction for ASLink-PT-07b-UpperBounds-12 in 10948 ms.
[2023-03-13 00:28:44] [INFO ] Flatten gal took : 172 ms
[2023-03-13 00:28:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-13 00:28:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 556 places, 1395 transitions and 5707 arcs took 6 ms.
Total runtime 205943 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ASLink_PT_07b
(NrP: 556 NrTr: 1395 NrArc: 5707)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.053sec
net check time: 0m 0.000sec
init dd package: 0m 2.895sec
before gc: list nodes free: 1078122
after gc: idd nodes used:4661, unused:63995339; list nodes free:268398436
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6519064 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16096284 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.008sec
4225 3214 3155 3554 3553 3486 3015 3403 3650 3685 3425 3134 3619 3675 3626 3155 3517 3736 3771 3582 3357 3779 3824 3868 3201 3685 3879 3935 4095 3495 3960 4009 4002 3521 3797 4071 4124 4324 3638 4200 4162 4202 4016 4016 4327 4277 4113 3655 4317 4414 4449 4300 3916 4494 4548 4374 3761 4437 4592 4625 4565 4004 4662 4708 4572 3848 4554 4780 4805 4547 4152 4825 4863 4903 3994 4709 4942 4977 4568 4288 5027 5074 5073 4364 4743 5064 5189 5345 4396 5063 5160 5195 4619
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="ASLink-PT-07b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ASLink-PT-07b, 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 r010-oct2-167813598600117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-07b.tgz
mv ASLink-PT-07b 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 ;