Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r334-tall-171679080200368.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SafeBus-COL-06, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080200368
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.7K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716821322131

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
StateSpace COL
Running Version 202405141337
[2024-05-27 14:48:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 14:48:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 14:48:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 14:48:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 14:48:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 601 ms
[2024-05-27 14:48:44] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2024-05-27 14:48:44] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 25 ms.
[2024-05-27 14:48:44] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 45 ms.
[2024-05-27 14:48:44] [INFO ] Unfolded 0 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 12 places and 12 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 138/138 places, 451/451 transitions.
[2024-05-27 14:48:44] [INFO ] Redundant transitions in 33 ms returned []
Running 445 sub problems to find dead transitions.
[2024-05-27 14:48:44] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 14:48:44] [INFO ] Computed 29 invariants in 23 ms
[2024-05-27 14:48:44] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 14:48:46] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 14 ms to minimize.
[2024-05-27 14:48:46] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2024-05-27 14:48:47] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-27 14:48:47] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-27 14:48:48] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-27 14:48:48] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-27 14:48:48] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-27 14:48:48] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-27 14:48:48] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-27 14:48:48] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-27 14:48:48] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-27 14:48:48] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-27 14:48:49] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-05-27 14:48:49] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-27 14:48:49] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-27 14:48:49] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-27 14:48:49] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-27 14:48:49] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 18/47 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 14:48:51] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-27 14:48:51] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-27 14:48:51] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-27 14:48:51] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-27 14:48:51] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-27 14:48:51] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-27 14:48:51] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-27 14:48:51] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-05-27 14:48:51] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/56 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 14:48:54] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-27 14:48:54] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 2/58 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 14:48:55] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-05-27 14:48:56] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/60 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 14:48:56] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-27 14:48:56] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-27 14:48:56] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 3/63 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 14:48:59] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/64 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 242/380 variables, 138/202 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 43/245 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/245 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 12 (OVERLAPS) 0/380 variables, 0/245 constraints. Problems are: Problem set: 36 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 245 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 35/64 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 14:49:16] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-27 14:49:17] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 2/66 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 14:49:18] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/67 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 14:49:19] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 1/68 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/68 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 242/380 variables, 138/206 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 43/249 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 409/658 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 14:49:36] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/659 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 659 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/445 constraints, Known Traps: 40/40 constraints]
After SMT, in 60788ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60812ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 138/138 places, 415/451 transitions.
[2024-05-27 14:49:45] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 61031 ms. Remains : 138/138 places, 415/451 transitions.
Final net has 138 places and 415 transitions.
[2024-05-27 14:49:45] [INFO ] Flatten gal took : 72 ms
[2024-05-27 14:49:45] [INFO ] Applying decomposition
[2024-05-27 14:49:45] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2364287983071593225.txt' '-o' '/tmp/graph2364287983071593225.bin' '-w' '/tmp/graph2364287983071593225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2364287983071593225.bin' '-l' '-1' '-v' '-w' '/tmp/graph2364287983071593225.weights' '-q' '0' '-e' '0.001'
[2024-05-27 14:49:45] [INFO ] Decomposing Gal with order
[2024-05-27 14:49:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 14:49:45] [INFO ] Removed a total of 449 redundant transitions.
[2024-05-27 14:49:45] [INFO ] Flatten gal took : 126 ms
[2024-05-27 14:49:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 18 ms.
[2024-05-27 14:49:45] [INFO ] Time to serialize gal into /tmp/StateSpace573442096387573745.gal : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace573442096387573745.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...218
ITS-tools command line returned an error code 137
[2024-05-27 15:05:02] [INFO ] Applying decomposition
[2024-05-27 15:05:02] [INFO ] Flatten gal took : 33 ms
[2024-05-27 15:05:02] [INFO ] Decomposing Gal with order
[2024-05-27 15:05:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:05:02] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cable_free in partition [AMC_0],[AMC_1, wait_ack_1],[AMC_2, wait_ack_2],[AMC_3, wait_ack_3],[AMC_4, wait_ack_4],[AMC_5, wait_ack_5],[AMC_6, wait_ack_6],[AMC_7],[AMC_8, wait_ack_8],[AMC_9, wait_ack_9],[AMC_10, wait_ack_10],[AMC_11, wait_ack_11],[AMC_12, wait_ack_12],[AMC_13, wait_ack_13],[AMC_14],[AMC_15, wait_ack_15],[AMC_16, wait_ack_16],[AMC_17, wait_ack_17],[AMC_18, wait_ack_18],[AMC_19, wait_ack_19],[AMC_20, wait_ack_20],[AMC_21],[AMC_22, wait_ack_22],[AMC_23, wait_ack_23],[AMC_24, wait_ack_24],[AMC_25, wait_ack_25],[AMC_26, wait_ack_26],[AMC_27, wait_ack_27],[AMC_28],[AMC_29, wait_ack_29],[AMC_30, wait_ack_30],[AMC_31, wait_ack_31],[AMC_32, wait_ack_32],[AMC_33, wait_ack_33],[AMC_34, wait_ack_34],[AMC_35],[Cpt2_0, Cpt1_0, cable_used_0, FMC_0, wait_cable_0, listen_0, RMC_0, PMC_0, MSG_0, wait_msg_0, loop_em_0],[Cpt2_1, Cpt1_1, cable_used_1, FMC_1, wait_cable_1, listen_1, RMC_1, PMC_1, MSG_1, wait_msg_1, loop_em_1],[Cpt2_2, Cpt1_2, cable_used_2, FMC_2, wait_cable_2, listen_2, RMC_2, PMC_2, MSG_2, wait_msg_2, loop_em_2],[Cpt2_3, Cpt1_3, cable_used_3, FMC_3, wait_cable_3, listen_3, RMC_3, PMC_3, MSG_3, wait_msg_3, loop_em_3],[Cpt2_4, Cpt1_4, cable_used_4, FMC_4, wait_cable_4, listen_4, RMC_4, PMC_4, MSG_4, wait_msg_4, loop_em_4],[Cpt2_5, Cpt1_5, cable_used_5, FMC_5, wait_cable_5, listen_5, RMC_5, PMC_5, MSG_5, wait_msg_5, loop_em_5],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:519)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 15:05:02] [INFO ] Flatten gal took : 27 ms
[2024-05-27 15:05:02] [INFO ] Time to serialize gal into /tmp/StateSpace14895967198553115984.gal : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace14895967198553115984.gal' '-t' 'CGAL' '--stats' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...241
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_inst,6.81676e+06,170.308,2422396,2,242988,5,4.77838e+06,6,0,970,4.81911e+06,0
Total reachable state count : 6816756

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 17
STATE_SPACE MAX_TOKEN_PER_MARKING 23 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 6816756
STATE_SPACE STATES 6816756 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1151304 ms.

BK_STOP 1716822474675

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SafeBus-COL-06"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is SafeBus-COL-06, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r334-tall-171679080200368"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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