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.r461-smll-171701123100212.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 gold2023
Input is ViralEpidemic-PT-S03D1C1A08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701123100212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 11:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 11:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 11 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29M May 18 16:43 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 ViralEpidemic-PT-S03D1C1A08-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717218255694

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S03D1C1A08
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-01 05:04:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-01 05:04:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:04:21] [INFO ] Load time of PNML (sax parser for PT used): 2592 ms
[2024-06-01 05:04:21] [INFO ] Transformed 49206 places.
[2024-06-01 05:04:22] [INFO ] Transformed 68887 transitions.
[2024-06-01 05:04:22] [INFO ] Found NUPN structural information;
[2024-06-01 05:04:22] [INFO ] Parsed PT model containing 49206 places and 68887 transitions and 157456 arcs in 3363 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 49 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 386 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:05:24] [INFO ] Invariants computation overflowed in 60793 ms
[2024-06-01 05:05:35] [INFO ] Implicit Places using invariants in 71748 ms returned []
Implicit Place search using SMT only with invariants took 71790 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:06:41] [INFO ] Invariants computation overflowed in 66882 ms
[2024-06-01 05:06:51] [INFO ] Dead Transitions using invariants and state equation in 76841 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149038 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Support contains 31 out of 49206 places after structural reductions.
[2024-06-01 05:06:55] [INFO ] Flatten gal took : 3042 ms
[2024-06-01 05:06:58] [INFO ] Flatten gal took : 2260 ms
[2024-06-01 05:07:02] [INFO ] Input system was already deterministic with 68887 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 5964 ms. (steps per millisecond=1 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 412 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=2 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 369 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=2 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:08:09] [INFO ] Invariants computation overflowed in 55019 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-06-01 05:08:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-01 05:08:35] [INFO ] After 25301ms 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 28 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 251 are kept as prefixes of interest. Removing 48955 places using SCC suffix rule.107 ms
Discarding 48955 places :
Also discarding 68240 output transitions
Drop transitions removed 68240 transitions
Drop transitions removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 511 rules applied. Total rules applied 512 place count 251 transition count 136
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 603 place count 160 transition count 136
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 603 place count 160 transition count 121
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 633 place count 145 transition count 121
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 674 place count 104 transition count 80
Iterating global reduction 2 with 41 rules applied. Total rules applied 715 place count 104 transition count 80
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 779 place count 72 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 780 place count 71 transition count 47
Ensure Unique test removed 13 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 793 place count 58 transition count 47
Applied a total of 793 rules in 449 ms. Remains 58 /49206 variables (removed 49148) and now considering 47/68887 (removed 68840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 449 ms. Remains : 58/49206 places, 47/68887 transitions.
Finished random walk after 154 steps, including 3 resets, run visited all 16 properties in 24 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(p2)))))))'
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 270 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:09:35] [INFO ] Invariants computation overflowed in 58991 ms
[2024-06-01 05:09:45] [INFO ] Implicit Places using invariants in 68775 ms returned []
Implicit Place search using SMT only with invariants took 68785 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:10:42] [INFO ] Invariants computation overflowed in 56797 ms
[2024-06-01 05:10:52] [INFO ] Dead Transitions using invariants and state equation in 66741 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135809 ms. Remains : 49206/49206 places, 68887/68887 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 513 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s45968 0) (EQ s25663 1)), p1:(EQ s47612 1), p2:(OR (EQ s8279 0) (EQ s12550 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1931 steps with 12 reset in 866 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01 finished in 137529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(p1))))))'
Support contains 3 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 105 are kept as prefixes of interest. Removing 49101 places using SCC suffix rule.97 ms
Discarding 49101 places :
Also discarding 68695 output transitions
Drop transitions removed 68695 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 104 transition count 183
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 42 place count 71 transition count 100
Iterating global reduction 1 with 33 rules applied. Total rules applied 75 place count 71 transition count 100
Graph (complete) has 44 edges and 71 vertex of which 69 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 69 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 69 transition count 97
Applied a total of 77 rules in 207 ms. Remains 69 /49206 variables (removed 49137) and now considering 97/68887 (removed 68790) transitions.
// Phase 1: matrix 97 rows 69 cols
[2024-06-01 05:10:53] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 05:10:54] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 05:10:54] [INFO ] Invariant cache hit.
[2024-06-01 05:10:54] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-06-01 05:10:54] [INFO ] Redundant transitions in 47 ms returned [12, 20, 46, 50, 82, 84, 86, 88]
Found 8 redundant transitions using SMT.
Drop transitions removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
// Phase 1: matrix 89 rows 69 cols
[2024-06-01 05:10:54] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 05:10:54] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/49206 places, 89/68887 transitions.
Graph (complete) has 42 edges and 69 vertex of which 61 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 61 /69 variables (removed 8) and now considering 81/89 (removed 8) transitions.
// Phase 1: matrix 81 rows 61 cols
[2024-06-01 05:10:54] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 05:10:54] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 05:10:54] [INFO ] Invariant cache hit.
[2024-06-01 05:10:54] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/49206 places, 81/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 669 ms. Remains : 61/49206 places, 81/68887 transitions.
Stuttering acceptance computed with spot in 129 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s16 1), p0:(OR (EQ s55 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02 finished in 859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 3 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 90 are kept as prefixes of interest. Removing 49116 places using SCC suffix rule.60 ms
Discarding 49116 places :
Also discarding 68720 output transitions
Drop transitions removed 68720 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 89 transition count 160
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 38 place count 58 transition count 81
Iterating global reduction 1 with 31 rules applied. Total rules applied 69 place count 58 transition count 81
Applied a total of 69 rules in 157 ms. Remains 58 /49206 variables (removed 49148) and now considering 81/68887 (removed 68806) transitions.
// Phase 1: matrix 81 rows 58 cols
[2024-06-01 05:10:54] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 05:10:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 05:10:54] [INFO ] Invariant cache hit.
[2024-06-01 05:10:54] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-06-01 05:10:54] [INFO ] Redundant transitions in 22 ms returned [25, 32, 53, 64]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 77 rows 58 cols
[2024-06-01 05:10:54] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 05:10:55] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/49206 places, 77/68887 transitions.
Graph (complete) has 33 edges and 58 vertex of which 54 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 3 ms. Remains 54 /58 variables (removed 4) and now considering 73/77 (removed 4) transitions.
// Phase 1: matrix 73 rows 54 cols
[2024-06-01 05:10:55] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 05:10:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 05:10:55] [INFO ] Invariant cache hit.
[2024-06-01 05:10:55] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/49206 places, 73/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 512 ms. Remains : 54/49206 places, 73/68887 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s47 1), p1:(OR (EQ s27 0) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3595 reset in 357 ms.
Product exploration explored 100000 steps with 3562 reset in 336 ms.
Computed a total of 54 stabilizing places and 73 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 73
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)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 25 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-03 finished in 1444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 6 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 301 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:11:57] [INFO ] Invariants computation overflowed in 61120 ms
[2024-06-01 05:12:07] [INFO ] Implicit Places using invariants in 70840 ms returned []
Implicit Place search using SMT only with invariants took 70841 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:13:11] [INFO ] Invariants computation overflowed in 63913 ms
[2024-06-01 05:13:20] [INFO ] Dead Transitions using invariants and state equation in 73543 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144691 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s33819 0) (EQ s1618 1) (OR (EQ s3248 0) (EQ s42248 1))), p0:(OR (EQ s41657 0) (EQ s942 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 20 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05 finished in 145086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 172 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:14:28] [INFO ] Invariants computation overflowed in 67214 ms
[2024-06-01 05:14:38] [INFO ] Implicit Places using invariants in 76855 ms returned []
Implicit Place search using SMT only with invariants took 76863 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:15:34] [INFO ] Invariants computation overflowed in 56099 ms
[2024-06-01 05:15:43] [INFO ] Dead Transitions using invariants and state equation in 65273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142314 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07 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 (EQ s20535 0) (EQ s43604 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 213 steps with 0 reset in 131 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07 finished in 142798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(G(p0))&&F(((p0 U p2)||p1))))))))'
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 221 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:16:48] [INFO ] Invariants computation overflowed in 64369 ms
[2024-06-01 05:16:57] [INFO ] Implicit Places using invariants in 73673 ms returned []
Implicit Place search using SMT only with invariants took 73675 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:18:01] [INFO ] Invariants computation overflowed in 63798 ms
[2024-06-01 05:18:11] [INFO ] Dead Transitions using invariants and state equation in 73249 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147151 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s9316 0) (EQ s8791 1)), p2:(EQ s20104 1), p0:(OR (EQ s45826 0) (EQ s2953 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 25230 steps with 164 reset in 10002 ms.
Product exploration timeout after 18690 steps with 118 reset in 10005 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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)...)
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 4271 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 3210 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3203 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3685 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 52574 steps, run timeout after 42006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 52574 steps, saw 51076 distinct states, run finished after 42011 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:21:03] [INFO ] Invariants computation overflowed in 71077 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-06-01 05:21:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-01 05:21:29] [INFO ] After 25168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 56 are kept as prefixes of interest. Removing 49150 places using SCC suffix rule.20 ms
Discarding 49150 places :
Also discarding 68742 output transitions
Drop transitions removed 68742 transitions
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 56 transition count 23
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 151 place count 28 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 151 place count 28 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 25 transition count 20
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 18 transition count 13
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 18 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 13 transition count 8
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 182 place count 11 transition count 8
Applied a total of 182 rules in 103 ms. Remains 11 /49206 variables (removed 49195) and now considering 8/68887 (removed 68879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 11/49206 places, 8/68887 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 201 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:22:31] [INFO ] Invariants computation overflowed in 61451 ms
[2024-06-01 05:22:41] [INFO ] Implicit Places using invariants in 71526 ms returned []
Implicit Place search using SMT only with invariants took 71535 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:23:45] [INFO ] Invariants computation overflowed in 63137 ms
[2024-06-01 05:23:54] [INFO ] Dead Transitions using invariants and state equation in 72750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144489 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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)...)
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 4248 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 3377 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 3528 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3270 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 53196 steps, run timeout after 42016 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 53196 steps, saw 51675 distinct states, run finished after 42020 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:26:14] [INFO ] Invariants computation overflowed in 59956 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-06-01 05:26:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-01 05:26:39] [INFO ] After 25185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 56 are kept as prefixes of interest. Removing 49150 places using SCC suffix rule.19 ms
Discarding 49150 places :
Also discarding 68742 output transitions
Drop transitions removed 68742 transitions
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 56 transition count 23
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 151 place count 28 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 151 place count 28 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 25 transition count 20
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 18 transition count 13
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 18 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 13 transition count 8
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 182 place count 11 transition count 8
Applied a total of 182 rules in 94 ms. Remains 11 /49206 variables (removed 49195) and now considering 8/68887 (removed 68879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 11/49206 places, 8/68887 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 25990 steps with 182 reset in 10003 ms.
Product exploration timeout after 19590 steps with 125 reset in 10004 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 160 are kept as prefixes of interest. Removing 49046 places using SCC suffix rule.54 ms
Discarding 49046 places :
Also discarding 68586 output transitions
Drop transitions removed 68586 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 160 transition count 281
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 70 place count 111 transition count 159
Iterating global reduction 1 with 49 rules applied. Total rules applied 119 place count 111 transition count 159
Graph (complete) has 69 edges and 111 vertex of which 109 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 109 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 109 transition count 156
Applied a total of 121 rules in 192 ms. Remains 109 /49206 variables (removed 49097) and now considering 156/68887 (removed 68731) transitions.
[2024-06-01 05:27:01] [INFO ] Redundant transitions in 63 ms returned [18, 29, 36, 40, 47, 61, 70, 73, 78, 88, 95, 138, 142, 144]
Found 14 redundant transitions using SMT.
Drop transitions removed 14 transitions
Redundant transitions reduction (with SMT) removed 14 transitions.
// Phase 1: matrix 142 rows 109 cols
[2024-06-01 05:27:01] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 05:27:01] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/49206 places, 142/68887 transitions.
Graph (complete) has 67 edges and 109 vertex of which 95 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Applied a total of 1 rules in 5 ms. Remains 95 /109 variables (removed 14) and now considering 128/142 (removed 14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/49206 places, 128/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 417 ms. Remains : 95/49206 places, 128/68887 transitions.
Built C files in :
/tmp/ltsmin16003042494564481179
[2024-06-01 05:27:03] [INFO ] Built C files in 1113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16003042494564481179
Running compilation step : cd /tmp/ltsmin16003042494564481179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16003042494564481179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16003042494564481179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 137 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:28:08] [INFO ] Invariants computation overflowed in 62266 ms
[2024-06-01 05:28:18] [INFO ] Implicit Places using invariants in 71973 ms returned []
Implicit Place search using SMT only with invariants took 71977 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2024-06-01 05:29:23] [INFO ] Invariants computation overflowed in 64975 ms
[2024-06-01 05:29:32] [INFO ] Dead Transitions using invariants and state equation in 74631 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146751 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Built C files in :
/tmp/ltsmin14585089002219740921
[2024-06-01 05:29:33] [INFO ] Built C files in 794ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14585089002219740921
Running compilation step : cd /tmp/ltsmin14585089002219740921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14585089002219740921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14585089002219740921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-01 05:29:41] [INFO ] Flatten gal took : 1918 ms
[2024-06-01 05:29:43] [INFO ] Flatten gal took : 1846 ms
[2024-06-01 05:29:43] [INFO ] Time to serialize gal into /tmp/LTL2790282099706357068.gal : 416 ms
[2024-06-01 05:29:43] [INFO ] Time to serialize properties into /tmp/LTL12830967820978209411.prop : 0 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2790282099706357068.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12945309539552016266.hoa' '-atoms' '/tmp/LTL12830967820978209411.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2024-06-01 05:30:02] [INFO ] Flatten gal took : 1911 ms
[2024-06-01 05:30:04] [INFO ] Flatten gal took : 1880 ms
[2024-06-01 05:30:04] [INFO ] Time to serialize gal into /tmp/LTL7645335021561724591.gal : 244 ms
[2024-06-01 05:30:04] [INFO ] Time to serialize properties into /tmp/LTL10078703963045573344.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7645335021561724591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10078703963045573344.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-06-01 05:30:21] [INFO ] Flatten gal took : 1922 ms
[2024-06-01 05:30:21] [INFO ] Applying decomposition
[2024-06-01 05:30:23] [INFO ] Flatten gal took : 1851 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16396553740441084721.txt' '-o' '/tmp/graph16396553740441084721.bin' '-w' '/tmp/graph16396553740441084721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16396553740441084721.bin' '-l' '-1' '-v' '-w' '/tmp/graph16396553740441084721.weights' '-q' '0' '-e' '0.001'
[2024-06-01 05:30:29] [INFO ] Decomposing Gal with order
[2024-06-01 05:31:56] [INFO ] Rewriting arrays to variables to allow decomposition.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8769004 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16114856 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="ViralEpidemic-PT-S03D1C1A08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ViralEpidemic-PT-S03D1C1A08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r461-smll-171701123100212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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