About the Execution of LTSMin+red for JoinFreeModules-PT-1000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16023.516 | 3600000.00 | 14130000.00 | 593.10 | FTFTFFTFTFTTFTTT | 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-167856418600214.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 JoinFreeModules-PT-1000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418600214
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-00
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-01
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-02
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-03
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-04
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-05
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-06
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-07
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-08
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-09
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679472882457
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=JoinFreeModules-PT-1000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 08:14:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 08:14:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 08:14:44] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2023-03-22 08:14:44] [INFO ] Transformed 5001 places.
[2023-03-22 08:14:44] [INFO ] Transformed 8001 transitions.
[2023-03-22 08:14:44] [INFO ] Parsed PT model containing 5001 places and 8001 transitions and 23002 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10015 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 12) seen :1
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 11) seen :1
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 10) seen :1
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 9) seen :1
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 8 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2023-03-22 08:14:51] [INFO ] Computed 1000 place invariants in 61 ms
[2023-03-22 08:14:52] [INFO ] After 1283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 08:14:54] [INFO ] [Nat]Absence check using 1000 positive place invariants in 249 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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-22 08:15:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:15:18] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 133 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 640 are kept as prefixes of interest. Removing 4360 places using SCC suffix rule.13 ms
Discarding 4360 places :
Also discarding 6976 output transitions
Drop transitions removed 6976 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 640 transition count 1024
Applied a total of 2 rules in 121 ms. Remains 640 /5000 variables (removed 4360) and now considering 1024/8001 (removed 6977) transitions.
// Phase 1: matrix 1024 rows 640 cols
[2023-03-22 08:15:18] [INFO ] Computed 128 place invariants in 4 ms
[2023-03-22 08:15:18] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 640/5000 places, 1024/8001 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 105944 steps, run timeout after 3002 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105944 steps, saw 105334 distinct states, run finished after 3005 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-22 08:15:22] [INFO ] Invariant cache hit.
[2023-03-22 08:15:22] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 08:15:22] [INFO ] [Nat]Absence check using 128 positive place invariants in 18 ms returned sat
[2023-03-22 08:15:25] [INFO ] After 3155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 08:15:25] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-03-22 08:15:28] [INFO ] After 2785ms SMT Verify possible using 128 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 08:15:29] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 13 ms to minimize.
[2023-03-22 08:15:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 08:15:29] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 08:15:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-22 08:15:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 08:15:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-22 08:15:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 08:15:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 08:15:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 814 ms
[2023-03-22 08:15:30] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-22 08:15:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 08:15:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 08:15:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 08:15:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-22 08:15:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 592 ms
[2023-03-22 08:15:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-22 08:15:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-22 08:15:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-03-22 08:15:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 08:15:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 08:15:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2023-03-22 08:15:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 08:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-22 08:15:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-22 08:15:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 08:15:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2023-03-22 08:15:33] [INFO ] After 7554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3728 ms.
[2023-03-22 08:15:37] [INFO ] After 14665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 16004 ms.
Support contains 40 out of 640 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 640/640 places, 1024/1024 transitions.
Graph (complete) has 1536 edges and 640 vertex of which 200 are kept as prefixes of interest. Removing 440 places using SCC suffix rule.2 ms
Discarding 440 places :
Also discarding 704 output transitions
Drop transitions removed 704 transitions
Applied a total of 1 rules in 10 ms. Remains 200 /640 variables (removed 440) and now considering 320/1024 (removed 704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 200/640 places, 320/1024 transitions.
Incomplete random walk after 10017 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=477 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 663473 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 663473 steps, saw 649259 distinct states, run finished after 3002 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 320 rows 200 cols
[2023-03-22 08:15:56] [INFO ] Computed 40 place invariants in 9 ms
[2023-03-22 08:15:56] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:15:56] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2023-03-22 08:15:56] [INFO ] After 493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:15:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 08:15:57] [INFO ] After 309ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:15:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 08:15:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-22 08:15:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2023-03-22 08:15:57] [INFO ] After 769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-22 08:15:57] [INFO ] After 1491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 41993 steps, including 0 resets, run visited all 1 properties in 258 ms. (steps per millisecond=162 )
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 258 ms.
All properties solved without resorting to model-checking.
Total runtime 73935 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/547/inv_0_ --invariant=/tmp/547/inv_1_ --invariant=/tmp/547/inv_2_ --invariant=/tmp/547/inv_3_ --invariant=/tmp/547/inv_4_ --invariant=/tmp/547/inv_5_ --invariant=/tmp/547/inv_6_ --invariant=/tmp/547/inv_7_ --invariant=/tmp/547/inv_8_ --invariant=/tmp/547/inv_9_ --invariant=/tmp/547/inv_10_ --invariant=/tmp/547/inv_11_ --invariant=/tmp/547/inv_12_ --invariant=/tmp/547/inv_13_ --invariant=/tmp/547/inv_14_ --invariant=/tmp/547/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9593800 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16119668 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 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="JoinFreeModules-PT-1000"
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 JoinFreeModules-PT-1000, 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 r233-tall-167856418600214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-1000.tgz
mv JoinFreeModules-PT-1000 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 '
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 ;