Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850300340.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 itstools
Input is FamilyReunion-COL-L00400M0040C020P020G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850300340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 5.8K Feb 27 00:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 27 00:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 22:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 22:11 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 4.1K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 27 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 27 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 27 09:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 27 09:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K 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-COL-L00400M0040C020P020G001-LTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679468841902

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00400M0040C020P020G001
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-22 07:07:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 07:07:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:07:23] [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.
[2023-03-22 07:07:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 07:07:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 747 ms
[2023-03-22 07:07:24] [INFO ] Detected 5 constant HL places corresponding to 106 PT places.
[2023-03-22 07:07:24] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 538109 PT places and 508890.0 transition bindings in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 07:07:24] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 7 ms.
[2023-03-22 07:07:24] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10052 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=402 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 66 rows 99 cols
[2023-03-22 07:07:24] [INFO ] Computed 33 place invariants in 10 ms
[2023-03-22 07:07:25] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-22 07:07:25] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-22 07:07:25] [INFO ] After 88ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:6
[2023-03-22 07:07:25] [INFO ] After 206ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 07:07:25] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 07:07:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-22 07:07:25] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-22 07:07:25] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 07:07:25] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-22 07:07:25] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Finished Parikh walk after 548 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=274 )
Parikh walk visited 15 properties in 347 ms.
[2023-03-22 07:07:26] [INFO ] Flatten gal took : 50 ms
[2023-03-22 07:07:26] [INFO ] Flatten gal took : 18 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 21
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 11
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
[2023-03-22 07:07:27] [INFO ] Unfolded HLPN to a Petri net with 477829 places and 412249 transitions 1184997 arcs in 1437 ms.
[2023-03-22 07:07:27] [INFO ] Unfolded 14 HLPN properties in 29 ms.
Deduced a syphon composed of 401 places in 1228 ms
Reduce places removed 467 places and 0 transitions.
Support contains 181294 out of 477362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477362/477362 places, 412249/412249 transitions.
Reduce places removed 1289 places and 0 transitions.
Discarding 49724 places :
Implicit places reduction removed 49724 places
Iterating post reduction 0 with 51013 rules applied. Total rules applied 51013 place count 426349 transition count 412249
Applied a total of 51013 rules in 85527 ms. Remains 426349 /477362 variables (removed 51013) and now considering 412249/412249 (removed 0) transitions.
// Phase 1: matrix 412249 rows 426349 cols
[2023-03-22 07:10:59] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:11:31] [INFO ] Implicit Places using invariants in 152081 ms returned []
Implicit Place search using SMT only with invariants took 152084 ms to find 0 implicit places.
// Phase 1: matrix 412249 rows 426349 cols
[2023-03-22 07:13:31] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:14:01] [INFO ] Dead Transitions using invariants and state equation in 150119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 426349/477362 places, 412249/412249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387757 ms. Remains : 426349/477362 places, 412249/412249 transitions.
Support contains 181294 out of 426349 places after structural reductions.
[2023-03-22 07:14:17] [INFO ] Flatten gal took : 11955 ms
[2023-03-22 07:14:37] [INFO ] Flatten gal took : 11658 ms
[2023-03-22 07:15:07] [INFO ] Input system was already deterministic with 412249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21495 ms. (steps per millisecond=0 ) properties (out of 25) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=1 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 543 ms. (steps per millisecond=1 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=1 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1205 ms. (steps per millisecond=0 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 412249 rows 426349 cols
[2023-03-22 07:17:38] [WARNING] Invariant computation timed out after 120 seconds.
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.verifyPossible(DeadlockTester.java:609)
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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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 07:18:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:18:04] [INFO ] After 25039ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 64962 out of 426349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426349/426349 places, 412249/412249 transitions.
Graph (complete) has 613129 edges and 426349 vertex of which 425927 are kept as prefixes of interest. Removing 422 places using SCC suffix rule.576 ms
Discarding 422 places :
Also discarding 422 output transitions
Drop transitions removed 422 transitions
Discarding 32882 places :
Implicit places reduction removed 32882 places
Drop transitions removed 165212 transitions
Trivial Post-agglo rules discarded 165212 transitions
Performed 165212 trivial Post agglomeration. Transition count delta: 165212
Iterating post reduction 0 with 198094 rules applied. Total rules applied 198095 place count 393045 transition count 246615
Reduce places removed 165212 places and 0 transitions.
Performed 3473 Post agglomeration using F-continuation condition.
Performed 6319 Post agglomeration using F-continuation condition.
Performed 9177 Post agglomeration using F-continuation condition.
Performed 12167 Post agglomeration using F-continuation condition.
Performed 15087 Post agglomeration using F-continuation condition.
Performed 18371 Post agglomeration using F-continuation condition.
Performed 22050 Post agglomeration using F-continuation condition.
Performed 25716 Post agglomeration using F-continuation condition.
Performed 26466 Post agglomeration using F-continuation condition.Transition count delta: 26466
Iterating post reduction 1 with 191678 rules applied. Total rules applied 389773 place count 227833 transition count 220149
Reduce places removed 26466 places and 0 transitions.
Iterating post reduction 2 with 26466 rules applied. Total rules applied 416239 place count 201367 transition count 220149
Performed 19248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19248 Pre rules applied. Total rules applied 416239 place count 201367 transition count 200901
Deduced a syphon composed of 19248 places in 214 ms
Ensure Unique test removed 802 places
Reduce places removed 20050 places and 0 transitions.
Iterating global reduction 3 with 39298 rules applied. Total rules applied 455537 place count 181317 transition count 200901
Discarding 401 places :
Implicit places reduction removed 401 places
Iterating post reduction 3 with 401 rules applied. Total rules applied 455938 place count 180916 transition count 200901
Performed 2764 Post agglomeration using F-continuation condition.
Performed 7103 Post agglomeration using F-continuation condition.
Performed 11403 Post agglomeration using F-continuation condition.
Performed 15612 Post agglomeration using F-continuation condition.
Performed 17644 Post agglomeration using F-continuation condition.Transition count delta: 17644
Deduced a syphon composed of 17644 places in 121 ms
[2023-03-22 07:29:14] [INFO ] Computed 62561 place invariants in 1214953 ms
Reduce places removed 17644 places and 0 transitions.
Iterating global reduction 4 with 35288 rules applied. Total rules applied 491226 place count 163272 transition count 183257
[2023-03-22 07:33:19] [INFO ] Computed 62561 place invariants in 1307939 ms
Free-agglomeration rule (complex) applied 34085 times.
Iterating global reduction 4 with 34085 rules applied. Total rules applied 525311 place count 163272 transition count 149172
Ensure Unique test removed 802 places
Reduce places removed 34887 places and 0 transitions.
Iterating post reduction 4 with 34887 rules applied. Total rules applied 560198 place count 128385 transition count 149172
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 560238 place count 128345 transition count 133132
Iterating global reduction 5 with 40 rules applied. Total rules applied 560278 place count 128345 transition count 133132
Applied a total of 560278 rules in 955147 ms. Remains 128345 /426349 variables (removed 298004) and now considering 133132/412249 (removed 279117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 955156 ms. Remains : 128345/426349 places, 133132/412249 transitions.
Computed a total of 426349 stabilizing places and 412249 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 426349 transition count 412249
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||!(!p0 U p1)||G(p2))))'
Support contains 17644 out of 426349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426349/426349 places, 412249/412249 transitions.
Graph (complete) has 613129 edges and 426349 vertex of which 418706 are kept as prefixes of interest. Removing 7643 places using SCC suffix rule.878 ms
Discarding 7643 places :
Also discarding 6838 output transitions
Drop transitions removed 6838 transitions
Reduce places removed 401 places and 401 transitions.
Discarding 49724 places :
Implicit places reduction removed 49724 places
Drop transitions removed 250224 transitions
Trivial Post-agglo rules discarded 250224 transitions
Performed 250224 trivial Post agglomeration. Transition count delta: 250224
Iterating post reduction 0 with 299948 rules applied. Total rules applied 299949 place count 368581 transition count 154786
Reduce places removed 250224 places and 0 transitions.
Performed 8421 Post agglomeration using F-continuation condition.Transition count delta: 8421
Iterating post reduction 1 with 258645 rules applied. Total rules applied 558594 place count 118357 transition count 146365
Reduce places removed 8421 places and 0 transitions.
Iterating post reduction 2 with 8421 rules applied. Total rules applied 567015 place count 109936 transition count 146365
Performed 2807 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2807 Pre rules applied. Total rules applied 567015 place count 109936 transition count 143558
Deduced a syphon composed of 2807 places in 72 ms
Ensure Unique test removed 1203 places
Reduce places removed 4010 places and 0 transitions.
Iterating global reduction 3 with 6817 rules applied. Total rules applied 573832 place count 105926 transition count 143558
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 573832 place count 105926 transition count 143157
Deduced a syphon composed of 401 places in 70 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 574634 place count 105525 transition count 143157
Performed 9832 Post agglomeration using F-continuation condition.
Performed 16776 Post agglomeration using F-continuation condition.
Performed 17243 Post agglomeration using F-continuation condition.Transition count delta: 17243
Deduced a syphon composed of 17243 places in 78 ms
Reduce places removed 17243 places and 0 transitions.
Iterating global reduction 3 with 34486 rules applied. Total rules applied 609120 place count 88282 transition count 125914
Applied a total of 609120 rules in 231276 ms. Remains 88282 /426349 variables (removed 338067) and now considering 125914/412249 (removed 286335) transitions.
// Phase 1: matrix 125914 rows 88282 cols
[2023-03-22 07:39:32] [INFO ] Computed 10428 place invariants in 98308 ms
[2023-03-22 07:39:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 07:39:39] [INFO ] Implicit Places using invariants in 104965 ms returned []
Implicit Place search using SMT only with invariants took 104966 ms to find 0 implicit places.
[2023-03-22 07:39:39] [INFO ] Invariant cache hit.
[2023-03-22 07:39:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 07:39:45] [INFO ] Dead Transitions using invariants and state equation in 6471 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88282/426349 places, 125914/412249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342719 ms. Remains : 88282/426349 places, 125914/412249 transitions.
Stuttering acceptance computed with spot in 390 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), p1, (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (OR (AND (GEQ s419 1) (GEQ s18063 1)) (AND (GEQ s715 1) (GEQ s18359 1)) (AND (GEQ s710 1) (GEQ s18354 1)) (AND (GEQ s429 1) (GEQ s18073 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1910 steps with 0 reset in 945 ms.
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-00 finished in 344652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&X(G(p1))))'
Support contains 9223 out of 426349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426349/426349 places, 412249/412249 transitions.
Discarding 50526 places :
Implicit places reduction removed 50526 places
Iterating post reduction 0 with 50526 rules applied. Total rules applied 50526 place count 375823 transition count 412249
[2023-03-22 07:40:08] [INFO ] Computed 62561 place invariants in 1469701 ms
Applied a total of 50526 rules in 33358 ms. Remains 375823 /426349 variables (removed 50526) and now considering 412249/412249 (removed 0) transitions.
// Phase 1: matrix 412249 rows 375823 cols
[2023-03-22 07:42:21] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:42:49] [INFO ] Implicit Places using invariants in 148129 ms returned []
Implicit Place search using SMT only with invariants took 148132 ms to find 0 implicit places.
// Phase 1: matrix 412249 rows 375823 cols
[2023-03-22 07:44:30] [INFO ] Computed 12035 place invariants in 249700 ms
[2023-03-22 07:44:49] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:45:16] [INFO ] Dead Transitions using invariants and state equation in 147622 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 375823/426349 places, 412249/412249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329150 ms. Remains : 375823/426349 places, 412249/412249 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s363401 1) (LT s363994 1)) (OR (LT s363621 1) (LT s368604 1)) (OR (LT s363645 1) (LT s369119 1)) (OR (LT s363502 1) (LT s366108 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 31 ms.
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-01 finished in 331040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 33283 out of 426349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426349/426349 places, 412249/412249 transitions.
Discarding 34085 places :
Implicit places reduction removed 34085 places
Iterating post reduction 0 with 34085 rules applied. Total rules applied 34085 place count 392264 transition count 412249
Applied a total of 34085 rules in 15882 ms. Remains 392264 /426349 variables (removed 34085) and now considering 412249/412249 (removed 0) transitions.
// Phase 1: matrix 412249 rows 392264 cols
[2023-03-22 07:46:42] [INFO ] Computed 12035 place invariants in 232926 ms
[2023-03-22 07:47:34] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:48:02] [INFO ] Implicit Places using invariants in 147925 ms returned []
Implicit Place search using SMT only with invariants took 147939 ms to find 0 implicit places.
// Phase 1: matrix 412249 rows 392264 cols
[2023-03-22 07:50:02] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:50:30] [INFO ] Dead Transitions using invariants and state equation in 147880 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392264/426349 places, 412249/412249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 311716 ms. Remains : 392264/426349 places, 412249/412249 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (GEQ s186972 1) (GEQ s187102 1) (GEQ s187232 1) (GEQ s187037 1) (GEQ s186907 1) (GEQ s187167 1) (GEQ s186956 1) (GEQ s187086 1) (GEQ s187216 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 22951 steps with 0 reset in 5712 ms.
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-02 finished in 319039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 401 out of 426349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426349/426349 places, 412249/412249 transitions.
Discarding 50526 places :
Implicit places reduction removed 50526 places
Iterating post reduction 0 with 50526 rules applied. Total rules applied 50526 place count 375823 transition count 412249
Applied a total of 50526 rules in 20180 ms. Remains 375823 /426349 variables (removed 50526) and now considering 412249/412249 (removed 0) transitions.
[2023-03-22 07:50:58] [INFO ] Invariant cache hit.
[2023-03-22 07:51:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 07:51:25] [INFO ] Implicit Places using invariants in 27676 ms returned []
Implicit Place search using SMT only with invariants took 27679 ms to find 0 implicit places.
[2023-03-22 07:51:25] [INFO ] Invariant cache hit.
[2023-03-22 07:51:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 07:51:53] [INFO ] Dead Transitions using invariants and state equation in 27484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 375823/426349 places, 412249/412249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75356 ms. Remains : 375823/426349 places, 412249/412249 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s372858 1) (LT s372923 1) (LT s372988 1) (LT s372679 1) (LT s372744 1) (LT s372809 1) (LT s372842 1) (LT s372907 1) (LT s372972 1) (LT s372663...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 4740 steps with 2370 reset in 10008 ms.
Product exploration timeout after 4760 steps with 2380 reset in 10015 ms.
Computed a total of 375823 stabilizing places and 412249 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 375823 transition count 412249
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
[2023-03-22 07:52:51] [INFO ] Computed 28476 place invariants in 436924 ms
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-03 finished in 143659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((G((p0 U p2))||p1)))))'
Support contains 34486 out of 426349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426349/426349 places, 412249/412249 transitions.
Discarding 33684 places :
Implicit places reduction removed 33684 places
Iterating post reduction 0 with 33684 rules applied. Total rules applied 33684 place count 392665 transition count 412249
Applied a total of 33684 rules in 28507 ms. Remains 392665 /426349 variables (removed 33684) and now considering 412249/412249 (removed 0) transitions.
// Phase 1: matrix 412249 rows 392665 cols
[2023-03-22 07:55:30] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:55:59] [INFO ] Implicit Places using invariants in 149113 ms returned []
Implicit Place search using SMT only with invariants took 149116 ms to find 0 implicit places.
// Phase 1: matrix 412249 rows 392665 cols
[2023-03-22 07:56:06] [INFO ] Computed 28476 place invariants in 483433 ms
[2023-03-22 07:57:59] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-22 07:58:51] [INFO ] Dead Transitions using invariants and state equation in 172020 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392665/426349 places, 412249/412249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349825 ms. Remains : 392665/426349 places, 412249/412249 transitions.
Stuttering acceptance computed with spot in 916 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00400M0040C020P020G001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s102669 1) (GEQ s119912 1)) (AND (GEQ s102664 1) (GEQ s119907 1)) (AND (GEQ s102960 1) (GEQ s120203 1)) (AND (GEQ s102965 1) (GEQ s120208...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 11470 steps with 0 reset in 10008 ms.
Product exploration timeout after 11930 steps with 0 reset in 10006 ms.
[2023-03-22 08:01:34] [INFO ] Computed 28877 place invariants in 484786 ms
Computed a total of 392665 stabilizing places and 412249 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 392665 transition count 412249
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
[2023-03-22 08:03:59] [INFO ] Computed 28877 place invariants in 479980 ms

BK_STOP 1679472286695

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="FamilyReunion-COL-L00400M0040C020P020G001"
export BK_EXAMINATION="LTLFireability"
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-5348"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00400M0040C020P020G001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838850300340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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