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

About the Execution of LTSMin+red for FlexibleBarrier-PT-18b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1084.531 3600000.00 14258083.00 370.00 FFF?TT????TT???T 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.r169-tall-167838856100567.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 FlexibleBarrier-PT-18b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856100567
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 12:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678571270180

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 21:47:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 21:47:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 21:47:52] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2023-03-11 21:47:52] [INFO ] Transformed 4370 places.
[2023-03-11 21:47:52] [INFO ] Transformed 5037 transitions.
[2023-03-11 21:47:52] [INFO ] Found NUPN structural information;
[2023-03-11 21:47:52] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 81 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 16) seen :2
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 5037 rows 4370 cols
[2023-03-11 21:47:53] [INFO ] Computed 20 place invariants in 163 ms
[2023-03-11 21:47:56] [INFO ] After 2087ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-11 21:47:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 45 ms returned sat
[2023-03-11 21:48:06] [INFO ] After 8154ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2023-03-11 21:48:10] [INFO ] Deduced a trap composed of 176 places in 1941 ms of which 14 ms to minimize.
[2023-03-11 21:48:12] [INFO ] Deduced a trap composed of 1500 places in 1811 ms of which 2 ms to minimize.
[2023-03-11 21:48:14] [INFO ] Deduced a trap composed of 1540 places in 1644 ms of which 11 ms to minimize.
[2023-03-11 21:48:16] [INFO ] Deduced a trap composed of 1496 places in 1454 ms of which 3 ms to minimize.
[2023-03-11 21:48:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7812 ms
[2023-03-11 21:48:17] [INFO ] Deduced a trap composed of 261 places in 224 ms of which 1 ms to minimize.
[2023-03-11 21:48:17] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 0 ms to minimize.
[2023-03-11 21:48:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 857 ms
[2023-03-11 21:48:24] [INFO ] Deduced a trap composed of 14 places in 3699 ms of which 4 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-11 21:48:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 21:48:24] [INFO ] After 28736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 11 different solutions.
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 149 ms.
Support contains 168 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 3265 edges and 4370 vertex of which 48 / 4370 are part of one of the 8 SCC in 22 ms
Free SCC test removed 40 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 728 transitions
Trivial Post-agglo rules discarded 728 transitions
Performed 728 trivial Post agglomeration. Transition count delta: 728
Iterating post reduction 0 with 728 rules applied. Total rules applied 729 place count 4330 transition count 4261
Reduce places removed 728 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 750 rules applied. Total rules applied 1479 place count 3602 transition count 4239
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1501 place count 3580 transition count 4239
Performed 562 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 562 Pre rules applied. Total rules applied 1501 place count 3580 transition count 3677
Deduced a syphon composed of 562 places in 6 ms
Reduce places removed 562 places and 0 transitions.
Iterating global reduction 3 with 1124 rules applied. Total rules applied 2625 place count 3018 transition count 3677
Discarding 1689 places :
Symmetric choice reduction at 3 with 1689 rule applications. Total rules 4314 place count 1329 transition count 1988
Iterating global reduction 3 with 1689 rules applied. Total rules applied 6003 place count 1329 transition count 1988
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6004 place count 1329 transition count 1987
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 6004 place count 1329 transition count 1984
Deduced a syphon composed of 3 places in 16 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 6010 place count 1326 transition count 1984
Discarding 224 places :
Symmetric choice reduction at 4 with 224 rule applications. Total rules 6234 place count 1102 transition count 1760
Iterating global reduction 4 with 224 rules applied. Total rules applied 6458 place count 1102 transition count 1760
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Iterating post reduction 4 with 207 rules applied. Total rules applied 6665 place count 1102 transition count 1553
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 5 with 254 rules applied. Total rules applied 6919 place count 975 transition count 1426
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 6933 place count 968 transition count 1426
Free-agglomeration rule applied 210 times.
Iterating global reduction 5 with 210 rules applied. Total rules applied 7143 place count 968 transition count 1216
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 5 with 210 rules applied. Total rules applied 7353 place count 758 transition count 1216
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 7356 place count 755 transition count 1213
Iterating global reduction 6 with 3 rules applied. Total rules applied 7359 place count 755 transition count 1213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 7362 place count 755 transition count 1210
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 7387 place count 755 transition count 1185
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 7397 place count 755 transition count 1185
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 7398 place count 755 transition count 1185
Applied a total of 7398 rules in 1037 ms. Remains 755 /4370 variables (removed 3615) and now considering 1185/5037 (removed 3852) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1039 ms. Remains : 755/4370 places, 1185/5037 transitions.
Incomplete random walk after 10000 steps, including 244 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 184081 steps, run timeout after 3005 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184081 steps, saw 87382 distinct states, run finished after 3009 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-11 21:48:29] [INFO ] Flow matrix only has 1163 transitions (discarded 22 similar events)
// Phase 1: matrix 1163 rows 755 cols
[2023-03-11 21:48:29] [INFO ] Computed 20 place invariants in 22 ms
[2023-03-11 21:48:29] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 21:48:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-11 21:48:31] [INFO ] After 1043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 21:48:31] [INFO ] State equation strengthened by 174 read => feed constraints.
[2023-03-11 21:48:32] [INFO ] After 860ms SMT Verify possible using 174 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-11 21:48:33] [INFO ] Deduced a trap composed of 332 places in 227 ms of which 1 ms to minimize.
[2023-03-11 21:48:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-11 21:48:33] [INFO ] After 2197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 948 ms.
[2023-03-11 21:48:34] [INFO ] After 4470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 6 ms.
Support contains 168 out of 755 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 1185/1185 transitions.
Applied a total of 0 rules in 26 ms. Remains 755 /755 variables (removed 0) and now considering 1185/1185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 755/755 places, 1185/1185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 1185/1185 transitions.
Applied a total of 0 rules in 24 ms. Remains 755 /755 variables (removed 0) and now considering 1185/1185 (removed 0) transitions.
[2023-03-11 21:48:34] [INFO ] Flow matrix only has 1163 transitions (discarded 22 similar events)
[2023-03-11 21:48:34] [INFO ] Invariant cache hit.
[2023-03-11 21:48:34] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-11 21:48:34] [INFO ] Flow matrix only has 1163 transitions (discarded 22 similar events)
[2023-03-11 21:48:34] [INFO ] Invariant cache hit.
[2023-03-11 21:48:35] [INFO ] State equation strengthened by 174 read => feed constraints.
[2023-03-11 21:48:35] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
[2023-03-11 21:48:35] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-11 21:48:35] [INFO ] Flow matrix only has 1163 transitions (discarded 22 similar events)
[2023-03-11 21:48:35] [INFO ] Invariant cache hit.
[2023-03-11 21:48:36] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2031 ms. Remains : 755/755 places, 1185/1185 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 755 transition count 1149
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 63 place count 741 transition count 1136
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 136 place count 668 transition count 1063
Iterating global reduction 2 with 73 rules applied. Total rules applied 209 place count 668 transition count 1063
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 2 with 57 rules applied. Total rules applied 266 place count 668 transition count 1006
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 668 transition count 1005
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 269 place count 668 transition count 1005
Applied a total of 269 rules in 86 ms. Remains 668 /755 variables (removed 87) and now considering 1005/1185 (removed 180) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1005 rows 668 cols
[2023-03-11 21:48:36] [INFO ] Computed 20 place invariants in 18 ms
[2023-03-11 21:48:36] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 21:48:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-11 21:48:37] [INFO ] After 881ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 21:48:38] [INFO ] Deduced a trap composed of 260 places in 191 ms of which 1 ms to minimize.
[2023-03-11 21:48:39] [INFO ] Deduced a trap composed of 282 places in 188 ms of which 1 ms to minimize.
[2023-03-11 21:48:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 493 ms
[2023-03-11 21:48:39] [INFO ] After 2241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 668 ms.
[2023-03-11 21:48:39] [INFO ] After 3153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-11 21:48:39] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-11 21:48:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 755 places, 1185 transitions and 4129 arcs took 9 ms.
[2023-03-11 21:48:40] [INFO ] Flatten gal took : 181 ms
Total runtime 48604 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 --inv-bin-par --invariant=/tmp/521/inv_0_ --invariant=/tmp/521/inv_1_ --invariant=/tmp/521/inv_2_ --invariant=/tmp/521/inv_3_ --invariant=/tmp/521/inv_4_ --invariant=/tmp/521/inv_5_ --invariant=/tmp/521/inv_6_ --invariant=/tmp/521/inv_7_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 15062140 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098476 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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