Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r485-tall-167912700501251.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ViralEpidemic-PT-S02D1C1A12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912700501251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 11K Feb 25 22:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 22:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 20:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 23:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 25 23:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 22:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 22:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 19M Mar 5 18:23 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-S02D1C1A12-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679331624083

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S02D1C1A12
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-20 17:00:25] [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]
[2023-03-20 17:00:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 17:00:27] [INFO ] Load time of PNML (sax parser for PT used): 2105 ms
[2023-03-20 17:00:28] [INFO ] Transformed 32765 places.
[2023-03-20 17:00:28] [INFO ] Transformed 40955 transitions.
[2023-03-20 17:00:28] [INFO ] Parsed PT model containing 32765 places and 40955 transitions and 90101 arcs in 2579 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3918 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:00:42] [INFO ] Invariants computation overflowed in 9830 ms
[2023-03-20 17:00:44] [INFO ] Implicit Places using invariants in 12569 ms returned []
Implicit Place search using SMT only with invariants took 12593 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:00:54] [INFO ] Invariants computation overflowed in 9262 ms
[2023-03-20 17:00:56] [INFO ] Dead Transitions using invariants and state equation in 11969 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28491 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Support contains 54 out of 32765 places after structural reductions.
[2023-03-20 17:00:58] [INFO ] Flatten gal took : 1339 ms
[2023-03-20 17:00:59] [INFO ] Flatten gal took : 1086 ms
[2023-03-20 17:01:01] [INFO ] Input system was already deterministic with 40955 transitions.
Incomplete random walk after 10000 steps, including 932 resets, run finished after 2720 ms. (steps per millisecond=3 ) properties (out of 34) seen :3
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 218 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 219 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 214 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 206 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 208 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 217 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 236 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 284 ms. (steps per millisecond=3 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 209 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 214 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 213 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 207 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 211 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 208 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 207 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 243 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 286 ms. (steps per millisecond=3 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 211 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 214 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 208 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 220 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 213 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Interrupted probabilistic random walk after 47212 steps, run timeout after 27008 ms. (steps per millisecond=1 ) properties seen :{2=1, 14=1, 24=1, 25=1}
Probabilistic random walk after 47212 steps, saw 45168 distinct states, run finished after 27010 ms. (steps per millisecond=1 ) properties seen :4
Running SMT prover for 27 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:01:48] [INFO ] Invariants computation overflowed in 9508 ms
[2023-03-20 17:02:02] [INFO ] After 14565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
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:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 17:02:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 17:02:27] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:27
Fused 27 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 42 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 407 are kept as prefixes of interest. Removing 32358 places using SCC suffix rule.43 ms
Discarding 32358 places :
Also discarding 39911 output transitions
Drop transitions removed 39911 transitions
Drop transitions removed 668 transitions
Reduce isomorphic transitions removed 668 transitions.
Drop transitions removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 852 rules applied. Total rules applied 853 place count 407 transition count 192
Reduce places removed 184 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 185 rules applied. Total rules applied 1038 place count 223 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1039 place count 222 transition count 191
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 1039 place count 222 transition count 176
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1069 place count 207 transition count 176
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1111 place count 165 transition count 134
Iterating global reduction 3 with 42 rules applied. Total rules applied 1153 place count 165 transition count 134
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 1279 place count 102 transition count 71
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1280 place count 101 transition count 70
Ensure Unique test removed 24 places
Iterating post reduction 3 with 24 rules applied. Total rules applied 1304 place count 77 transition count 70
Applied a total of 1304 rules in 213 ms. Remains 77 /32765 variables (removed 32688) and now considering 70/40955 (removed 40885) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 77/32765 places, 70/40955 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 70 rows 77 cols
[2023-03-20 17:02:28] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-20 17:02:28] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-20 17:02:28] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p0&&G(F(p1))))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3664 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:02:42] [INFO ] Invariants computation overflowed in 9306 ms
[2023-03-20 17:02:44] [INFO ] Implicit Places using invariants in 11762 ms returned []
Implicit Place search using SMT only with invariants took 11763 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:02:53] [INFO ] Invariants computation overflowed in 9272 ms
[2023-03-20 17:02:56] [INFO ] Dead Transitions using invariants and state equation in 11900 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27336 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s21477 s20456), p1:(LEQ s14821 s643)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 26480 steps with 9046 reset in 10005 ms.
Product exploration timeout after 22760 steps with 7813 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
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 p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 315 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 948 resets, run finished after 2033 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 1668 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 18954 steps, run timeout after 9010 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 18954 steps, saw 18266 distinct states, run finished after 9011 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:05:48] [INFO ] Invariants computation overflowed in 9542 ms
[2023-03-20 17:05:52] [INFO ] After 4648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 17:06:17] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 31 are kept as prefixes of interest. Removing 32734 places using SCC suffix rule.9 ms
Discarding 32734 places :
Also discarding 40874 output transitions
Drop transitions removed 40874 transitions
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 31 transition count 7
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 97 place count 9 transition count 7
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 7 transition count 5
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 7 transition count 5
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 4 transition count 2
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 2 transition count 2
Applied a total of 108 rules in 63 ms. Remains 2 /32765 variables (removed 32763) and now considering 2/40955 (removed 40953) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 2/32765 places, 2/40955 transitions.
Finished random walk after 4 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 367 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 32765 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3285 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:06:32] [INFO ] Invariants computation overflowed in 10467 ms
[2023-03-20 17:06:34] [INFO ] Implicit Places using invariants in 12876 ms returned []
Implicit Place search using SMT only with invariants took 12878 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:06:44] [INFO ] Invariants computation overflowed in 10012 ms
[2023-03-20 17:06:47] [INFO ] Dead Transitions using invariants and state equation in 12325 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28501 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
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 : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 910 resets, run finished after 2014 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 1740 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19198 steps, run timeout after 9006 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 19198 steps, saw 18498 distinct states, run finished after 9006 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:09:01] [INFO ] Invariants computation overflowed in 9395 ms
[2023-03-20 17:09:05] [INFO ] After 4552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 17:09:30] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 31 are kept as prefixes of interest. Removing 32734 places using SCC suffix rule.8 ms
Discarding 32734 places :
Also discarding 40874 output transitions
Drop transitions removed 40874 transitions
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 31 transition count 7
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 97 place count 9 transition count 7
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 7 transition count 5
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 7 transition count 5
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 4 transition count 2
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 2 transition count 2
Applied a total of 108 rules in 46 ms. Remains 2 /32765 variables (removed 32763) and now considering 2/40955 (removed 40953) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 2/32765 places, 2/40955 transitions.
Finished random walk after 4 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Product exploration timeout after 51910 steps with 4897 reset in 10002 ms.
Product exploration timeout after 37900 steps with 3643 reset in 10003 ms.
Built C files in :
/tmp/ltsmin13188689728358208648
[2023-03-20 17:09:52] [INFO ] Built C files in 385ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13188689728358208648
Running compilation step : cd /tmp/ltsmin13188689728358208648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13188689728358208648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13188689728358208648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3573 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:10:07] [INFO ] Invariants computation overflowed in 9019 ms
[2023-03-20 17:10:10] [INFO ] Implicit Places using invariants in 11348 ms returned []
Implicit Place search using SMT only with invariants took 11351 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:10:19] [INFO ] Invariants computation overflowed in 9149 ms
[2023-03-20 17:10:21] [INFO ] Dead Transitions using invariants and state equation in 11426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26360 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Built C files in :
/tmp/ltsmin12074450231890858862
[2023-03-20 17:10:21] [INFO ] Built C files in 318ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12074450231890858862
Running compilation step : cd /tmp/ltsmin12074450231890858862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12074450231890858862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12074450231890858862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-20 17:10:26] [INFO ] Flatten gal took : 943 ms
[2023-03-20 17:10:27] [INFO ] Flatten gal took : 868 ms
[2023-03-20 17:10:27] [INFO ] Time to serialize gal into /tmp/LTL18338285596872780377.gal : 190 ms
[2023-03-20 17:10:27] [INFO ] Time to serialize properties into /tmp/LTL10485697218259667215.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18338285596872780377.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6479832935139353915.hoa' '-atoms' '/tmp/LTL10485697218259667215.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2023-03-20 17:10:44] [INFO ] Flatten gal took : 917 ms
[2023-03-20 17:10:45] [INFO ] Flatten gal took : 851 ms
[2023-03-20 17:10:45] [INFO ] Time to serialize gal into /tmp/LTL16014303197338336475.gal : 126 ms
[2023-03-20 17:10:45] [INFO ] Time to serialize properties into /tmp/LTL6836322891984171850.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16014303197338336475.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6836322891984171850.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-20 17:11:01] [INFO ] Flatten gal took : 872 ms
[2023-03-20 17:11:01] [INFO ] Applying decomposition
[2023-03-20 17:11:02] [INFO ] Flatten gal took : 842 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7000257328852159862.txt' '-o' '/tmp/graph7000257328852159862.bin' '-w' '/tmp/graph7000257328852159862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7000257328852159862.bin' '-l' '-1' '-v' '-w' '/tmp/graph7000257328852159862.weights' '-q' '0' '-e' '0.001'
[2023-03-20 17:11:05] [INFO ] Decomposing Gal with order
[2023-03-20 17:11:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 17:22:04] [INFO ] Removed a total of 34160 redundant transitions.
[2023-03-20 17:22:04] [INFO ] Flatten gal took : 1754 ms
[2023-03-20 17:22:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 29968 labels/synchronizations in 9875 ms.
[2023-03-20 17:22:18] [INFO ] Time to serialize gal into /tmp/LTL5642782283201890987.gal : 271 ms
[2023-03-20 17:22:18] [INFO ] Time to serialize properties into /tmp/LTL6078574624750851173.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5642782283201890987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6078574624750851173.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("(gu13626.dFactor12222221212222<=gu13626.dFactor12112212121121)"))||(("(gu13626.dFactor12222221212222<=gu13626.dFactor12112212...232
Formula 0 simplified : F(X!"(gu13626.dFactor12222221212222<=gu13626.dFactor12112212121121)" & (!"(gu13626.dFactor12222221212222<=gu13626.dFactor12112212121...222
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1578968007426716637
[2023-03-20 17:22:33] [INFO ] Built C files in 284ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1578968007426716637
Running compilation step : cd /tmp/ltsmin1578968007426716637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1578968007426716637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1578968007426716637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 finished in 1207956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 47 are kept as prefixes of interest. Removing 32718 places using SCC suffix rule.32 ms
Discarding 32718 places :
Also discarding 40884 output transitions
Drop transitions removed 40884 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 33 transition count 44
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 33 transition count 44
Applied a total of 27 rules in 67 ms. Remains 33 /32765 variables (removed 32732) and now considering 44/40955 (removed 40911) transitions.
// Phase 1: matrix 44 rows 33 cols
[2023-03-20 17:22:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-20 17:22:37] [INFO ] Invariant cache hit.
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned [0, 5, 11, 15, 19, 21, 25]
Discarding 7 places :
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Implicit Place search using SMT with State Equation took 58 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/32765 places, 38/40955 transitions.
Graph (complete) has 18 edges and 26 vertex of which 19 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 14 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 14 transition count 25
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 14 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 15 place count 14 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 13 transition count 21
Applied a total of 17 rules in 3 ms. Remains 13 /26 variables (removed 13) and now considering 21/38 (removed 17) transitions.
// Phase 1: matrix 21 rows 13 cols
[2023-03-20 17:22:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-20 17:22:37] [INFO ] Invariant cache hit.
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/32765 places, 21/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 13/32765 places, 21/40955 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-01 finished in 236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 82 are kept as prefixes of interest. Removing 32683 places using SCC suffix rule.18 ms
Discarding 32683 places :
Also discarding 40831 output transitions
Drop transitions removed 40831 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 59 transition count 78
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 59 transition count 78
Graph (complete) has 33 edges and 59 vertex of which 56 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 46 place count 56 transition count 75
Applied a total of 46 rules in 50 ms. Remains 56 /32765 variables (removed 32709) and now considering 75/40955 (removed 40880) transitions.
// Phase 1: matrix 75 rows 56 cols
[2023-03-20 17:22:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 17:22:37] [INFO ] Invariant cache hit.
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [0, 4, 6, 10, 14, 16, 29, 31, 35, 49]
Discarding 10 places :
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Implicit Place search using SMT with State Equation took 69 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/32765 places, 66/40955 transitions.
Graph (complete) has 30 edges and 46 vertex of which 37 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 28 transition count 48
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 22 place count 28 transition count 45
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 28 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 26 place count 28 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 27 transition count 40
Applied a total of 28 rules in 4 ms. Remains 27 /46 variables (removed 19) and now considering 40/66 (removed 26) transitions.
// Phase 1: matrix 40 rows 27 cols
[2023-03-20 17:22:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 17:22:37] [INFO ] Invariant cache hit.
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/32765 places, 40/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 27/32765 places, 40/40955 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 253 steps with 9 reset in 2 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-04 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 128 are kept as prefixes of interest. Removing 32637 places using SCC suffix rule.18 ms
Discarding 32637 places :
Also discarding 40759 output transitions
Drop transitions removed 40759 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 92 transition count 122
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 92 transition count 122
Graph (complete) has 51 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 72 place count 91 transition count 121
Applied a total of 72 rules in 51 ms. Remains 91 /32765 variables (removed 32674) and now considering 121/40955 (removed 40834) transitions.
// Phase 1: matrix 121 rows 91 cols
[2023-03-20 17:22:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-20 17:22:37] [INFO ] Invariant cache hit.
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [0, 2, 4, 10, 16, 18, 20, 24, 34, 36, 40, 42, 44, 63, 68, 85, 87]
Discarding 17 places :
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Implicit Place search using SMT with State Equation took 94 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/32765 places, 107/40955 transitions.
Graph (complete) has 50 edges and 74 vertex of which 60 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
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 44 transition count 76
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 38 place count 44 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 42 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 42 transition count 69
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 42 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 49 place count 42 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 41 transition count 63
Applied a total of 51 rules in 6 ms. Remains 41 /74 variables (removed 33) and now considering 63/107 (removed 44) transitions.
// Phase 1: matrix 63 rows 41 cols
[2023-03-20 17:22:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 17:22:37] [INFO ] Invariant cache hit.
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/32765 places, 63/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 41/32765 places, 63/40955 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s33 s22), p0:(GT s16 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 470 steps with 13 reset in 6 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 finished in 317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 47 are kept as prefixes of interest. Removing 32718 places using SCC suffix rule.18 ms
Discarding 32718 places :
Also discarding 40884 output transitions
Drop transitions removed 40884 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 33 transition count 44
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 33 transition count 44
Graph (complete) has 17 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 32 transition count 43
Applied a total of 28 rules in 48 ms. Remains 32 /32765 variables (removed 32733) and now considering 43/40955 (removed 40912) transitions.
// Phase 1: matrix 43 rows 32 cols
[2023-03-20 17:22:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 17:22:37] [INFO ] Invariant cache hit.
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [0, 4, 8, 12, 18]
Discarding 5 places :
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 73 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/32765 places, 38/40955 transitions.
Graph (complete) has 16 edges and 27 vertex of which 22 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 18 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 18 transition count 27
Applied a total of 11 rules in 2 ms. Remains 18 /27 variables (removed 9) and now considering 27/38 (removed 11) transitions.
// Phase 1: matrix 27 rows 18 cols
[2023-03-20 17:22:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-20 17:22:37] [INFO ] Invariant cache hit.
[2023-03-20 17:22:37] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/32765 places, 27/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 18/32765 places, 27/40955 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3453 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:22:50] [INFO ] Invariants computation overflowed in 9476 ms
[2023-03-20 17:22:53] [INFO ] Implicit Places using invariants in 12212 ms returned []
Implicit Place search using SMT only with invariants took 12215 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:23:03] [INFO ] Invariants computation overflowed in 9944 ms
[2023-03-20 17:23:06] [INFO ] Dead Transitions using invariants and state equation in 12408 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28080 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s8998 s14805), p0:(LEQ s29334 s6974)], 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 9 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 finished in 28360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4538 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:23:19] [INFO ] Invariants computation overflowed in 8928 ms
[2023-03-20 17:23:22] [INFO ] Implicit Places using invariants in 11349 ms returned []
Implicit Place search using SMT only with invariants took 11351 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:23:31] [INFO ] Invariants computation overflowed in 9053 ms
[2023-03-20 17:23:34] [INFO ] Dead Transitions using invariants and state equation in 11838 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27734 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s31777 s16980)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16983 steps with 1606 reset in 4089 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09 finished in 32052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p1||(p2 U p3)||G(p4)))))'
Support contains 10 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4608 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:23:53] [INFO ] Invariants computation overflowed in 9965 ms
[2023-03-20 17:23:55] [INFO ] Implicit Places using invariants in 12407 ms returned []
Implicit Place search using SMT only with invariants took 12408 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:24:04] [INFO ] Invariants computation overflowed in 8905 ms
[2023-03-20 17:24:06] [INFO ] Dead Transitions using invariants and state equation in 11268 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28290 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4))), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1) (AND (NOT p0) p4) (AND (NOT p0) p3)), (NOT p3), (OR (AND p0 p3 (NOT p4)) (AND p0 p1 (NOT p4)) (AND p0 p2 (NOT p4))), (OR (AND p1 p2 (NOT p3) (NOT p4)) (AND p0 p1 (NOT p3) (NOT p4)))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p3 p2 p4), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p4)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p3 p2 p4), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p4)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p4), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2 p4), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p3 (NOT p0)) (AND p2 (NOT p0)) (AND p4 (NOT p0))), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 (NOT p4) p0) (AND p3 (NOT p4) p0) (AND p2 (NOT p4) p0)), acceptance={} source=4 dest: 1}, { cond=(OR (AND p1 p4) (AND p3 p4) (AND p2 p4)), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3) (NOT p2) (NOT p4) p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3) p2 (NOT p4)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2) p4), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3) p2 p4), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s24445 s7472), p3:(LEQ s8294 s19710), p2:(LEQ s5854 s14912), p4:(LEQ s31112 s24154), p0:(AND (GT s24445 s7472) (GT s8688 s21421))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-10 finished in 28698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4360 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:24:20] [INFO ] Invariants computation overflowed in 9488 ms
[2023-03-20 17:24:23] [INFO ] Implicit Places using invariants in 11892 ms returned []
Implicit Place search using SMT only with invariants took 11893 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:24:32] [INFO ] Invariants computation overflowed in 9267 ms
[2023-03-20 17:24:35] [INFO ] Dead Transitions using invariants and state equation in 11634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27890 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ s19973 s2904) (GT s8963 s4463))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 48610 steps with 4509 reset in 10002 ms.
Product exploration timeout after 37510 steps with 3609 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
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 : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 919 resets, run finished after 1969 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 1768 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19799 steps, run timeout after 9011 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 19799 steps, saw 19074 distinct states, run finished after 9011 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:27:14] [INFO ] Invariants computation overflowed in 9166 ms
[2023-03-20 17:27:18] [INFO ] After 4587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 17:27:43] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 54 are kept as prefixes of interest. Removing 32711 places using SCC suffix rule.9 ms
Discarding 32711 places :
Also discarding 40813 output transitions
Drop transitions removed 40813 transitions
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 54 transition count 16
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 161 place count 20 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 161 place count 20 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 19 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 167 place count 15 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 15 transition count 11
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 181 place count 10 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 9 transition count 5
Ensure Unique test removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 185 place count 6 transition count 5
Applied a total of 185 rules in 43 ms. Remains 6 /32765 variables (removed 32759) and now considering 5/40955 (removed 40950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 6/32765 places, 5/40955 transitions.
Finished random walk after 25 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4326 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:27:57] [INFO ] Invariants computation overflowed in 8999 ms
[2023-03-20 17:27:59] [INFO ] Implicit Places using invariants in 11376 ms returned []
Implicit Place search using SMT only with invariants took 11378 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:28:08] [INFO ] Invariants computation overflowed in 9055 ms
[2023-03-20 17:28:11] [INFO ] Dead Transitions using invariants and state equation in 11408 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27115 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
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 : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 958 resets, run finished after 2018 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 1749 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19453 steps, run timeout after 9011 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 19453 steps, saw 18740 distinct states, run finished after 9012 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:30:25] [INFO ] Invariants computation overflowed in 9638 ms
[2023-03-20 17:30:30] [INFO ] After 4681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 17:30:55] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 54 are kept as prefixes of interest. Removing 32711 places using SCC suffix rule.20 ms
Discarding 32711 places :
Also discarding 40813 output transitions
Drop transitions removed 40813 transitions
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 54 transition count 16
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 161 place count 20 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 161 place count 20 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 19 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 167 place count 15 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 15 transition count 11
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 181 place count 10 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 9 transition count 5
Ensure Unique test removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 185 place count 6 transition count 5
Applied a total of 185 rules in 51 ms. Remains 6 /32765 variables (removed 32759) and now considering 5/40955 (removed 40950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 6/32765 places, 5/40955 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration timeout after 50430 steps with 4723 reset in 10003 ms.
Product exploration timeout after 36270 steps with 3438 reset in 10003 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 149 are kept as prefixes of interest. Removing 32616 places using SCC suffix rule.18 ms
Discarding 32616 places :
Also discarding 40728 output transitions
Drop transitions removed 40728 transitions
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 107 transition count 142
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 107 transition count 142
Graph (complete) has 61 edges and 107 vertex of which 105 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 0 with 1 rules applied. Total rules applied 86 place count 105 transition count 140
Applied a total of 86 rules in 68 ms. Remains 105 /32765 variables (removed 32660) and now considering 140/40955 (removed 40815) transitions.
[2023-03-20 17:31:16] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 140 rows 105 cols
[2023-03-20 17:31:16] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:31:16] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/32765 places, 140/40955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 105/32765 places, 140/40955 transitions.
Built C files in :
/tmp/ltsmin15955497003908491998
[2023-03-20 17:31:16] [INFO ] Built C files in 260ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15955497003908491998
Running compilation step : cd /tmp/ltsmin15955497003908491998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15955497003908491998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15955497003908491998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3590 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:31:32] [INFO ] Invariants computation overflowed in 9090 ms
[2023-03-20 17:31:34] [INFO ] Implicit Places using invariants in 11515 ms returned []
Implicit Place search using SMT only with invariants took 11516 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:31:44] [INFO ] Invariants computation overflowed in 9349 ms
[2023-03-20 17:31:46] [INFO ] Dead Transitions using invariants and state equation in 11699 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26807 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Built C files in :
/tmp/ltsmin4555364967588828307
[2023-03-20 17:31:46] [INFO ] Built C files in 254ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4555364967588828307
Running compilation step : cd /tmp/ltsmin4555364967588828307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4555364967588828307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4555364967588828307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-20 17:31:51] [INFO ] Flatten gal took : 1194 ms
[2023-03-20 17:31:52] [INFO ] Flatten gal took : 1070 ms
[2023-03-20 17:31:53] [INFO ] Time to serialize gal into /tmp/LTL12184543959369693209.gal : 157 ms
[2023-03-20 17:31:53] [INFO ] Time to serialize properties into /tmp/LTL5171707615869766968.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12184543959369693209.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7533421595190712140.hoa' '-atoms' '/tmp/LTL5171707615869766968.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Detected timeout of ITS tools.
[2023-03-20 17:32:09] [INFO ] Flatten gal took : 918 ms
[2023-03-20 17:32:10] [INFO ] Flatten gal took : 956 ms
[2023-03-20 17:32:10] [INFO ] Time to serialize gal into /tmp/LTL11256233940705207005.gal : 249 ms
[2023-03-20 17:32:10] [INFO ] Time to serialize properties into /tmp/LTL2222518461916761422.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11256233940705207005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2222518461916761422.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-20 17:32:26] [INFO ] Flatten gal took : 906 ms
[2023-03-20 17:32:26] [INFO ] Applying decomposition
[2023-03-20 17:32:27] [INFO ] Flatten gal took : 955 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12328817490193890041.txt' '-o' '/tmp/graph12328817490193890041.bin' '-w' '/tmp/graph12328817490193890041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12328817490193890041.bin' '-l' '-1' '-v' '-w' '/tmp/graph12328817490193890041.weights' '-q' '0' '-e' '0.001'
[2023-03-20 17:32:31] [INFO ] Decomposing Gal with order
[2023-03-20 17:32:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 17:43:03] [INFO ] Removed a total of 34172 redundant transitions.
[2023-03-20 17:43:04] [INFO ] Flatten gal took : 1531 ms
[2023-03-20 17:43:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 48556 labels/synchronizations in 10737 ms.
[2023-03-20 17:43:19] [INFO ] Time to serialize gal into /tmp/LTL5128382252827691667.gal : 222 ms
[2023-03-20 17:43:19] [INFO ] Time to serialize properties into /tmp/LTL3438737859535936941.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5128382252827691667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3438737859535936941.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G("((gu13296.dFactor102222122211<=gu13296.dFactor12111112221222)||(gu5970.patient1112122211222>gu5970.dFactor12221122212112))")))...156
Formula 0 simplified : XF!"((gu13296.dFactor102222122211<=gu13296.dFactor12111112221222)||(gu5970.patient1112122211222>gu5970.dFactor12221122212112))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3547359320843020642
[2023-03-20 17:43:34] [INFO ] Built C files in 244ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3547359320843020642
Running compilation step : cd /tmp/ltsmin3547359320843020642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3547359320843020642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3547359320843020642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11 finished in 1170415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3405 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:43:50] [INFO ] Invariants computation overflowed in 9111 ms
[2023-03-20 17:43:52] [INFO ] Implicit Places using invariants in 11568 ms returned []
Implicit Place search using SMT only with invariants took 11569 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:44:01] [INFO ] Invariants computation overflowed in 9244 ms
[2023-03-20 17:44:04] [INFO ] Dead Transitions using invariants and state equation in 11689 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26665 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(LEQ 1 s31656)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 7 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-12 finished in 26956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4927 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:44:18] [INFO ] Invariants computation overflowed in 9354 ms
[2023-03-20 17:44:21] [INFO ] Implicit Places using invariants in 12065 ms returned []
Implicit Place search using SMT only with invariants took 12066 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:44:31] [INFO ] Invariants computation overflowed in 9588 ms
[2023-03-20 17:44:33] [INFO ] Dead Transitions using invariants and state equation in 12071 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29068 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s19373)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 46170 steps with 4286 reset in 10001 ms.
Product exploration timeout after 33600 steps with 3222 reset in 10001 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 921 resets, run finished after 2303 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 2092 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23891 steps, run timeout after 12002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 23891 steps, saw 22985 distinct states, run finished after 12003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:47:18] [INFO ] Invariants computation overflowed in 9776 ms
[2023-03-20 17:47:43] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 15 are kept as prefixes of interest. Removing 32750 places using SCC suffix rule.8 ms
Discarding 32750 places :
Also discarding 40916 output transitions
Drop transitions removed 40916 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 15 transition count 5
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 45 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 45 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 3 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 3
Applied a total of 49 rules in 40 ms. Remains 3 /32765 variables (removed 32762) and now considering 3/40955 (removed 40952) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 3/32765 places, 3/40955 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4600 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:47:58] [INFO ] Invariants computation overflowed in 9806 ms
[2023-03-20 17:48:00] [INFO ] Implicit Places using invariants in 12191 ms returned []
Implicit Place search using SMT only with invariants took 12192 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:48:10] [INFO ] Invariants computation overflowed in 9646 ms
[2023-03-20 17:48:12] [INFO ] Dead Transitions using invariants and state equation in 12405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29201 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 925 resets, run finished after 2350 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 1843 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24611 steps, run timeout after 12005 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 24611 steps, saw 23669 distinct states, run finished after 12005 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:50:31] [INFO ] Invariants computation overflowed in 9219 ms
[2023-03-20 17:50:56] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 15 are kept as prefixes of interest. Removing 32750 places using SCC suffix rule.9 ms
Discarding 32750 places :
Also discarding 40916 output transitions
Drop transitions removed 40916 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 15 transition count 5
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 45 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 45 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 3 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 3
Applied a total of 49 rules in 36 ms. Remains 3 /32765 variables (removed 32762) and now considering 3/40955 (removed 40952) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 3/32765 places, 3/40955 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Product exploration timeout after 48270 steps with 4477 reset in 10001 ms.
Entered a terminal (fully accepting) state of product in 6274 steps with 585 reset in 1806 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13 finished in 424439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p0)))))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5099 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:51:23] [INFO ] Invariants computation overflowed in 9877 ms
[2023-03-20 17:51:26] [INFO ] Implicit Places using invariants in 12553 ms returned []
Implicit Place search using SMT only with invariants took 12554 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-20 17:51:36] [INFO ] Invariants computation overflowed in 9935 ms
[2023-03-20 17:51:38] [INFO ] Dead Transitions using invariants and state equation in 12300 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29955 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s4835 s15624)], 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 11 steps with 0 reset in 9 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-14 finished in 30155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 91 are kept as prefixes of interest. Removing 32674 places using SCC suffix rule.22 ms
Discarding 32674 places :
Also discarding 40818 output transitions
Drop transitions removed 40818 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 65 transition count 86
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 65 transition count 86
Applied a total of 51 rules in 55 ms. Remains 65 /32765 variables (removed 32700) and now considering 86/40955 (removed 40869) transitions.
// Phase 1: matrix 86 rows 65 cols
[2023-03-20 17:51:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:51:39] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 17:51:39] [INFO ] Invariant cache hit.
[2023-03-20 17:51:39] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [0, 2, 4, 8, 12, 14, 18, 20, 24, 41, 43, 47, 61, 63]
Discarding 14 places :
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Implicit Place search using SMT with State Equation took 82 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/32765 places, 74/40955 transitions.
Graph (complete) has 37 edges and 51 vertex of which 38 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 26 transition count 47
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 30 place count 26 transition count 42
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 26 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 33 place count 26 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 24 transition count 37
Applied a total of 37 rules in 3 ms. Remains 24 /51 variables (removed 27) and now considering 37/74 (removed 37) transitions.
// Phase 1: matrix 37 rows 24 cols
[2023-03-20 17:51:39] [INFO ] Computed 0 place invariants in 21 ms
[2023-03-20 17:51:39] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 17:51:39] [INFO ] Invariant cache hit.
[2023-03-20 17:51:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/32765 places, 37/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 24/32765 places, 37/40955 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s12 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-15 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p0&&G(F(p1))))))'
Found a Lengthening insensitive property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 143 are kept as prefixes of interest. Removing 32622 places using SCC suffix rule.21 ms
Discarding 32622 places :
Also discarding 40738 output transitions
Drop transitions removed 40738 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 103 transition count 137
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 103 transition count 137
Graph (complete) has 59 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 80 place count 102 transition count 136
Applied a total of 80 rules in 56 ms. Remains 102 /32765 variables (removed 32663) and now considering 136/40955 (removed 40819) transitions.
// Phase 1: matrix 136 rows 102 cols
[2023-03-20 17:51:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:51:39] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-20 17:51:39] [INFO ] Invariant cache hit.
[2023-03-20 17:51:39] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [0, 2, 4, 6, 8, 10, 12, 18, 31, 33, 35, 41, 43, 45, 54, 58, 62, 66, 68, 72, 82]
Discarding 21 places :
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Implicit Place search using SMT with State Equation took 98 ms to find 21 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 81/32765 places, 117/40955 transitions.
Graph (complete) has 58 edges and 81 vertex of which 63 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 37 place count 45 transition count 81
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 45 place count 45 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 43 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 43 transition count 71
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 43 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 43 transition count 70
Applied a total of 53 rules in 4 ms. Remains 43 /81 variables (removed 38) and now considering 70/117 (removed 47) transitions.
// Phase 1: matrix 70 rows 43 cols
[2023-03-20 17:51:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:51:39] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-20 17:51:39] [INFO ] Invariant cache hit.
[2023-03-20 17:51:39] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 43/32765 places, 70/40955 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 226 ms. Remains : 43/32765 places, 70/40955 transitions.
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s39 s27), p1:(LEQ s15 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33370 reset in 179 ms.
Product exploration explored 100000 steps with 33243 reset in 194 ms.
Computed a total of 43 stabilizing places and 70 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 70
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 p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 311 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 724 steps, including 13 resets, run visited all 1 properties in 5 ms. (steps per millisecond=144 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 70/70 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-20 17:51:41] [INFO ] Invariant cache hit.
[2023-03-20 17:51:41] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-20 17:51:41] [INFO ] Invariant cache hit.
[2023-03-20 17:51:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-20 17:51:41] [INFO ] Invariant cache hit.
[2023-03-20 17:51:41] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 43/43 places, 70/70 transitions.
Computed a total of 43 stabilizing places and 70 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 70
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 : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1180 steps, including 22 resets, run visited all 1 properties in 6 ms. (steps per millisecond=196 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 670 steps with 18 reset in 3 ms.
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 finished in 2932 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 149 are kept as prefixes of interest. Removing 32616 places using SCC suffix rule.18 ms
Discarding 32616 places :
Also discarding 40728 output transitions
Drop transitions removed 40728 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 106 transition count 141
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 106 transition count 141
Graph (complete) has 59 edges and 106 vertex of which 104 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 0 with 1 rules applied. Total rules applied 86 place count 104 transition count 139
Applied a total of 86 rules in 50 ms. Remains 104 /32765 variables (removed 32661) and now considering 139/40955 (removed 40816) transitions.
// Phase 1: matrix 139 rows 104 cols
[2023-03-20 17:51:42] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 17:51:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 17:51:42] [INFO ] Invariant cache hit.
[2023-03-20 17:51:42] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [0, 2, 4, 6, 8, 18, 34, 38, 40, 51, 59, 61, 67, 79, 87, 89, 99]
Discarding 17 places :
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Implicit Place search using SMT with State Equation took 103 ms to find 17 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 87/32765 places, 126/40955 transitions.
Graph (complete) has 57 edges and 87 vertex of which 73 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
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 58 transition count 97
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 38 place count 58 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 56 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 56 transition count 89
Applied a total of 43 rules in 7 ms. Remains 56 /87 variables (removed 31) and now considering 89/126 (removed 37) transitions.
// Phase 1: matrix 89 rows 56 cols
[2023-03-20 17:51:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 17:51:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 17:51:42] [INFO ] Invariant cache hit.
[2023-03-20 17:51:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 56/32765 places, 89/40955 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 222 ms. Remains : 56/32765 places, 89/40955 transitions.
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ s49 s15) (GT s38 s25))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 753 steps with 14 reset in 1 ms.
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11 finished in 407 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-20 17:51:43] [INFO ] Flatten gal took : 944 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 3078186 ms.

BK_STOP 1679334704909

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-S02D1C1A12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ViralEpidemic-PT-S02D1C1A12, 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 r485-tall-167912700501251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ViralEpidemic-PT-S02D1C1A12.tgz
mv ViralEpidemic-PT-S02D1C1A12 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 ;