fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r235-tall-167856422300765
Last Updated
May 14, 2023

About the Execution of Smart+red for MultiCrashLeafsetExtension-PT-S16C04

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2468.283 3600000.00 3655866.00 9395.50 1 1 1 1 ? 1 1 1 0 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.r235-tall-167856422300765.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is MultiCrashLeafsetExtension-PT-S16C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856422300765
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 11K Feb 26 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 02:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 02:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.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 MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678692527851

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 07:28:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 07:28:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:28:49] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2023-03-13 07:28:49] [INFO ] Transformed 4260 places.
[2023-03-13 07:28:49] [INFO ] Transformed 6027 transitions.
[2023-03-13 07:28:49] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Normalized transition count is 5755 out of 6027 initially.
// Phase 1: matrix 5755 rows 4260 cols
[2023-03-13 07:28:50] [INFO ] Computed 497 place invariants in 330 ms
Incomplete random walk after 10000 steps, including 239 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 16) seen :11
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :3
[2023-03-13 07:28:50] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2023-03-13 07:28:50] [INFO ] Computed 497 place invariants in 143 ms
[2023-03-13 07:28:51] [INFO ] [Real]Absence check using 46 positive place invariants in 64 ms returned sat
[2023-03-13 07:28:51] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 126 ms returned unsat
[2023-03-13 07:28:51] [INFO ] [Real]Absence check using 46 positive place invariants in 52 ms returned sat
[2023-03-13 07:28:52] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 153 ms returned sat
[2023-03-13 07:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:28:55] [INFO ] [Real]Absence check using state equation in 3175 ms returned sat
[2023-03-13 07:28:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:28:56] [INFO ] [Nat]Absence check using 46 positive place invariants in 53 ms returned sat
[2023-03-13 07:28:56] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 161 ms returned sat
[2023-03-13 07:28:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:28:58] [INFO ] [Nat]Absence check using state equation in 2673 ms returned sat
[2023-03-13 07:28:58] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-13 07:28:59] [INFO ] [Nat]Added 1634 Read/Feed constraints in 643 ms returned sat
[2023-03-13 07:29:00] [INFO ] Computed and/alt/rep : 5376/9422/5376 causal constraints (skipped 362 transitions) in 270 ms.
[2023-03-13 07:29:00] [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 1
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 07:29:00] [INFO ] [Real]Absence check using 46 positive place invariants in 48 ms returned sat
[2023-03-13 07:29:01] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 148 ms returned unsat
[2023-03-13 07:29:01] [INFO ] [Real]Absence check using 46 positive place invariants in 45 ms returned sat
[2023-03-13 07:29:01] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 147 ms returned sat
[2023-03-13 07:29:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:29:04] [INFO ] [Real]Absence check using state equation in 3205 ms returned sat
[2023-03-13 07:29:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:29:05] [INFO ] [Nat]Absence check using 46 positive place invariants in 49 ms returned sat
[2023-03-13 07:29:05] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 161 ms returned sat
[2023-03-13 07:29:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:29:08] [INFO ] [Nat]Absence check using state equation in 2662 ms returned sat
[2023-03-13 07:29:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 07:29:10] [INFO ] [Nat]Added 1634 Read/Feed constraints in 1815 ms returned unknown
[2023-03-13 07:29:10] [INFO ] [Real]Absence check using 46 positive place invariants in 47 ms returned sat
[2023-03-13 07:29:10] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 134 ms returned unsat
[2023-03-13 07:29:11] [INFO ] [Real]Absence check using 46 positive place invariants in 45 ms returned sat
[2023-03-13 07:29:11] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 126 ms returned unsat
[2023-03-13 07:29:11] [INFO ] [Real]Absence check using 46 positive place invariants in 45 ms returned sat
[2023-03-13 07:29:11] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 124 ms returned unsat
[2023-03-13 07:29:12] [INFO ] [Real]Absence check using 46 positive place invariants in 47 ms returned sat
[2023-03-13 07:29:12] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 154 ms returned sat
[2023-03-13 07:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:29:15] [INFO ] [Real]Absence check using state equation in 3378 ms returned sat
[2023-03-13 07:29:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:29:16] [INFO ] [Nat]Absence check using 46 positive place invariants in 46 ms returned sat
[2023-03-13 07:29:16] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 152 ms returned sat
[2023-03-13 07:29:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:29:18] [INFO ] [Nat]Absence check using state equation in 2412 ms returned sat
[2023-03-13 07:29:19] [INFO ] [Nat]Added 1634 Read/Feed constraints in 171 ms returned unsat
[2023-03-13 07:29:19] [INFO ] [Real]Absence check using 46 positive place invariants in 43 ms returned sat
[2023-03-13 07:29:19] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 124 ms returned unsat
[2023-03-13 07:29:19] [INFO ] [Real]Absence check using 46 positive place invariants in 43 ms returned sat
[2023-03-13 07:29:20] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 132 ms returned unsat
[2023-03-13 07:29:20] [INFO ] [Real]Absence check using 46 positive place invariants in 43 ms returned sat
[2023-03-13 07:29:20] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 152 ms returned unsat
[2023-03-13 07:29:21] [INFO ] [Real]Absence check using 46 positive place invariants in 50 ms returned sat
[2023-03-13 07:29:21] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 124 ms returned unsat
[2023-03-13 07:29:21] [INFO ] [Real]Absence check using 46 positive place invariants in 43 ms returned sat
[2023-03-13 07:29:21] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 129 ms returned unsat
[2023-03-13 07:29:22] [INFO ] [Real]Absence check using 46 positive place invariants in 48 ms returned sat
[2023-03-13 07:29:22] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 155 ms returned sat
[2023-03-13 07:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:29:25] [INFO ] [Real]Absence check using state equation in 2905 ms returned sat
[2023-03-13 07:29:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:29:25] [INFO ] [Nat]Absence check using 46 positive place invariants in 51 ms returned sat
[2023-03-13 07:29:25] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 159 ms returned sat
[2023-03-13 07:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:29:30] [INFO ] [Nat]Absence check using state equation in 4438 ms returned unknown
[2023-03-13 07:29:30] [INFO ] [Real]Absence check using 46 positive place invariants in 42 ms returned sat
[2023-03-13 07:29:30] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 133 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 17, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 51, 1] Max seen :[1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 4260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4232 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.16 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions removed 1086 transitions
Trivial Post-agglo rules discarded 1086 transitions
Performed 1086 trivial Post agglomeration. Transition count delta: 1086
Iterating post reduction 0 with 1086 rules applied. Total rules applied 1087 place count 4232 transition count 4941
Reduce places removed 1086 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1087 rules applied. Total rules applied 2174 place count 3146 transition count 4940
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2175 place count 3145 transition count 4940
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 2175 place count 3145 transition count 4804
Deduced a syphon composed of 136 places in 5 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 2447 place count 3009 transition count 4804
Discarding 950 places :
Symmetric choice reduction at 3 with 950 rule applications. Total rules 3397 place count 2059 transition count 3854
Iterating global reduction 3 with 950 rules applied. Total rules applied 4347 place count 2059 transition count 3854
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 4347 place count 2059 transition count 3847
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 4361 place count 2052 transition count 3847
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 4597 place count 1816 transition count 2903
Iterating global reduction 3 with 236 rules applied. Total rules applied 4833 place count 1816 transition count 2903
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 4867 place count 1799 transition count 2886
Free-agglomeration rule (complex) applied 162 times.
Iterating global reduction 3 with 162 rules applied. Total rules applied 5029 place count 1799 transition count 3432
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 3 with 162 rules applied. Total rules applied 5191 place count 1637 transition count 3432
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 5208 place count 1637 transition count 3432
Applied a total of 5208 rules in 1277 ms. Remains 1637 /4260 variables (removed 2623) and now considering 3432/6027 (removed 2595) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1278 ms. Remains : 1637/4260 places, 3432/6027 transitions.
Normalized transition count is 3034 out of 3432 initially.
// Phase 1: matrix 3034 rows 1637 cols
[2023-03-13 07:29:32] [INFO ] Computed 469 place invariants in 40 ms
Incomplete random walk after 1000000 steps, including 39545 resets, run finished after 10944 ms. (steps per millisecond=91 ) properties (out of 3) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6883 resets, run finished after 2542 ms. (steps per millisecond=393 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 6882 resets, run finished after 2526 ms. (steps per millisecond=395 ) properties (out of 2) seen :1
[2023-03-13 07:29:48] [INFO ] Flow matrix only has 3034 transitions (discarded 398 similar events)
// Phase 1: matrix 3034 rows 1637 cols
[2023-03-13 07:29:48] [INFO ] Computed 469 place invariants in 33 ms
[2023-03-13 07:29:48] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2023-03-13 07:29:48] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 66 ms returned sat
[2023-03-13 07:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:29:49] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2023-03-13 07:29:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:29:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-13 07:29:49] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 71 ms returned sat
[2023-03-13 07:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:29:50] [INFO ] [Nat]Absence check using state equation in 812 ms returned sat
[2023-03-13 07:29:50] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-13 07:29:51] [INFO ] [Nat]Added 1634 Read/Feed constraints in 615 ms returned sat
[2023-03-13 07:29:52] [INFO ] Deduced a trap composed of 334 places in 971 ms of which 5 ms to minimize.
[2023-03-13 07:29:53] [INFO ] Deduced a trap composed of 190 places in 1094 ms of which 8 ms to minimize.
[2023-03-13 07:29:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2371 ms
[2023-03-13 07:29:53] [INFO ] Computed and/alt/rep : 1543/3345/1543 causal constraints (skipped 1474 transitions) in 178 ms.
[2023-03-13 07:29:54] [INFO ] Added : 12 causal constraints over 3 iterations in 911 ms. Result :sat
[2023-03-13 07:29:54] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-13 07:29:54] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 1637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1637/1637 places, 3432/3432 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 1637 transition count 3431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1636 transition count 3431
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1636 transition count 3430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1635 transition count 3430
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 6 place count 1633 transition count 3428
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 1633 transition count 3428
Applied a total of 8 rules in 243 ms. Remains 1633 /1637 variables (removed 4) and now considering 3428/3432 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 1633/1637 places, 3428/3432 transitions.
Normalized transition count is 3030 out of 3428 initially.
// Phase 1: matrix 3030 rows 1633 cols
[2023-03-13 07:29:55] [INFO ] Computed 469 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 39545 resets, run finished after 10604 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6883 resets, run finished after 2512 ms. (steps per millisecond=398 ) properties (out of 1) seen :0
[2023-03-13 07:30:08] [INFO ] Flow matrix only has 3030 transitions (discarded 398 similar events)
// Phase 1: matrix 3030 rows 1633 cols
[2023-03-13 07:30:08] [INFO ] Computed 469 place invariants in 44 ms
[2023-03-13 07:30:08] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-13 07:30:08] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 74 ms returned sat
[2023-03-13 07:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:30:09] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2023-03-13 07:30:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:30:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2023-03-13 07:30:09] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 77 ms returned sat
[2023-03-13 07:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:30:10] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2023-03-13 07:30:10] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-13 07:30:11] [INFO ] [Nat]Added 1634 Read/Feed constraints in 599 ms returned sat
[2023-03-13 07:30:12] [INFO ] Deduced a trap composed of 205 places in 946 ms of which 2 ms to minimize.
[2023-03-13 07:30:13] [INFO ] Deduced a trap composed of 124 places in 1020 ms of which 7 ms to minimize.
[2023-03-13 07:30:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2224 ms
[2023-03-13 07:30:13] [INFO ] Computed and/alt/rep : 1540/3340/1540 causal constraints (skipped 1473 transitions) in 161 ms.
[2023-03-13 07:30:14] [INFO ] Added : 19 causal constraints over 5 iterations in 1344 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1633/1633 places, 3428/3428 transitions.
Applied a total of 0 rules in 122 ms. Remains 1633 /1633 variables (removed 0) and now considering 3428/3428 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 1633/1633 places, 3428/3428 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1633/1633 places, 3428/3428 transitions.
Applied a total of 0 rules in 97 ms. Remains 1633 /1633 variables (removed 0) and now considering 3428/3428 (removed 0) transitions.
[2023-03-13 07:30:14] [INFO ] Flow matrix only has 3030 transitions (discarded 398 similar events)
[2023-03-13 07:30:14] [INFO ] Invariant cache hit.
[2023-03-13 07:30:17] [INFO ] Implicit Places using invariants in 2825 ms returned [4, 7, 9, 10, 11, 12, 13, 17, 23, 31, 41, 53, 67, 82, 96, 97, 98, 99, 100, 112, 122, 130, 136, 140, 142, 153, 159, 161, 162, 163, 164, 165, 167, 171, 177, 185, 195, 207, 220, 232, 233, 234, 235, 236, 246, 254, 260, 264, 266, 268, 279, 285, 287, 288, 289, 290, 291, 293, 295, 299, 305, 313, 323, 334, 344, 345, 346, 347, 348, 356, 362, 366, 368, 370, 372, 383, 389, 391, 392, 393, 394, 395, 397, 399, 401, 405, 411, 419, 428, 436, 437, 438, 439, 440, 446, 450, 452, 454, 456, 458, 469, 475, 477, 478, 479, 480, 481, 483, 485, 487, 489, 493, 499, 506, 512, 513, 514, 515, 516, 520, 522, 524, 526, 528, 530, 541, 547, 549, 550, 551, 552, 553, 555, 557, 559, 561, 563, 567, 572, 576, 577, 578, 579, 580, 582, 584, 586, 588, 590, 592, 603, 609, 611, 612, 613, 614, 615, 617, 619, 621, 623, 625, 627, 630, 632, 633, 634, 635, 636, 638, 640, 642, 644, 646, 648, 659, 665, 667, 668, 669, 670, 671, 673, 675, 677, 679, 681, 683, 685, 687, 688, 689, 690, 691, 693, 695, 697, 699, 701, 703, 714, 716, 719, 721, 722, 723, 724, 725, 727, 729, 731, 733, 735, 737, 739, 741, 742, 743, 744, 745, 747, 749, 751, 753, 755, 757, 768, 774, 776, 777, 778, 779, 780, 782, 784, 786, 788, 790, 792, 794, 796, 797, 798, 799, 800, 802, 804, 806, 808, 810, 812, 823, 829, 831, 832, 833, 834, 835, 837, 839, 841, 843, 845, 847, 849, 852, 853, 854, 855, 856, 858, 860, 862, 864, 866, 868, 879, 885, 887, 888, 889, 890, 891, 893, 895, 897, 899, 901, 903, 907, 912, 913, 914, 915, 916, 920, 922, 924, 926, 928, 930, 941, 947, 949, 950, 951, 952, 953, 955, 957, 959, 961, 963, 967, 973, 980, 981, 982, 983, 984, 990, 994, 996, 998, 1000, 1002, 1013, 1019, 1021, 1022, 1023, 1024, 1025, 1027, 1029, 1031, 1033, 1037, 1043, 1051, 1060, 1061, 1062, 1063, 1064, 1072, 1078, 1082, 1084, 1086, 1088, 1099, 1105, 1107, 1108, 1109, 1110, 1111, 1113, 1115, 1117, 1121, 1127, 1135, 1145, 1156, 1157, 1158, 1159, 1160, 1170, 1178, 1184, 1188, 1190, 1192, 1203, 1209, 1211, 1212, 1213, 1214, 1215, 1217, 1219, 1223, 1229, 1237, 1247, 1259, 1272, 1273, 1274, 1275, 1276, 1288, 1298, 1306, 1312, 1316, 1318, 1329, 1331, 1334, 1336, 1337, 1338, 1339, 1340, 1342, 1346, 1352, 1360, 1370, 1382, 1396, 1411, 1412, 1413, 1414, 1415, 1429, 1441, 1451, 1459, 1465, 1469, 1480]
Discarding 428 places :
Implicit Place search using SMT only with invariants took 2842 ms to find 428 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1205/1633 places, 3428/3428 transitions.
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 128 place count 1077 transition count 3300
Iterating global reduction 0 with 128 rules applied. Total rules applied 256 place count 1077 transition count 3300
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 384 place count 949 transition count 3172
Iterating global reduction 0 with 128 rules applied. Total rules applied 512 place count 949 transition count 3172
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 515 place count 949 transition count 3169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 518 place count 946 transition count 3169
Applied a total of 518 rules in 211 ms. Remains 946 /1205 variables (removed 259) and now considering 3169/3428 (removed 259) transitions.
[2023-03-13 07:30:17] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
// Phase 1: matrix 2771 rows 946 cols
[2023-03-13 07:30:18] [INFO ] Computed 41 place invariants in 34 ms
[2023-03-13 07:30:18] [INFO ] Implicit Places using invariants in 957 ms returned []
[2023-03-13 07:30:18] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-13 07:30:18] [INFO ] Invariant cache hit.
[2023-03-13 07:30:19] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-13 07:30:32] [INFO ] Implicit Places using invariants and state equation in 14029 ms returned []
Implicit Place search using SMT with State Equation took 14989 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 946/1633 places, 3169/3428 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18141 ms. Remains : 946/1633 places, 3169/3428 transitions.
Normalized transition count is 2771 out of 3169 initially.
// Phase 1: matrix 2771 rows 946 cols
[2023-03-13 07:30:33] [INFO ] Computed 41 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 42665 resets, run finished after 10337 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4668 resets, run finished after 1697 ms. (steps per millisecond=589 ) properties (out of 1) seen :0
[2023-03-13 07:30:45] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
// Phase 1: matrix 2771 rows 946 cols
[2023-03-13 07:30:45] [INFO ] Computed 41 place invariants in 20 ms
[2023-03-13 07:30:45] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-13 07:30:45] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-13 07:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:30:45] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2023-03-13 07:30:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:30:45] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-13 07:30:45] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-13 07:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:30:46] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2023-03-13 07:30:46] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-13 07:30:47] [INFO ] [Nat]Added 1634 Read/Feed constraints in 747 ms returned sat
[2023-03-13 07:30:47] [INFO ] Deduced a trap composed of 208 places in 380 ms of which 2 ms to minimize.
[2023-03-13 07:30:48] [INFO ] Deduced a trap composed of 51 places in 427 ms of which 1 ms to minimize.
[2023-03-13 07:30:48] [INFO ] Deduced a trap composed of 67 places in 416 ms of which 1 ms to minimize.
[2023-03-13 07:30:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1504 ms
[2023-03-13 07:30:49] [INFO ] Computed and/alt/rep : 1330/1912/1330 causal constraints (skipped 1379 transitions) in 139 ms.
[2023-03-13 07:30:49] [INFO ] Added : 16 causal constraints over 5 iterations in 879 ms. Result :sat
Minimization took 435 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 3169/3169 transitions.
Applied a total of 0 rules in 69 ms. Remains 946 /946 variables (removed 0) and now considering 3169/3169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 946/946 places, 3169/3169 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 3169/3169 transitions.
Applied a total of 0 rules in 68 ms. Remains 946 /946 variables (removed 0) and now considering 3169/3169 (removed 0) transitions.
[2023-03-13 07:30:50] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-13 07:30:50] [INFO ] Invariant cache hit.
[2023-03-13 07:30:51] [INFO ] Implicit Places using invariants in 900 ms returned []
[2023-03-13 07:30:51] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-13 07:30:51] [INFO ] Invariant cache hit.
[2023-03-13 07:30:51] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-13 07:31:05] [INFO ] Implicit Places using invariants and state equation in 14493 ms returned []
Implicit Place search using SMT with State Equation took 15395 ms to find 0 implicit places.
[2023-03-13 07:31:06] [INFO ] Redundant transitions in 202 ms returned []
[2023-03-13 07:31:06] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-13 07:31:06] [INFO ] Invariant cache hit.
[2023-03-13 07:31:07] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16731 ms. Remains : 946/946 places, 3169/3169 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04
Normalized transition count is 2771 out of 3169 initially.
// Phase 1: matrix 2771 rows 946 cols
[2023-03-13 07:31:07] [INFO ] Computed 41 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 426 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-13 07:31:07] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
// Phase 1: matrix 2771 rows 946 cols
[2023-03-13 07:31:07] [INFO ] Computed 41 place invariants in 30 ms
[2023-03-13 07:31:07] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-13 07:31:07] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-13 07:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:31:07] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2023-03-13 07:31:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:31:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-13 07:31:08] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-13 07:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:31:08] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2023-03-13 07:31:08] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-13 07:31:09] [INFO ] [Nat]Added 1634 Read/Feed constraints in 736 ms returned sat
[2023-03-13 07:31:09] [INFO ] Deduced a trap composed of 208 places in 391 ms of which 1 ms to minimize.
[2023-03-13 07:31:10] [INFO ] Deduced a trap composed of 51 places in 422 ms of which 1 ms to minimize.
[2023-03-13 07:31:10] [INFO ] Deduced a trap composed of 67 places in 432 ms of which 1 ms to minimize.
[2023-03-13 07:31:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1523 ms
[2023-03-13 07:31:11] [INFO ] Computed and/alt/rep : 1330/1912/1330 causal constraints (skipped 1379 transitions) in 125 ms.
[2023-03-13 07:31:11] [INFO ] Added : 16 causal constraints over 5 iterations in 852 ms. Result :sat
Minimization took 420 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 3169/3169 transitions.
Applied a total of 0 rules in 71 ms. Remains 946 /946 variables (removed 0) and now considering 3169/3169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 946/946 places, 3169/3169 transitions.
Normalized transition count is 2771 out of 3169 initially.
// Phase 1: matrix 2771 rows 946 cols
[2023-03-13 07:31:12] [INFO ] Computed 41 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 42669 resets, run finished after 10286 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4671 resets, run finished after 1703 ms. (steps per millisecond=587 ) properties (out of 1) seen :0
[2023-03-13 07:31:24] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
// Phase 1: matrix 2771 rows 946 cols
[2023-03-13 07:31:24] [INFO ] Computed 41 place invariants in 31 ms
[2023-03-13 07:31:24] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-13 07:31:24] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-13 07:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:31:25] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2023-03-13 07:31:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:31:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-13 07:31:25] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-13 07:31:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:31:26] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2023-03-13 07:31:26] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-13 07:31:26] [INFO ] [Nat]Added 1634 Read/Feed constraints in 743 ms returned sat
[2023-03-13 07:31:27] [INFO ] Deduced a trap composed of 208 places in 375 ms of which 1 ms to minimize.
[2023-03-13 07:31:27] [INFO ] Deduced a trap composed of 51 places in 415 ms of which 2 ms to minimize.
[2023-03-13 07:31:28] [INFO ] Deduced a trap composed of 67 places in 418 ms of which 1 ms to minimize.
[2023-03-13 07:31:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1486 ms
[2023-03-13 07:31:28] [INFO ] Computed and/alt/rep : 1330/1912/1330 causal constraints (skipped 1379 transitions) in 143 ms.
[2023-03-13 07:31:29] [INFO ] Added : 16 causal constraints over 5 iterations in 874 ms. Result :sat
Minimization took 418 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 3169/3169 transitions.
Applied a total of 0 rules in 69 ms. Remains 946 /946 variables (removed 0) and now considering 3169/3169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 946/946 places, 3169/3169 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 3169/3169 transitions.
Applied a total of 0 rules in 70 ms. Remains 946 /946 variables (removed 0) and now considering 3169/3169 (removed 0) transitions.
[2023-03-13 07:31:29] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-13 07:31:29] [INFO ] Invariant cache hit.
[2023-03-13 07:31:30] [INFO ] Implicit Places using invariants in 892 ms returned []
[2023-03-13 07:31:30] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-13 07:31:30] [INFO ] Invariant cache hit.
[2023-03-13 07:31:31] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-13 07:31:44] [INFO ] Implicit Places using invariants and state equation in 14158 ms returned []
Implicit Place search using SMT with State Equation took 15052 ms to find 0 implicit places.
[2023-03-13 07:31:45] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-13 07:31:45] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-13 07:31:45] [INFO ] Invariant cache hit.
[2023-03-13 07:31:46] [INFO ] Dead Transitions using invariants and state equation in 1029 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16251 ms. Remains : 946/946 places, 3169/3169 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04 in 38961 ms.
[2023-03-13 07:31:46] [INFO ] Flatten gal took : 285 ms
[2023-03-13 07:31:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 07:31:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 946 places, 3169 transitions and 15794 arcs took 21 ms.
Total runtime 177289 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running MultiCrashLeafsetExtension (PT), instance S16C04
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 946 places, 3169 transitions, 15794 arcs.
Final Score: 405337.52
Took : 45 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 13675536 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098256 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C04, 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 r235-tall-167856422300765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;