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.r521-tall-167987246400278.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 EisenbergMcGuire-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 31 16:48 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680852972226

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 07:36:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 07:36:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 07:36:18] [INFO ] Load time of PNML (sax parser for PT used): 569 ms
[2023-04-07 07:36:18] [INFO ] Transformed 1090 places.
[2023-04-07 07:36:18] [INFO ] Transformed 5200 transitions.
[2023-04-07 07:36:18] [INFO ] Found NUPN structural information;
[2023-04-07 07:36:18] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 1048 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 14) seen :4
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-04-07 07:36:20] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-07 07:36:20] [INFO ] Computed 31 invariants in 85 ms
[2023-04-07 07:36:22] [INFO ] After 2323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 07:36:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 159 ms returned sat
[2023-04-07 07:36:24] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 45 ms returned sat
[2023-04-07 07:36:32] [INFO ] After 7746ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-04-07 07:36:32] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-07 07:36:34] [INFO ] After 1853ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :1 sat :9
[2023-04-07 07:36:35] [INFO ] Deduced a trap composed of 3 places in 1257 ms of which 130 ms to minimize.
[2023-04-07 07:36:36] [INFO ] Deduced a trap composed of 3 places in 556 ms of which 1 ms to minimize.
[2023-04-07 07:36:41] [INFO ] Deduced a trap composed of 3 places in 5236 ms of which 34 ms to minimize.
[2023-04-07 07:36:42] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 6 ms to minimize.
[2023-04-07 07:36:47] [INFO ] Deduced a trap composed of 41 places in 4990 ms of which 24 ms to minimize.
[2023-04-07 07:36:47] [INFO ] Deduced a trap composed of 93 places in 240 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 07:36:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-07 07:36:47] [INFO ] After 25224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 345 ms.
Support contains 107 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1090 transition count 5192
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 1082 transition count 5191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 1081 transition count 5191
Performed 245 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 245 Pre rules applied. Total rules applied 18 place count 1081 transition count 4946
Deduced a syphon composed of 245 places in 5 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 508 place count 836 transition count 4946
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 589 place count 755 transition count 4136
Iterating global reduction 3 with 81 rules applied. Total rules applied 670 place count 755 transition count 4136
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 21 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 822 place count 679 transition count 4060
Applied a total of 822 rules in 1367 ms. Remains 679 /1090 variables (removed 411) and now considering 4060/5200 (removed 1140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1381 ms. Remains : 679/1090 places, 4060/5200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 119570 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{0=1, 1=1, 4=1, 6=1, 8=1}
Probabilistic random walk after 119570 steps, saw 91771 distinct states, run finished after 3004 ms. (steps per millisecond=39 ) properties seen :5
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
[2023-04-07 07:36:53] [INFO ] Flow matrix only has 1190 transitions (discarded 2870 similar events)
// Phase 1: matrix 1190 rows 679 cols
[2023-04-07 07:36:53] [INFO ] Computed 31 invariants in 13 ms
[2023-04-07 07:36:53] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 07:36:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2023-04-07 07:36:53] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 24 ms returned sat
[2023-04-07 07:36:54] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 07:36:54] [INFO ] State equation strengthened by 517 read => feed constraints.
[2023-04-07 07:36:55] [INFO ] After 567ms SMT Verify possible using 517 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 07:36:55] [INFO ] Deduced a trap composed of 3 places in 381 ms of which 1 ms to minimize.
[2023-04-07 07:36:56] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 15 ms to minimize.
[2023-04-07 07:36:56] [INFO ] Deduced a trap composed of 45 places in 559 ms of which 1 ms to minimize.
[2023-04-07 07:36:57] [INFO ] Deduced a trap composed of 41 places in 536 ms of which 1 ms to minimize.
[2023-04-07 07:36:58] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 1 ms to minimize.
[2023-04-07 07:36:58] [INFO ] Deduced a trap composed of 63 places in 380 ms of which 1 ms to minimize.
[2023-04-07 07:36:58] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 1 ms to minimize.
[2023-04-07 07:36:59] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 1 ms to minimize.
[2023-04-07 07:36:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3768 ms
[2023-04-07 07:36:59] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 0 ms to minimize.
[2023-04-07 07:36:59] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 1 ms to minimize.
[2023-04-07 07:37:00] [INFO ] Deduced a trap composed of 35 places in 576 ms of which 1 ms to minimize.
[2023-04-07 07:37:00] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-04-07 07:37:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1436 ms
[2023-04-07 07:37:01] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 0 ms to minimize.
[2023-04-07 07:37:01] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2023-04-07 07:37:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 428 ms
[2023-04-07 07:37:01] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 1 ms to minimize.
[2023-04-07 07:37:01] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 6 ms to minimize.
[2023-04-07 07:37:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 466 ms
[2023-04-07 07:37:01] [INFO ] After 6998ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 269 ms.
[2023-04-07 07:37:02] [INFO ] After 8429ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 34 out of 679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 4060/4060 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 679 transition count 4059
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 678 transition count 4059
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 2 place count 678 transition count 4016
Deduced a syphon composed of 43 places in 17 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 88 place count 635 transition count 4016
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 630 transition count 3966
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 630 transition count 3966
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 114 place count 622 transition count 3958
Applied a total of 114 rules in 743 ms. Remains 622 /679 variables (removed 57) and now considering 3958/4060 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 743 ms. Remains : 622/679 places, 3958/4060 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 80564 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80564 steps, saw 61006 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 07:37:06] [INFO ] Flow matrix only has 1088 transitions (discarded 2870 similar events)
// Phase 1: matrix 1088 rows 622 cols
[2023-04-07 07:37:06] [INFO ] Computed 31 invariants in 17 ms
[2023-04-07 07:37:06] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 07:37:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2023-04-07 07:37:06] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 73 ms returned sat
[2023-04-07 07:37:07] [INFO ] After 639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 07:37:07] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 07:37:08] [INFO ] After 487ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 07:37:08] [INFO ] Deduced a trap composed of 39 places in 370 ms of which 1 ms to minimize.
[2023-04-07 07:37:08] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 1 ms to minimize.
[2023-04-07 07:37:09] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 0 ms to minimize.
[2023-04-07 07:37:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 995 ms
[2023-04-07 07:37:10] [INFO ] Deduced a trap composed of 3 places in 1594 ms of which 32 ms to minimize.
[2023-04-07 07:37:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1691 ms
[2023-04-07 07:37:11] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 0 ms to minimize.
[2023-04-07 07:37:11] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2023-04-07 07:37:11] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-04-07 07:37:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 693 ms
[2023-04-07 07:37:11] [INFO ] After 4137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-04-07 07:37:12] [INFO ] After 5368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 34 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 3958/3958 transitions.
Applied a total of 0 rules in 311 ms. Remains 622 /622 variables (removed 0) and now considering 3958/3958 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 622/622 places, 3958/3958 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 3958/3958 transitions.
Applied a total of 0 rules in 424 ms. Remains 622 /622 variables (removed 0) and now considering 3958/3958 (removed 0) transitions.
[2023-04-07 07:37:12] [INFO ] Flow matrix only has 1088 transitions (discarded 2870 similar events)
[2023-04-07 07:37:12] [INFO ] Invariant cache hit.
[2023-04-07 07:37:13] [INFO ] Implicit Places using invariants in 1144 ms returned []
[2023-04-07 07:37:13] [INFO ] Flow matrix only has 1088 transitions (discarded 2870 similar events)
[2023-04-07 07:37:13] [INFO ] Invariant cache hit.
[2023-04-07 07:37:14] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 07:37:20] [INFO ] Implicit Places using invariants and state equation in 6645 ms returned []
Implicit Place search using SMT with State Equation took 7805 ms to find 0 implicit places.
[2023-04-07 07:37:20] [INFO ] Redundant transitions in 301 ms returned []
[2023-04-07 07:37:20] [INFO ] Flow matrix only has 1088 transitions (discarded 2870 similar events)
[2023-04-07 07:37:20] [INFO ] Invariant cache hit.
[2023-04-07 07:37:26] [INFO ] Dead Transitions using invariants and state equation in 5521 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14092 ms. Remains : 622/622 places, 3958/3958 transitions.
Graph (trivial) has 3575 edges and 622 vertex of which 88 / 622 are part of one of the 10 SCC in 8 ms
Free SCC test removed 78 places
Drop transitions removed 290 transitions
Ensure Unique test removed 2841 transitions
Reduce isomorphic transitions removed 3131 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 544 transition count 712
Reduce places removed 115 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 121 rules applied. Total rules applied 237 place count 429 transition count 706
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 243 place count 423 transition count 706
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 243 place count 423 transition count 696
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 263 place count 413 transition count 696
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 601 place count 244 transition count 527
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 3 with 82 rules applied. Total rules applied 683 place count 244 transition count 445
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 691 place count 240 transition count 469
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 695 place count 240 transition count 465
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 713 place count 240 transition count 447
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 717 place count 238 transition count 449
Free-agglomeration rule applied 64 times.
Iterating global reduction 5 with 64 rules applied. Total rules applied 781 place count 238 transition count 385
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 845 place count 174 transition count 385
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 852 place count 174 transition count 385
Applied a total of 852 rules in 214 ms. Remains 174 /622 variables (removed 448) and now considering 385/3958 (removed 3573) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 385 rows 174 cols
[2023-04-07 07:37:26] [INFO ] Computed 31 invariants in 3 ms
[2023-04-07 07:37:26] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 07:37:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 116 ms returned sat
[2023-04-07 07:37:27] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 105 ms returned sat
[2023-04-07 07:37:27] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 07:37:27] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2023-04-07 07:37:27] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2023-04-07 07:37:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2023-04-07 07:37:29] [INFO ] Deduced a trap composed of 3 places in 1239 ms of which 39 ms to minimize.
[2023-04-07 07:37:29] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 5 ms to minimize.
[2023-04-07 07:37:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1346 ms
[2023-04-07 07:37:29] [INFO ] After 1857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 193 ms.
[2023-04-07 07:37:29] [INFO ] After 2570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-04-07 07:37:29] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2023-04-07 07:37:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 622 places, 3958 transitions and 21196 arcs took 64 ms.
[2023-04-07 07:37:30] [INFO ] Flatten gal took : 570 ms
Total runtime 73389 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 --invariant=/tmp/611/inv_0_ --invariant=/tmp/611/inv_1_ --invariant=/tmp/611/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 14671100 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16099932 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="ReachabilityCardinality"
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 EisenbergMcGuire-PT-10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246400278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;