About the Execution of LTSMin+red for FamilyReunion-PT-L00100M0010C005P005G002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8235.628 | 2113719.00 | 2161466.00 | 5379.40 | TFTTTTTTFTTTTFTT | 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-167838855800423.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 FamilyReunion-PT-L00100M0010C005P005G002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855800423
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 290K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Feb 26 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Feb 26 12:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 170K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 700K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 327K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 869K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Feb 26 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.8M Feb 26 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17M 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 FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678542347653
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=FamilyReunion-PT-L00100M0010C005P005G002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 13:45:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 13:45:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 13:45:50] [INFO ] Load time of PNML (sax parser for PT used): 697 ms
[2023-03-11 13:45:50] [INFO ] Transformed 40605 places.
[2023-03-11 13:45:50] [INFO ] Transformed 36871 transitions.
[2023-03-11 13:45:50] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 943 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 193 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 31 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1018 ms. (steps per millisecond=9 ) properties (out of 16) seen :11
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :1
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 36871 rows 40574 cols
[2023-03-11 13:45:58] [INFO ] Computed 8805 place invariants in 5271 ms
[2023-03-11 13:46:08] [INFO ] [Real]Absence check using 300 positive place invariants in 905 ms returned sat
[2023-03-11 13:46:19] [INFO ] [Real]Absence check using 300 positive and 8505 generalized place invariants in 11624 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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 13:46:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 13:46:23] [INFO ] After 25098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 34 out of 40574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Graph (complete) has 65258 edges and 40574 vertex of which 38725 are kept as prefixes of interest. Removing 1849 places using SCC suffix rule.59 ms
Discarding 1849 places :
Also discarding 1507 output transitions
Drop transitions removed 1507 transitions
Drop transitions removed 304 transitions
Reduce isomorphic transitions removed 304 transitions.
Discarding 6662 places :
Implicit places reduction removed 6662 places
Drop transitions removed 19650 transitions
Trivial Post-agglo rules discarded 19650 transitions
Performed 19650 trivial Post agglomeration. Transition count delta: 19650
Iterating post reduction 0 with 26616 rules applied. Total rules applied 26617 place count 32063 transition count 15410
Reduce places removed 19650 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 19658 rules applied. Total rules applied 46275 place count 12413 transition count 15402
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 46283 place count 12405 transition count 15402
Performed 1922 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1922 Pre rules applied. Total rules applied 46283 place count 12405 transition count 13480
Deduced a syphon composed of 1922 places in 11 ms
Ensure Unique test removed 906 places
Reduce places removed 2828 places and 0 transitions.
Iterating global reduction 3 with 4750 rules applied. Total rules applied 51033 place count 9577 transition count 13480
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 601 transitions
Trivial Post-agglo rules discarded 601 transitions
Performed 601 trivial Post agglomeration. Transition count delta: 601
Iterating post reduction 3 with 604 rules applied. Total rules applied 51637 place count 9574 transition count 12879
Reduce places removed 601 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 604 rules applied. Total rules applied 52241 place count 8973 transition count 12876
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 52244 place count 8970 transition count 12876
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 52244 place count 8970 transition count 12875
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 52246 place count 8969 transition count 12875
Discarding 4643 places :
Symmetric choice reduction at 6 with 4643 rule applications. Total rules 56889 place count 4326 transition count 8034
Iterating global reduction 6 with 4643 rules applied. Total rules applied 61532 place count 4326 transition count 8034
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 203 places :
Implicit places reduction removed 203 places
Drop transitions removed 799 transitions
Trivial Post-agglo rules discarded 799 transitions
Performed 799 trivial Post agglomeration. Transition count delta: 799
Iterating post reduction 6 with 1507 rules applied. Total rules applied 63039 place count 4123 transition count 6730
Reduce places removed 799 places and 0 transitions.
Iterating post reduction 7 with 799 rules applied. Total rules applied 63838 place count 3324 transition count 6730
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 63838 place count 3324 transition count 6721
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 63856 place count 3315 transition count 6721
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 63871 place count 3300 transition count 5404
Iterating global reduction 8 with 15 rules applied. Total rules applied 63886 place count 3300 transition count 5404
Ensure Unique test removed 704 transitions
Reduce isomorphic transitions removed 704 transitions.
Iterating post reduction 8 with 704 rules applied. Total rules applied 64590 place count 3300 transition count 4700
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 64590 place count 3300 transition count 4699
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 64592 place count 3299 transition count 4699
Discarding 599 places :
Symmetric choice reduction at 9 with 599 rule applications. Total rules 65191 place count 2700 transition count 4100
Iterating global reduction 9 with 599 rules applied. Total rules applied 65790 place count 2700 transition count 4100
Ensure Unique test removed 598 transitions
Reduce isomorphic transitions removed 598 transitions.
Iterating post reduction 9 with 598 rules applied. Total rules applied 66388 place count 2700 transition count 3502
Performed 404 Post agglomeration using F-continuation condition.Transition count delta: 404
Deduced a syphon composed of 404 places in 1 ms
Reduce places removed 404 places and 0 transitions.
Iterating global reduction 10 with 808 rules applied. Total rules applied 67196 place count 2296 transition count 3098
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 67202 place count 2293 transition count 3100
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 67203 place count 2293 transition count 3099
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 67207 place count 2293 transition count 3095
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 67211 place count 2289 transition count 3095
Free-agglomeration rule (complex) applied 113 times.
Iterating global reduction 11 with 113 rules applied. Total rules applied 67324 place count 2289 transition count 3778
Ensure Unique test removed 97 places
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 11 with 210 rules applied. Total rules applied 67534 place count 2079 transition count 3778
Partial Free-agglomeration rule applied 204 times.
Drop transitions removed 204 transitions
Iterating global reduction 12 with 204 rules applied. Total rules applied 67738 place count 2079 transition count 3778
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 12 with 99 rules applied. Total rules applied 67837 place count 2079 transition count 3778
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 67838 place count 2078 transition count 3777
Applied a total of 67838 rules in 5197 ms. Remains 2078 /40574 variables (removed 38496) and now considering 3777/36871 (removed 33094) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5199 ms. Remains : 2078/40574 places, 3777/36871 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 4) seen :3
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3777 rows 2078 cols
[2023-03-11 13:46:29] [INFO ] Computed 519 place invariants in 55 ms
[2023-03-11 13:46:29] [INFO ] [Real]Absence check using 0 positive and 519 generalized place invariants in 125 ms returned sat
[2023-03-11 13:46:31] [INFO ] After 2312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 13:46:31] [INFO ] [Nat]Absence check using 0 positive and 519 generalized place invariants in 103 ms returned sat
[2023-03-11 13:46:33] [INFO ] After 1899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 13:46:34] [INFO ] After 2141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 487 ms.
[2023-03-11 13:46:34] [INFO ] After 2982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 355 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=27 )
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 16 ms.
All properties solved without resorting to model-checking.
Total runtime 45310 ms.
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/470/inv_0_ --invariant=/tmp/470/inv_1_ --invariant=/tmp/470/inv_2_ --invariant=/tmp/470/inv_3_ --invariant=/tmp/470/inv_4_ --invariant=/tmp/470/inv_5_ --invariant=/tmp/470/inv_6_ --invariant=/tmp/470/inv_7_ --invariant=/tmp/470/inv_8_ --invariant=/tmp/470/inv_9_ --invariant=/tmp/470/inv_10_ --invariant=/tmp/470/inv_11_ --invariant=/tmp/470/inv_12_ --invariant=/tmp/470/inv_13_ --invariant=/tmp/470/inv_14_ --invariant=/tmp/470/inv_15_ --inv-par
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-00
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-01
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-02
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-03
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-04
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-05
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-06
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-07
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-08
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-09
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-10
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-11
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-12
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-13
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-14
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-15
BK_STOP 1678544461372
--------------------
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
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_0_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-01
rfs formula type AG
rfs formula formula --invariant=/tmp/470/inv_1_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_2_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-03
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_3_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_4_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_5_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_6_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_7_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/470/inv_8_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_9_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-10
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_10_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_11_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_12_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-13
rfs formula type AG
rfs formula formula --invariant=/tmp/470/inv_13_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_14_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/470/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 40605 places, 36871 transitions and 112728 arcs
pnml2lts-sym: Petri net FamilyReunion-PT-L00100M0010C005P005G002 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 1.270 real 0.530 user 0.740 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 36871->36871 groups
pnml2lts-sym: Regrouping took 2054.910 real 2050.240 user 4.440 sys
pnml2lts-sym: state vector length is 40605; there are 36871 groups
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="FamilyReunion-PT-L00100M0010C005P005G002"
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 FamilyReunion-PT-L00100M0010C005P005G002, 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-167838855800423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00100M0010C005P005G002.tgz
mv FamilyReunion-PT-L00100M0010C005P005G002 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 '
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 ;