fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LTSMin+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
950.808 3600000.00 13873012.00 780.90 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.r233-tall-167856419400765.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 ltsminxred
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 r233-tall-167856419400765
=====================================================================

--------------------
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 1679605181981

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 20:59:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 20:59:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 20:59:43] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2023-03-23 20:59:43] [INFO ] Transformed 4260 places.
[2023-03-23 20:59:43] [INFO ] Transformed 6027 transitions.
[2023-03-23 20:59:43] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 5755 out of 6027 initially.
// Phase 1: matrix 5755 rows 4260 cols
[2023-03-23 20:59:44] [INFO ] Computed 497 place invariants in 423 ms
Incomplete random walk after 10000 steps, including 239 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :7
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :3
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 :3
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 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :7
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 :1
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 15) seen :5
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 :8
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 10000 steps, including 61 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :6
[2023-03-23 20:59:45] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2023-03-23 20:59:45] [INFO ] Computed 497 place invariants in 136 ms
[2023-03-23 20:59:45] [INFO ] [Real]Absence check using 46 positive place invariants in 76 ms returned sat
[2023-03-23 20:59:46] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 134 ms returned unsat
[2023-03-23 20:59:46] [INFO ] [Real]Absence check using 46 positive place invariants in 49 ms returned sat
[2023-03-23 20:59:46] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 160 ms returned sat
[2023-03-23 20:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:59:50] [INFO ] [Real]Absence check using state equation in 3328 ms returned sat
[2023-03-23 20:59:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:59:50] [INFO ] [Nat]Absence check using 46 positive place invariants in 51 ms returned sat
[2023-03-23 20:59:51] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 157 ms returned sat
[2023-03-23 20:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:59:53] [INFO ] [Nat]Absence check using state equation in 2840 ms returned sat
[2023-03-23 20:59:53] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 20:59:54] [INFO ] [Nat]Added 1634 Read/Feed constraints in 706 ms returned sat
[2023-03-23 20:59:55] [INFO ] Computed and/alt/rep : 5376/9422/5376 causal constraints (skipped 362 transitions) in 300 ms.
[2023-03-23 20:59:55] [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-23 20:59:55] [INFO ] [Real]Absence check using 46 positive place invariants in 50 ms returned sat
[2023-03-23 20:59:56] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 139 ms returned unsat
[2023-03-23 20:59:56] [INFO ] [Real]Absence check using 46 positive place invariants in 46 ms returned sat
[2023-03-23 20:59:56] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 154 ms returned sat
[2023-03-23 20:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:00] [INFO ] [Real]Absence check using state equation in 3379 ms returned sat
[2023-03-23 21:00:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:00:00] [INFO ] [Nat]Absence check using 46 positive place invariants in 50 ms returned sat
[2023-03-23 21:00:00] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 159 ms returned sat
[2023-03-23 21:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:03] [INFO ] [Nat]Absence check using state equation in 2635 ms returned sat
[2023-03-23 21:00:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 21:00:05] [INFO ] [Nat]Added 1634 Read/Feed constraints in 1763 ms returned unknown
[2023-03-23 21:00:05] [INFO ] [Real]Absence check using 46 positive place invariants in 44 ms returned sat
[2023-03-23 21:00:05] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 154 ms returned unsat
[2023-03-23 21:00:06] [INFO ] [Real]Absence check using 46 positive place invariants in 47 ms returned sat
[2023-03-23 21:00:06] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 133 ms returned unsat
[2023-03-23 21:00:06] [INFO ] [Real]Absence check using 46 positive place invariants in 49 ms returned sat
[2023-03-23 21:00:07] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 134 ms returned unsat
[2023-03-23 21:00:07] [INFO ] [Real]Absence check using 46 positive place invariants in 51 ms returned sat
[2023-03-23 21:00:07] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 162 ms returned sat
[2023-03-23 21:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:11] [INFO ] [Real]Absence check using state equation in 3500 ms returned sat
[2023-03-23 21:00:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:00:11] [INFO ] [Nat]Absence check using 46 positive place invariants in 53 ms returned sat
[2023-03-23 21:00:12] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 162 ms returned sat
[2023-03-23 21:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:14] [INFO ] [Nat]Absence check using state equation in 2666 ms returned sat
[2023-03-23 21:00:14] [INFO ] [Nat]Added 1634 Read/Feed constraints in 173 ms returned unsat
[2023-03-23 21:00:15] [INFO ] [Real]Absence check using 46 positive place invariants in 51 ms returned sat
[2023-03-23 21:00:15] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 128 ms returned unsat
[2023-03-23 21:00:15] [INFO ] [Real]Absence check using 46 positive place invariants in 47 ms returned sat
[2023-03-23 21:00:16] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 146 ms returned unsat
[2023-03-23 21:00:16] [INFO ] [Real]Absence check using 46 positive place invariants in 54 ms returned sat
[2023-03-23 21:00:16] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 153 ms returned unsat
[2023-03-23 21:00:17] [INFO ] [Real]Absence check using 46 positive place invariants in 49 ms returned sat
[2023-03-23 21:00:17] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 134 ms returned unsat
[2023-03-23 21:00:17] [INFO ] [Real]Absence check using 46 positive place invariants in 46 ms returned sat
[2023-03-23 21:00:17] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 128 ms returned unsat
[2023-03-23 21:00:18] [INFO ] [Real]Absence check using 46 positive place invariants in 50 ms returned sat
[2023-03-23 21:00:18] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 136 ms returned unsat
[2023-03-23 21:00:18] [INFO ] [Real]Absence check using 46 positive place invariants in 45 ms returned sat
[2023-03-23 21:00:18] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 136 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 17, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14 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 2 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.20 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions removed 1087 transitions
Trivial Post-agglo rules discarded 1087 transitions
Performed 1087 trivial Post agglomeration. Transition count delta: 1087
Iterating post reduction 0 with 1087 rules applied. Total rules applied 1088 place count 4232 transition count 4940
Reduce places removed 1087 places and 0 transitions.
Iterating post reduction 1 with 1087 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 2 with 136 Pre rules applied. Total rules applied 2175 place count 3145 transition count 4804
Deduced a syphon composed of 136 places in 7 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 2447 place count 3009 transition count 4804
Discarding 951 places :
Symmetric choice reduction at 2 with 951 rule applications. Total rules 3398 place count 2058 transition count 3853
Iterating global reduction 2 with 951 rules applied. Total rules applied 4349 place count 2058 transition count 3853
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4349 place count 2058 transition count 3846
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4363 place count 2051 transition count 3846
Discarding 237 places :
Symmetric choice reduction at 2 with 237 rule applications. Total rules 4600 place count 1814 transition count 2898
Iterating global reduction 2 with 237 rules applied. Total rules applied 4837 place count 1814 transition count 2898
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 4871 place count 1797 transition count 2881
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 2 with 161 rules applied. Total rules applied 5032 place count 1797 transition count 3431
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 2 with 161 rules applied. Total rules applied 5193 place count 1636 transition count 3431
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 5210 place count 1636 transition count 3431
Applied a total of 5210 rules in 1628 ms. Remains 1636 /4260 variables (removed 2624) and now considering 3431/6027 (removed 2596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1629 ms. Remains : 1636/4260 places, 3431/6027 transitions.
Normalized transition count is 3033 out of 3431 initially.
// Phase 1: matrix 3033 rows 1636 cols
[2023-03-23 21:00:20] [INFO ] Computed 469 place invariants in 49 ms
Incomplete random walk after 1000000 steps, including 39550 resets, run finished after 10932 ms. (steps per millisecond=91 ) properties (out of 2) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6882 resets, run finished after 2454 ms. (steps per millisecond=407 ) properties (out of 1) seen :0
[2023-03-23 21:00:34] [INFO ] Flow matrix only has 3033 transitions (discarded 398 similar events)
// Phase 1: matrix 3033 rows 1636 cols
[2023-03-23 21:00:34] [INFO ] Computed 469 place invariants in 46 ms
[2023-03-23 21:00:34] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2023-03-23 21:00:34] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 79 ms returned sat
[2023-03-23 21:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:35] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2023-03-23 21:00:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:00:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-23 21:00:35] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 78 ms returned sat
[2023-03-23 21:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:36] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2023-03-23 21:00:36] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 21:00:37] [INFO ] [Nat]Added 1634 Read/Feed constraints in 1052 ms returned sat
[2023-03-23 21:00:38] [INFO ] Deduced a trap composed of 236 places in 1093 ms of which 7 ms to minimize.
[2023-03-23 21:00:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1311 ms
[2023-03-23 21:00:39] [INFO ] Computed and/alt/rep : 1542/3343/1542 causal constraints (skipped 1474 transitions) in 213 ms.
[2023-03-23 21:00:40] [INFO ] Added : 19 causal constraints over 5 iterations in 1653 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1636/1636 places, 3431/3431 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 1636 transition count 3430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1635 transition count 3430
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1635 transition count 3429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1634 transition count 3429
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 1633 transition count 3428
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 1633 transition count 3428
Applied a total of 6 rules in 264 ms. Remains 1633 /1636 variables (removed 3) and now considering 3428/3431 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 1633/1636 places, 3428/3431 transitions.
Normalized transition count is 3030 out of 3428 initially.
// Phase 1: matrix 3030 rows 1633 cols
[2023-03-23 21:00:41] [INFO ] Computed 469 place invariants in 59 ms
Incomplete random walk after 1000000 steps, including 39542 resets, run finished after 11188 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6883 resets, run finished after 2586 ms. (steps per millisecond=386 ) properties (out of 1) seen :0
[2023-03-23 21:00:54] [INFO ] Flow matrix only has 3030 transitions (discarded 398 similar events)
// Phase 1: matrix 3030 rows 1633 cols
[2023-03-23 21:00:54] [INFO ] Computed 469 place invariants in 77 ms
[2023-03-23 21:00:55] [INFO ] [Real]Absence check using 33 positive place invariants in 57 ms returned sat
[2023-03-23 21:00:55] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 98 ms returned sat
[2023-03-23 21:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:56] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2023-03-23 21:00:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:00:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2023-03-23 21:00:56] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 75 ms returned sat
[2023-03-23 21:00:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:57] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2023-03-23 21:00:57] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 21:00:58] [INFO ] [Nat]Added 1634 Read/Feed constraints in 910 ms returned sat
[2023-03-23 21:00:59] [INFO ] Deduced a trap composed of 205 places in 1143 ms of which 3 ms to minimize.
[2023-03-23 21:01:00] [INFO ] Deduced a trap composed of 157 places in 1167 ms of which 5 ms to minimize.
[2023-03-23 21:01:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2599 ms
[2023-03-23 21:01:01] [INFO ] Computed and/alt/rep : 1540/3340/1540 causal constraints (skipped 1473 transitions) in 200 ms.
[2023-03-23 21:01:02] [INFO ] Added : 18 causal constraints over 5 iterations in 1599 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 93 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 93 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 93 ms. Remains 1633 /1633 variables (removed 0) and now considering 3428/3428 (removed 0) transitions.
[2023-03-23 21:01:02] [INFO ] Flow matrix only has 3030 transitions (discarded 398 similar events)
[2023-03-23 21:01:02] [INFO ] Invariant cache hit.
[2023-03-23 21:01:06] [INFO ] Implicit Places using invariants in 3420 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 3437 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 212 ms. Remains 946 /1205 variables (removed 259) and now considering 3169/3428 (removed 259) transitions.
[2023-03-23 21:01:06] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
// Phase 1: matrix 2771 rows 946 cols
[2023-03-23 21:01:06] [INFO ] Computed 41 place invariants in 40 ms
[2023-03-23 21:01:07] [INFO ] Implicit Places using invariants in 1088 ms returned []
[2023-03-23 21:01:07] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-23 21:01:07] [INFO ] Invariant cache hit.
[2023-03-23 21:01:08] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 21:01:21] [INFO ] Implicit Places using invariants and state equation in 14266 ms returned []
Implicit Place search using SMT with State Equation took 15356 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 19100 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-23 21:01:21] [INFO ] Computed 41 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 42670 resets, run finished after 10826 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4667 resets, run finished after 1765 ms. (steps per millisecond=566 ) properties (out of 1) seen :0
[2023-03-23 21:01:34] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
// Phase 1: matrix 2771 rows 946 cols
[2023-03-23 21:01:34] [INFO ] Computed 41 place invariants in 28 ms
[2023-03-23 21:01:34] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-23 21:01:34] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-23 21:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:01:35] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2023-03-23 21:01:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:01:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 21:01:35] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-23 21:01:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:01:36] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2023-03-23 21:01:36] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 21:01:37] [INFO ] [Nat]Added 1634 Read/Feed constraints in 822 ms returned sat
[2023-03-23 21:01:37] [INFO ] Deduced a trap composed of 208 places in 435 ms of which 2 ms to minimize.
[2023-03-23 21:01:38] [INFO ] Deduced a trap composed of 53 places in 467 ms of which 2 ms to minimize.
[2023-03-23 21:01:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1132 ms
[2023-03-23 21:01:38] [INFO ] Computed and/alt/rep : 1330/1912/1330 causal constraints (skipped 1379 transitions) in 170 ms.
[2023-03-23 21:01:38] [INFO ] Added : 11 causal constraints over 3 iterations in 650 ms. Result :sat
Minimization took 487 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 77 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 77 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 71 ms. Remains 946 /946 variables (removed 0) and now considering 3169/3169 (removed 0) transitions.
[2023-03-23 21:01:39] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-23 21:01:39] [INFO ] Invariant cache hit.
[2023-03-23 21:01:40] [INFO ] Implicit Places using invariants in 976 ms returned []
[2023-03-23 21:01:40] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-23 21:01:40] [INFO ] Invariant cache hit.
[2023-03-23 21:01:41] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 21:01:54] [INFO ] Implicit Places using invariants and state equation in 14203 ms returned []
Implicit Place search using SMT with State Equation took 15183 ms to find 0 implicit places.
[2023-03-23 21:01:55] [INFO ] Redundant transitions in 211 ms returned []
[2023-03-23 21:01:55] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-23 21:01:55] [INFO ] Invariant cache hit.
[2023-03-23 21:01:56] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16723 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-23 21:01:56] [INFO ] Computed 41 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 425 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2023-03-23 21:01:56] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
// Phase 1: matrix 2771 rows 946 cols
[2023-03-23 21:01:56] [INFO ] Computed 41 place invariants in 27 ms
[2023-03-23 21:01:56] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 21:01:56] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-23 21:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:01:57] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2023-03-23 21:01:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:01:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 21:01:57] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-23 21:01:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:01:58] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2023-03-23 21:01:58] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 21:01:59] [INFO ] [Nat]Added 1634 Read/Feed constraints in 880 ms returned sat
[2023-03-23 21:01:59] [INFO ] Deduced a trap composed of 208 places in 432 ms of which 1 ms to minimize.
[2023-03-23 21:02:00] [INFO ] Deduced a trap composed of 53 places in 469 ms of which 1 ms to minimize.
[2023-03-23 21:02:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1141 ms
[2023-03-23 21:02:00] [INFO ] Computed and/alt/rep : 1330/1912/1330 causal constraints (skipped 1379 transitions) in 167 ms.
[2023-03-23 21:02:00] [INFO ] Added : 11 causal constraints over 3 iterations in 662 ms. Result :sat
Minimization took 475 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 76 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 76 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-23 21:02:01] [INFO ] Computed 41 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 42668 resets, run finished after 10548 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4675 resets, run finished after 1785 ms. (steps per millisecond=560 ) properties (out of 1) seen :0
[2023-03-23 21:02:13] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
// Phase 1: matrix 2771 rows 946 cols
[2023-03-23 21:02:13] [INFO ] Computed 41 place invariants in 35 ms
[2023-03-23 21:02:14] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 21:02:14] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-23 21:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:02:14] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2023-03-23 21:02:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:02:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 21:02:14] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 1 ms returned sat
[2023-03-23 21:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:02:15] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2023-03-23 21:02:15] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 21:02:16] [INFO ] [Nat]Added 1634 Read/Feed constraints in 870 ms returned sat
[2023-03-23 21:02:17] [INFO ] Deduced a trap composed of 208 places in 465 ms of which 3 ms to minimize.
[2023-03-23 21:02:17] [INFO ] Deduced a trap composed of 53 places in 509 ms of which 1 ms to minimize.
[2023-03-23 21:02:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1203 ms
[2023-03-23 21:02:17] [INFO ] Computed and/alt/rep : 1330/1912/1330 causal constraints (skipped 1379 transitions) in 149 ms.
[2023-03-23 21:02:18] [INFO ] Added : 11 causal constraints over 3 iterations in 639 ms. Result :sat
Minimization took 468 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 86 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 86 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 84 ms. Remains 946 /946 variables (removed 0) and now considering 3169/3169 (removed 0) transitions.
[2023-03-23 21:02:19] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-23 21:02:19] [INFO ] Invariant cache hit.
[2023-03-23 21:02:20] [INFO ] Implicit Places using invariants in 990 ms returned []
[2023-03-23 21:02:20] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-23 21:02:20] [INFO ] Invariant cache hit.
[2023-03-23 21:02:20] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 21:02:36] [INFO ] Implicit Places using invariants and state equation in 16131 ms returned []
Implicit Place search using SMT with State Equation took 17134 ms to find 0 implicit places.
[2023-03-23 21:02:36] [INFO ] Redundant transitions in 133 ms returned []
[2023-03-23 21:02:36] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2023-03-23 21:02:36] [INFO ] Invariant cache hit.
[2023-03-23 21:02:37] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18559 ms. Remains : 946/946 places, 3169/3169 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04 in 41333 ms.
[2023-03-23 21:02:38] [INFO ] Flatten gal took : 284 ms
[2023-03-23 21:02:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 21:02:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 946 places, 3169 transitions and 15794 arcs took 19 ms.
Total runtime 174696 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/634/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15347904 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16088244 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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="ltsminxred"
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 ltsminxred"
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 r233-tall-167856419400765"
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 ;