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

About the Execution of ITS-Tools for FamilyReunion-PT-L00200M0020C010P010G005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11227.672 3600000.00 3780582.00 21252.40 T??????????????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850400426.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-PT-L00200M0020C010P010G005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850400426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 152M
-rw-r--r-- 1 mcc users 1.4M Feb 26 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.4M Feb 26 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7M Feb 26 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 26 15:55 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 608K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1018K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9M Feb 26 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17M Feb 26 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0M Feb 26 20:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32M Feb 26 20:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 126K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 367K 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 62M 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-L00200M0020C010P010G005-CTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679491389603

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00200M0020C010P010G005
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202303021504
[2023-03-22 13:23:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 13:23:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:23:13] [INFO ] Load time of PNML (sax parser for PT used): 1874 ms
[2023-03-22 13:23:13] [INFO ] Transformed 143908 places.
[2023-03-22 13:23:13] [INFO ] Transformed 134279 transitions.
[2023-03-22 13:23:13] [INFO ] Parsed PT model containing 143908 places and 134279 transitions and 411469 arcs in 2548 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 314 ms.
Reduce places removed 56 places and 0 transitions.
Support contains 93147 out of 143852 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143852/143852 places, 134279/134279 transitions.
Reduce places removed 674 places and 0 transitions.
Discarding 8438 places :
Implicit places reduction removed 8438 places
Iterating post reduction 0 with 9112 rules applied. Total rules applied 9112 place count 134740 transition count 134279
Discarding 1005 places :
Symmetric choice reduction at 1 with 1005 rule applications. Total rules 10117 place count 133735 transition count 132269
Iterating global reduction 1 with 1005 rules applied. Total rules applied 11122 place count 133735 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11127 place count 133730 transition count 131264
Iterating global reduction 1 with 5 rules applied. Total rules applied 11132 place count 133730 transition count 131264
Applied a total of 11132 rules in 7994 ms. Remains 133730 /143852 variables (removed 10122) and now considering 131264/134279 (removed 3015) transitions.
// Phase 1: matrix 131264 rows 133730 cols
[2023-03-22 13:25:35] [INFO ] Computed 21717 place invariants in 107659 ms
[2023-03-22 13:25:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:25:45] [INFO ] Implicit Places using invariants in 117791 ms returned []
Implicit Place search using SMT only with invariants took 117822 ms to find 0 implicit places.
[2023-03-22 13:25:45] [INFO ] Invariant cache hit.
[2023-03-22 13:25:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:25:55] [INFO ] Dead Transitions using invariants and state equation in 9899 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133730/143852 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135732 ms. Remains : 133730/143852 places, 131264/134279 transitions.
Support contains 93147 out of 133730 places after structural reductions.
[2023-03-22 13:26:01] [INFO ] Flatten gal took : 4092 ms
[2023-03-22 13:26:10] [INFO ] Flatten gal took : 3931 ms
[2023-03-22 13:26:23] [INFO ] Input system was already deterministic with 131264 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7379 ms. (steps per millisecond=1 ) properties (out of 81) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=7 ) properties (out of 48) 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 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=9 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 48) 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 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=2 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=4 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=5 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=3 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) 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 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) 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 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Running SMT prover for 48 properties.
[2023-03-22 13:26:38] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: 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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:611)
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.Application.startNoEx(Application.java:626)
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 13:27:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 13:27:03] [INFO ] After 25065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 48 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30621 out of 133730 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133730/133730 places, 131264/131264 transitions.
Graph (complete) has 202616 edges and 133730 vertex of which 133329 are kept as prefixes of interest. Removing 401 places using SCC suffix rule.187 ms
Discarding 401 places :
Also discarding 201 output transitions
Drop transitions removed 201 transitions
Drop transitions removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Discarding 12858 places :
Implicit places reduction removed 12858 places
Drop transitions removed 32511 transitions
Trivial Post-agglo rules discarded 32511 transitions
Performed 32511 trivial Post agglomeration. Transition count delta: 32511
Iterating post reduction 0 with 45769 rules applied. Total rules applied 45770 place count 120471 transition count 98152
Reduce places removed 32511 places and 0 transitions.
Performed 8453 Post agglomeration using F-continuation condition.Transition count delta: 8453
Iterating post reduction 1 with 40964 rules applied. Total rules applied 86734 place count 87960 transition count 89699
Reduce places removed 8453 places and 0 transitions.
Iterating post reduction 2 with 8453 rules applied. Total rules applied 95187 place count 79507 transition count 89699
Performed 4825 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4825 Pre rules applied. Total rules applied 95187 place count 79507 transition count 84874
Deduced a syphon composed of 4825 places in 88 ms
Ensure Unique test removed 2211 places
Reduce places removed 7036 places and 0 transitions.
Iterating global reduction 3 with 11861 rules applied. Total rules applied 107048 place count 72471 transition count 84874
Performed 5021 Post agglomeration using F-continuation condition.Transition count delta: 5021
Deduced a syphon composed of 5021 places in 77 ms
Reduce places removed 5021 places and 0 transitions.
Iterating global reduction 3 with 10042 rules applied. Total rules applied 117090 place count 67450 transition count 79853
Free-agglomeration rule applied 2188 times.
Iterating global reduction 3 with 2188 rules applied. Total rules applied 119278 place count 67450 transition count 77665
Ensure Unique test removed 197 places
Reduce places removed 2385 places and 0 transitions.
Ensure Unique test removed 1970 transitions
Reduce isomorphic transitions removed 1970 transitions.
Iterating post reduction 3 with 4355 rules applied. Total rules applied 123633 place count 65065 transition count 75695
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 197 Pre rules applied. Total rules applied 123633 place count 65065 transition count 75498
Deduced a syphon composed of 197 places in 53 ms
Ensure Unique test removed 197 places
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 4 with 591 rules applied. Total rules applied 124224 place count 64671 transition count 75498
Free-agglomeration rule (complex) applied 10631 times.
Iterating global reduction 4 with 10631 rules applied. Total rules applied 134855 place count 64671 transition count 64867
Ensure Unique test removed 201 places
Reduce places removed 10832 places and 0 transitions.
Iterating post reduction 4 with 10832 rules applied. Total rules applied 145687 place count 53839 transition count 64867
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 145706 place count 53820 transition count 61048
Iterating global reduction 5 with 19 rules applied. Total rules applied 145725 place count 53820 transition count 61048
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 145726 place count 53819 transition count 61047
Applied a total of 145726 rules in 67521 ms. Remains 53819 /133730 variables (removed 79911) and now considering 61047/131264 (removed 70217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67524 ms. Remains : 53819/133730 places, 61047/131264 transitions.
[2023-03-22 13:28:20] [INFO ] Flatten gal took : 3239 ms
[2023-03-22 13:28:30] [INFO ] Flatten gal took : 3839 ms
[2023-03-22 13:28:42] [INFO ] Input system was already deterministic with 131264 transitions.
Computed a total of 133730 stabilizing places and 131264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 133730 transition count 131264
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 133730/133730 places, 131264/131264 transitions.
Discarding 16888 places :
Implicit places reduction removed 16888 places
Iterating post reduction 0 with 16888 rules applied. Total rules applied 16888 place count 116842 transition count 131264
Applied a total of 16888 rules in 4444 ms. Remains 116842 /133730 variables (removed 16888) and now considering 131264/131264 (removed 0) transitions.
// Phase 1: matrix 131264 rows 116842 cols
[2023-03-22 13:29:24] [INFO ] Computed 4829 place invariants in 29034 ms
[2023-03-22 13:29:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:29:32] [INFO ] Implicit Places using invariants in 37682 ms returned []
Implicit Place search using SMT only with invariants took 37684 ms to find 0 implicit places.
[2023-03-22 13:29:32] [INFO ] Invariant cache hit.
[2023-03-22 13:29:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 13:29:41] [INFO ] Dead Transitions using invariants and state equation in 8468 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116842/133730 places, 131264/131264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50604 ms. Remains : 116842/133730 places, 131264/131264 transitions.
[2023-03-22 13:29:44] [INFO ] Flatten gal took : 2705 ms
[2023-03-22 13:29:47] [INFO ] Flatten gal took : 2876 ms
[2023-03-22 13:29:52] [INFO ] Input system was already deterministic with 131264 transitions.
[2023-03-22 13:29:55] [INFO ] Flatten gal took : 2864 ms
[2023-03-22 13:29:58] [INFO ] Flatten gal took : 2874 ms
[2023-03-22 13:29:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15509560832813545689.gal : 420 ms
[2023-03-22 13:29:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11803318891465083107.ctl : 44 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.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15509560832813545689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11803318891465083107.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
Detected timeout of ITS tools.
[2023-03-22 13:30:31] [INFO ] Flatten gal took : 2674 ms
[2023-03-22 13:30:31] [INFO ] Applying decomposition
[2023-03-22 13:30:34] [INFO ] Flatten gal took : 2822 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5508333490898450195.txt' '-o' '/tmp/graph5508333490898450195.bin' '-w' '/tmp/graph5508333490898450195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5508333490898450195.bin' '-l' '-1' '-v' '-w' '/tmp/graph5508333490898450195.weights' '-q' '0' '-e' '0.001'
[2023-03-22 13:30:47] [INFO ] Decomposing Gal with order
[2023-03-22 13:34:53] [INFO ] Rewriting arrays to variables to allow decomposition.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9837436 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15913536 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-PT-L00200M0020C010P010G005"
export BK_EXAMINATION="CTLFireability"
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-PT-L00200M0020C010P010G005, examination is CTLFireability"
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-167838850400426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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