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.r389-oct2-167903713800684.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 20:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 20:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 25 20:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 20:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 955K 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 ShieldPPPt-PT-050B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679221452392

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 10:24:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 10:24:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:24:15] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2023-03-19 10:24:15] [INFO ] Transformed 3903 places.
[2023-03-19 10:24:15] [INFO ] Transformed 3553 transitions.
[2023-03-19 10:24:15] [INFO ] Found NUPN structural information;
[2023-03-19 10:24:15] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 470 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 46 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 537 places :
Symmetric choice reduction at 0 with 537 rule applications. Total rules 537 place count 3366 transition count 3016
Iterating global reduction 0 with 537 rules applied. Total rules applied 1074 place count 3366 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1075 place count 3365 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 1076 place count 3365 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1077 place count 3364 transition count 3014
Iterating global reduction 0 with 1 rules applied. Total rules applied 1078 place count 3364 transition count 3014
Applied a total of 1078 rules in 1805 ms. Remains 3364 /3903 variables (removed 539) and now considering 3014/3553 (removed 539) transitions.
// Phase 1: matrix 3014 rows 3364 cols
[2023-03-19 10:24:18] [INFO ] Computed 551 place invariants in 32 ms
[2023-03-19 10:24:21] [INFO ] Implicit Places using invariants in 3665 ms returned []
[2023-03-19 10:24:21] [INFO ] Invariant cache hit.
[2023-03-19 10:24:23] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 5541 ms to find 0 implicit places.
[2023-03-19 10:24:23] [INFO ] Invariant cache hit.
[2023-03-19 10:24:27] [INFO ] Dead Transitions using invariants and state equation in 3565 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3364/3903 places, 3014/3553 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10926 ms. Remains : 3364/3903 places, 3014/3553 transitions.
Support contains 46 out of 3364 places after structural reductions.
[2023-03-19 10:24:27] [INFO ] Flatten gal took : 214 ms
[2023-03-19 10:24:27] [INFO ] Flatten gal took : 140 ms
[2023-03-19 10:24:28] [INFO ] Input system was already deterministic with 3014 transitions.
Support contains 43 out of 3364 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=15 ) properties (out of 41) seen :20
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-19 10:24:28] [INFO ] Invariant cache hit.
[2023-03-19 10:24:32] [INFO ] [Real]Absence check using 551 positive place invariants in 393 ms returned sat
[2023-03-19 10:24:33] [INFO ] After 3142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-19 10:24:35] [INFO ] [Nat]Absence check using 551 positive place invariants in 342 ms returned sat
[2023-03-19 10:24:43] [INFO ] After 5794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-19 10:24:44] [INFO ] Deduced a trap composed of 19 places in 1062 ms of which 7 ms to minimize.
[2023-03-19 10:24:45] [INFO ] Deduced a trap composed of 22 places in 917 ms of which 2 ms to minimize.
[2023-03-19 10:24:46] [INFO ] Deduced a trap composed of 24 places in 798 ms of which 3 ms to minimize.
[2023-03-19 10:24:47] [INFO ] Deduced a trap composed of 18 places in 1051 ms of which 46 ms to minimize.
[2023-03-19 10:24:48] [INFO ] Deduced a trap composed of 27 places in 1294 ms of which 7 ms to minimize.
[2023-03-19 10:24:49] [INFO ] Deduced a trap composed of 18 places in 821 ms of which 1 ms to minimize.
[2023-03-19 10:24:51] [INFO ] Deduced a trap composed of 32 places in 1370 ms of which 14 ms to minimize.
[2023-03-19 10:24:52] [INFO ] Deduced a trap composed of 20 places in 888 ms of which 2 ms to minimize.
[2023-03-19 10:24:53] [INFO ] Deduced a trap composed of 27 places in 1027 ms of which 2 ms to minimize.
[2023-03-19 10:24:54] [INFO ] Deduced a trap composed of 27 places in 892 ms of which 1 ms to minimize.
[2023-03-19 10:24:55] [INFO ] Deduced a trap composed of 30 places in 690 ms of which 2 ms to minimize.
[2023-03-19 10:24:56] [INFO ] Deduced a trap composed of 22 places in 887 ms of which 2 ms to minimize.
[2023-03-19 10:24:57] [INFO ] Deduced a trap composed of 19 places in 968 ms of which 15 ms to minimize.
[2023-03-19 10:24:58] [INFO ] Deduced a trap composed of 20 places in 834 ms of which 2 ms to minimize.
[2023-03-19 10:24:59] [INFO ] Deduced a trap composed of 17 places in 696 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-19 10:24:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 10:24:59] [INFO ] After 25668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Fused 21 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 3863 ms.
Support contains 26 out of 3364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Drop transitions removed 685 transitions
Trivial Post-agglo rules discarded 685 transitions
Performed 685 trivial Post agglomeration. Transition count delta: 685
Iterating post reduction 0 with 685 rules applied. Total rules applied 685 place count 3364 transition count 2329
Reduce places removed 685 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 693 rules applied. Total rules applied 1378 place count 2679 transition count 2321
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1386 place count 2671 transition count 2321
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 391 Pre rules applied. Total rules applied 1386 place count 2671 transition count 1930
Deduced a syphon composed of 391 places in 4 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 3 with 782 rules applied. Total rules applied 2168 place count 2280 transition count 1930
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2174 place count 2274 transition count 1924
Iterating global reduction 3 with 6 rules applied. Total rules applied 2180 place count 2274 transition count 1924
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2180 place count 2274 transition count 1921
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2186 place count 2271 transition count 1921
Performed 842 Post agglomeration using F-continuation condition.Transition count delta: 842
Deduced a syphon composed of 842 places in 4 ms
Reduce places removed 842 places and 0 transitions.
Iterating global reduction 3 with 1684 rules applied. Total rules applied 3870 place count 1429 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3871 place count 1429 transition count 1078
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3873 place count 1428 transition count 1077
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4075 place count 1327 transition count 1077
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 4163 place count 1283 transition count 1077
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4164 place count 1283 transition count 1076
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4165 place count 1282 transition count 1076
Partial Free-agglomeration rule applied 146 times.
Drop transitions removed 146 transitions
Iterating global reduction 5 with 146 rules applied. Total rules applied 4311 place count 1282 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4312 place count 1281 transition count 1075
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4313 place count 1280 transition count 1075
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4313 place count 1280 transition count 1073
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4317 place count 1278 transition count 1073
Applied a total of 4317 rules in 1048 ms. Remains 1278 /3364 variables (removed 2086) and now considering 1073/3014 (removed 1941) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1048 ms. Remains : 1278/3364 places, 1073/3014 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 21) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1073 rows 1278 cols
[2023-03-19 10:25:05] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-19 10:25:06] [INFO ] [Real]Absence check using 550 positive place invariants in 153 ms returned sat
[2023-03-19 10:25:06] [INFO ] After 751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 10:25:07] [INFO ] [Nat]Absence check using 550 positive place invariants in 132 ms returned sat
[2023-03-19 10:25:09] [INFO ] After 1405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 10:25:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 10:25:10] [INFO ] After 893ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-19 10:25:10] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2023-03-19 10:25:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-19 10:25:12] [INFO ] After 2789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 926 ms.
[2023-03-19 10:25:12] [INFO ] After 6197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 287 ms.
Support contains 16 out of 1278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1278/1278 places, 1073/1073 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1278 transition count 1071
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1276 transition count 1071
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 1276 transition count 1067
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 1272 transition count 1067
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 1267 transition count 1062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 1266 transition count 1062
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 1265 transition count 1061
Applied a total of 25 rules in 134 ms. Remains 1265 /1278 variables (removed 13) and now considering 1061/1073 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 1265/1278 places, 1061/1073 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 71230 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71230 steps, saw 59603 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1061 rows 1265 cols
[2023-03-19 10:25:18] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-19 10:25:18] [INFO ] [Real]Absence check using 550 positive place invariants in 205 ms returned sat
[2023-03-19 10:25:18] [INFO ] After 673ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 10:25:19] [INFO ] [Nat]Absence check using 550 positive place invariants in 136 ms returned sat
[2023-03-19 10:25:21] [INFO ] After 1228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 10:25:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 10:25:22] [INFO ] After 711ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-19 10:25:22] [INFO ] Deduced a trap composed of 6 places in 401 ms of which 1 ms to minimize.
[2023-03-19 10:25:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 508 ms
[2023-03-19 10:25:23] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2023-03-19 10:25:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-19 10:25:24] [INFO ] After 2823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 874 ms.
[2023-03-19 10:25:25] [INFO ] After 6227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 265 ms.
Support contains 16 out of 1265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1265/1265 places, 1061/1061 transitions.
Applied a total of 0 rules in 38 ms. Remains 1265 /1265 variables (removed 0) and now considering 1061/1061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1265/1265 places, 1061/1061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1265/1265 places, 1061/1061 transitions.
Applied a total of 0 rules in 33 ms. Remains 1265 /1265 variables (removed 0) and now considering 1061/1061 (removed 0) transitions.
[2023-03-19 10:25:25] [INFO ] Invariant cache hit.
[2023-03-19 10:25:26] [INFO ] Implicit Places using invariants in 698 ms returned [1248, 1252]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 703 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1263/1265 places, 1061/1061 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1261 transition count 1059
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1261 transition count 1059
Applied a total of 4 rules in 49 ms. Remains 1261 /1263 variables (removed 2) and now considering 1059/1061 (removed 2) transitions.
// Phase 1: matrix 1059 rows 1261 cols
[2023-03-19 10:25:26] [INFO ] Computed 548 place invariants in 8 ms
[2023-03-19 10:25:27] [INFO ] Implicit Places using invariants in 1047 ms returned []
[2023-03-19 10:25:27] [INFO ] Invariant cache hit.
[2023-03-19 10:25:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 10:25:29] [INFO ] Implicit Places using invariants and state equation in 2635 ms returned []
Implicit Place search using SMT with State Equation took 3700 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1261/1265 places, 1059/1061 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4485 ms. Remains : 1261/1265 places, 1059/1061 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 70236 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70236 steps, saw 58961 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-19 10:25:34] [INFO ] Invariant cache hit.
[2023-03-19 10:25:34] [INFO ] [Real]Absence check using 548 positive place invariants in 188 ms returned sat
[2023-03-19 10:25:35] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 10:25:35] [INFO ] [Nat]Absence check using 548 positive place invariants in 116 ms returned sat
[2023-03-19 10:25:37] [INFO ] After 1347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 10:25:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 10:25:38] [INFO ] After 878ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-19 10:25:38] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-19 10:25:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-19 10:25:39] [INFO ] After 2518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 846 ms.
[2023-03-19 10:25:40] [INFO ] After 5645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 289 ms.
Support contains 16 out of 1261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1261/1261 places, 1059/1059 transitions.
Applied a total of 0 rules in 37 ms. Remains 1261 /1261 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1261/1261 places, 1059/1059 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1261/1261 places, 1059/1059 transitions.
Applied a total of 0 rules in 34 ms. Remains 1261 /1261 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2023-03-19 10:25:41] [INFO ] Invariant cache hit.
[2023-03-19 10:25:43] [INFO ] Implicit Places using invariants in 2519 ms returned []
[2023-03-19 10:25:43] [INFO ] Invariant cache hit.
[2023-03-19 10:25:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 10:25:46] [INFO ] Implicit Places using invariants and state equation in 2937 ms returned []
Implicit Place search using SMT with State Equation took 5465 ms to find 0 implicit places.
[2023-03-19 10:25:46] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-19 10:25:46] [INFO ] Invariant cache hit.
[2023-03-19 10:25:47] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6217 ms. Remains : 1261/1261 places, 1059/1059 transitions.
Partial Free-agglomeration rule applied 285 times.
Drop transitions removed 285 transitions
Iterating global reduction 0 with 285 rules applied. Total rules applied 285 place count 1261 transition count 1059
Applied a total of 285 rules in 77 ms. Remains 1261 /1261 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 1059 rows 1261 cols
[2023-03-19 10:25:47] [INFO ] Computed 548 place invariants in 7 ms
[2023-03-19 10:25:48] [INFO ] [Real]Absence check using 548 positive place invariants in 201 ms returned sat
[2023-03-19 10:25:48] [INFO ] After 923ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 10:25:48] [INFO ] [Nat]Absence check using 548 positive place invariants in 168 ms returned sat
[2023-03-19 10:25:50] [INFO ] After 1386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 10:25:50] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-03-19 10:25:51] [INFO ] After 1108ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-19 10:25:52] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 1 ms to minimize.
[2023-03-19 10:25:52] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 0 ms to minimize.
[2023-03-19 10:25:53] [INFO ] Deduced a trap composed of 5 places in 569 ms of which 2 ms to minimize.
[2023-03-19 10:25:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1380 ms
[2023-03-19 10:25:53] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
[2023-03-19 10:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 422 ms
[2023-03-19 10:25:55] [INFO ] After 4391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 969 ms.
[2023-03-19 10:25:56] [INFO ] After 7714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Computed a total of 801 stabilizing places and 801 stable transitions
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(p0)||G(p1))))'
Support contains 1 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 742 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-19 10:25:57] [INFO ] Computed 551 place invariants in 23 ms
[2023-03-19 10:25:58] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2023-03-19 10:25:58] [INFO ] Invariant cache hit.
[2023-03-19 10:26:04] [INFO ] Implicit Places using invariants and state equation in 5295 ms returned []
Implicit Place search using SMT with State Equation took 6741 ms to find 0 implicit places.
[2023-03-19 10:26:04] [INFO ] Invariant cache hit.
[2023-03-19 10:26:07] [INFO ] Dead Transitions using invariants and state equation in 3277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10778 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 568 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s2522 0), p1:(EQ s2522 1)], 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]]
Product exploration explored 100000 steps with 33333 reset in 1700 ms.
Product exploration explored 100000 steps with 33333 reset in 1550 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLFireability-00 finished in 14979 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)&&X(p1)))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 739 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-19 10:26:12] [INFO ] Computed 551 place invariants in 18 ms
[2023-03-19 10:26:13] [INFO ] Implicit Places using invariants in 1419 ms returned []
[2023-03-19 10:26:13] [INFO ] Invariant cache hit.
[2023-03-19 10:26:18] [INFO ] Implicit Places using invariants and state equation in 4840 ms returned []
Implicit Place search using SMT with State Equation took 6290 ms to find 0 implicit places.
[2023-03-19 10:26:18] [INFO ] Invariant cache hit.
[2023-03-19 10:26:20] [INFO ] Dead Transitions using invariants and state equation in 1755 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8792 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s84 1)), p1:(EQ s2273 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 955 ms.
Stack based approach found an accepted trace after 6182 steps with 0 reset with depth 6183 and stack size 6183 in 76 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-01 finished in 10167 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((G(p0)||(F(G(p1)) U (G(p2)&&F(p3))))))'
Support contains 5 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3363 transition count 2315
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 2665 transition count 2315
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1396 place count 2665 transition count 1920
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 2195 place count 2261 transition count 1911
Iterating global reduction 2 with 9 rules applied. Total rules applied 2204 place count 2261 transition count 1911
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2204 place count 2261 transition count 1905
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2216 place count 2255 transition count 1905
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 2 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3908 place count 1409 transition count 1059
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3909 place count 1409 transition count 1058
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3911 place count 1408 transition count 1057
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4113 place count 1307 transition count 1057
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4209 place count 1259 transition count 1057
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4211 place count 1257 transition count 1055
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4212 place count 1256 transition count 1055
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4212 place count 1256 transition count 1053
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4216 place count 1254 transition count 1053
Applied a total of 4216 rules in 913 ms. Remains 1254 /3364 variables (removed 2110) and now considering 1053/3014 (removed 1961) transitions.
// Phase 1: matrix 1053 rows 1254 cols
[2023-03-19 10:26:22] [INFO ] Computed 550 place invariants in 18 ms
[2023-03-19 10:26:23] [INFO ] Implicit Places using invariants in 759 ms returned [1237, 1241]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 762 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1252/3364 places, 1053/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1250 transition count 1051
Applied a total of 4 rules in 65 ms. Remains 1250 /1252 variables (removed 2) and now considering 1051/1053 (removed 2) transitions.
// Phase 1: matrix 1051 rows 1250 cols
[2023-03-19 10:26:23] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-19 10:26:24] [INFO ] Implicit Places using invariants in 610 ms returned []
[2023-03-19 10:26:24] [INFO ] Invariant cache hit.
[2023-03-19 10:26:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 10:26:26] [INFO ] Implicit Places using invariants and state equation in 2442 ms returned []
Implicit Place search using SMT with State Equation took 3066 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1250/3364 places, 1051/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4806 ms. Remains : 1250/3364 places, 1051/3014 transitions.
Stuttering acceptance computed with spot in 465 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s728 1), p2:(EQ s75 1), p3:(EQ s429 1), p1:(AND (EQ s857 1) (EQ s882 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 815 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-02 finished in 6145 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 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3363 transition count 2314
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 2664 transition count 2314
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1398 place count 2664 transition count 1919
Deduced a syphon composed of 395 places in 4 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2188 place count 2269 transition count 1919
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 2199 place count 2258 transition count 1908
Iterating global reduction 2 with 11 rules applied. Total rules applied 2210 place count 2258 transition count 1908
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2210 place count 2258 transition count 1900
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2226 place count 2250 transition count 1900
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 2 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3920 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3921 place count 1403 transition count 1052
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3923 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4125 place count 1301 transition count 1051
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4219 place count 1254 transition count 1051
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4221 place count 1252 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4222 place count 1251 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4222 place count 1251 transition count 1047
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4226 place count 1249 transition count 1047
Applied a total of 4226 rules in 828 ms. Remains 1249 /3364 variables (removed 2115) and now considering 1047/3014 (removed 1967) transitions.
// Phase 1: matrix 1047 rows 1249 cols
[2023-03-19 10:26:28] [INFO ] Computed 550 place invariants in 7 ms
[2023-03-19 10:26:29] [INFO ] Implicit Places using invariants in 910 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 929 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3364 places, 1047/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1045
Applied a total of 4 rules in 76 ms. Remains 1245 /1247 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2023-03-19 10:26:29] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-19 10:26:30] [INFO ] Implicit Places using invariants in 826 ms returned []
[2023-03-19 10:26:30] [INFO ] Invariant cache hit.
[2023-03-19 10:26:32] [INFO ] Implicit Places using invariants and state equation in 1766 ms returned []
Implicit Place search using SMT with State Equation took 2612 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3364 places, 1045/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4446 ms. Remains : 1245/3364 places, 1045/3014 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1195 1)], 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]]
Product exploration explored 100000 steps with 437 reset in 899 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-03 finished in 5446 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&&F(p1))||(G((p2||X(p3)))&&F(p0)))))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 740 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-19 10:26:34] [INFO ] Computed 551 place invariants in 22 ms
[2023-03-19 10:26:35] [INFO ] Implicit Places using invariants in 1723 ms returned []
[2023-03-19 10:26:35] [INFO ] Invariant cache hit.
[2023-03-19 10:26:40] [INFO ] Implicit Places using invariants and state equation in 4314 ms returned []
Implicit Place search using SMT with State Equation took 6061 ms to find 0 implicit places.
[2023-03-19 10:26:40] [INFO ] Invariant cache hit.
[2023-03-19 10:26:43] [INFO ] Dead Transitions using invariants and state equation in 3006 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9824 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 531 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s920 1), p2:(EQ s2976 1), p1:(EQ s2940 0), p3:(EQ s2940 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 991 ms.
Stack based approach found an accepted trace after 8842 steps with 4 reset with depth 8459 and stack size 8459 in 93 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-04 finished in 11508 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||G(F(p1)))))'
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3363 transition count 2313
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2663 transition count 2313
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1400 place count 2663 transition count 1918
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2190 place count 2268 transition count 1918
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2200 place count 2258 transition count 1908
Iterating global reduction 2 with 10 rules applied. Total rules applied 2210 place count 2258 transition count 1908
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2210 place count 2258 transition count 1901
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 2224 place count 2251 transition count 1901
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3916 place count 1405 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3917 place count 1405 transition count 1054
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3919 place count 1404 transition count 1053
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4121 place count 1303 transition count 1053
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4217 place count 1255 transition count 1053
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4219 place count 1253 transition count 1051
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4220 place count 1252 transition count 1051
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4220 place count 1252 transition count 1049
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4224 place count 1250 transition count 1049
Applied a total of 4224 rules in 862 ms. Remains 1250 /3364 variables (removed 2114) and now considering 1049/3014 (removed 1965) transitions.
// Phase 1: matrix 1049 rows 1250 cols
[2023-03-19 10:26:45] [INFO ] Computed 550 place invariants in 18 ms
[2023-03-19 10:26:46] [INFO ] Implicit Places using invariants in 1072 ms returned [1233, 1237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1086 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1248/3364 places, 1049/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1246 transition count 1047
Applied a total of 4 rules in 58 ms. Remains 1246 /1248 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
// Phase 1: matrix 1047 rows 1246 cols
[2023-03-19 10:26:46] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-19 10:26:47] [INFO ] Implicit Places using invariants in 882 ms returned []
[2023-03-19 10:26:47] [INFO ] Invariant cache hit.
[2023-03-19 10:26:49] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 2375 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/3364 places, 1047/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4381 ms. Remains : 1246/3364 places, 1047/3014 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1021 1), p1:(EQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 140 reset in 879 ms.
Stack based approach found an accepted trace after 295 steps with 14 reset with depth 224 and stack size 224 in 7 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-05 finished in 5435 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(G(p0))&&F(p1))))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 732 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-19 10:26:51] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-19 10:26:52] [INFO ] Implicit Places using invariants in 1512 ms returned []
[2023-03-19 10:26:52] [INFO ] Invariant cache hit.
[2023-03-19 10:26:57] [INFO ] Implicit Places using invariants and state equation in 4832 ms returned []
Implicit Place search using SMT with State Equation took 6351 ms to find 0 implicit places.
[2023-03-19 10:26:57] [INFO ] Invariant cache hit.
[2023-03-19 10:27:01] [INFO ] Dead Transitions using invariants and state equation in 3695 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10779 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1974 1), p0:(AND (EQ s1974 1) (EQ s2471 1) (EQ s633 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 890 ms.
Stack based approach found an accepted trace after 2674 steps with 1 reset with depth 2211 and stack size 2211 in 23 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-06 finished in 12001 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&&(p1 U (p2||G(p1)))) U (G((!p0&&(p1 U (p2||G(p1)))))||((p1 U (p2||G(p1)))&&p3))))))'
Support contains 5 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 723 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-19 10:27:03] [INFO ] Computed 551 place invariants in 10 ms
[2023-03-19 10:27:04] [INFO ] Implicit Places using invariants in 1551 ms returned []
[2023-03-19 10:27:04] [INFO ] Invariant cache hit.
[2023-03-19 10:27:09] [INFO ] Implicit Places using invariants and state equation in 4988 ms returned []
Implicit Place search using SMT with State Equation took 6558 ms to find 0 implicit places.
[2023-03-19 10:27:09] [INFO ] Invariant cache hit.
[2023-03-19 10:27:11] [INFO ] Dead Transitions using invariants and state equation in 2107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9390 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p3))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p2) p1) (AND (NOT p2) p1 (NOT p0))), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s2311 1) (EQ s2336 1))) (NOT (OR (AND (EQ s2311 1) (EQ s2336 1)) (EQ s2492 1)))), p2:(AND (NEQ s486 1) (NEQ s515 1)), p0:(OR (AND (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2598 ms.
Product exploration explored 100000 steps with 50000 reset in 2433 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p3 p2 (NOT p0) p1), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1))))), (X (NOT (OR (AND p3 (NOT p2) p1) (AND (NOT p2) p1 (NOT p0))))), (X (NOT (OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (OR (AND p3 (NOT p2) p1) (AND (NOT p2) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p3 p2 (NOT p0) p1)
Knowledge based reduction with 9 factoid took 308 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLFireability-07 finished in 15056 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) U p1)||X(p2)))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 777 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-19 10:27:18] [INFO ] Computed 551 place invariants in 16 ms
[2023-03-19 10:27:19] [INFO ] Implicit Places using invariants in 1520 ms returned []
[2023-03-19 10:27:19] [INFO ] Invariant cache hit.
[2023-03-19 10:27:21] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 2876 ms to find 0 implicit places.
[2023-03-19 10:27:21] [INFO ] Invariant cache hit.
[2023-03-19 10:27:23] [INFO ] Dead Transitions using invariants and state equation in 2754 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6412 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 376 ms :[(NOT p0), true, (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s3254 1), p1:(EQ s2932 1), p2:(AND (EQ s2664 0) (EQ s3254 0))], 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2552 ms.
Product exploration explored 100000 steps with 50000 reset in 2598 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3352 stabilizing places and 798/3002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 10 factoid took 365 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLFireability-08 finished in 12394 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)&&F((p1&&X(p1))))))'
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 752 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-19 10:27:30] [INFO ] Computed 551 place invariants in 23 ms
[2023-03-19 10:27:32] [INFO ] Implicit Places using invariants in 1680 ms returned []
[2023-03-19 10:27:32] [INFO ] Invariant cache hit.
[2023-03-19 10:27:36] [INFO ] Implicit Places using invariants and state equation in 4244 ms returned []
Implicit Place search using SMT with State Equation took 5969 ms to find 0 implicit places.
[2023-03-19 10:27:36] [INFO ] Invariant cache hit.
[2023-03-19 10:27:39] [INFO ] Dead Transitions using invariants and state equation in 2891 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9626 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s2804 0), p1:(EQ s230 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33276 reset in 1795 ms.
Product exploration explored 100000 steps with 33320 reset in 1755 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 294 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 102483 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102483 steps, saw 77129 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 10:27:47] [INFO ] Invariant cache hit.
[2023-03-19 10:27:47] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 10:27:48] [INFO ] [Nat]Absence check using 551 positive place invariants in 311 ms returned sat
[2023-03-19 10:27:50] [INFO ] After 2127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 10:27:53] [INFO ] Deduced a trap composed of 25 places in 2655 ms of which 2 ms to minimize.
[2023-03-19 10:27:54] [INFO ] Deduced a trap composed of 23 places in 989 ms of which 2 ms to minimize.
[2023-03-19 10:27:56] [INFO ] Deduced a trap composed of 29 places in 1021 ms of which 2 ms to minimize.
[2023-03-19 10:27:57] [INFO ] Deduced a trap composed of 18 places in 907 ms of which 3 ms to minimize.
[2023-03-19 10:27:58] [INFO ] Deduced a trap composed of 28 places in 900 ms of which 1 ms to minimize.
[2023-03-19 10:27:59] [INFO ] Deduced a trap composed of 23 places in 851 ms of which 17 ms to minimize.
[2023-03-19 10:28:00] [INFO ] Deduced a trap composed of 22 places in 862 ms of which 12 ms to minimize.
[2023-03-19 10:28:01] [INFO ] Deduced a trap composed of 25 places in 739 ms of which 2 ms to minimize.
[2023-03-19 10:28:02] [INFO ] Deduced a trap composed of 23 places in 864 ms of which 1 ms to minimize.
[2023-03-19 10:28:03] [INFO ] Deduced a trap composed of 31 places in 837 ms of which 2 ms to minimize.
[2023-03-19 10:28:04] [INFO ] Deduced a trap composed of 26 places in 965 ms of which 2 ms to minimize.
[2023-03-19 10:28:05] [INFO ] Deduced a trap composed of 28 places in 856 ms of which 2 ms to minimize.
[2023-03-19 10:28:06] [INFO ] Deduced a trap composed of 24 places in 759 ms of which 1 ms to minimize.
[2023-03-19 10:28:07] [INFO ] Deduced a trap composed of 29 places in 899 ms of which 2 ms to minimize.
[2023-03-19 10:28:08] [INFO ] Deduced a trap composed of 27 places in 955 ms of which 1 ms to minimize.
[2023-03-19 10:28:08] [INFO ] Deduced a trap composed of 38 places in 630 ms of which 15 ms to minimize.
[2023-03-19 10:28:09] [INFO ] Deduced a trap composed of 32 places in 923 ms of which 2 ms to minimize.
[2023-03-19 10:28:10] [INFO ] Deduced a trap composed of 36 places in 879 ms of which 1 ms to minimize.
[2023-03-19 10:28:12] [INFO ] Deduced a trap composed of 32 places in 1103 ms of which 1 ms to minimize.
[2023-03-19 10:28:12] [INFO ] Deduced a trap composed of 19 places in 688 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-19 10:28:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 10:28:12] [INFO ] After 25161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 208 ms.
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3351 transition count 2303
Reduce places removed 698 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 700 rules applied. Total rules applied 1398 place count 2653 transition count 2301
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1400 place count 2651 transition count 2301
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 398 Pre rules applied. Total rules applied 1400 place count 2651 transition count 1903
Deduced a syphon composed of 398 places in 3 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 2196 place count 2253 transition count 1903
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 3 with 1696 rules applied. Total rules applied 3892 place count 1405 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3893 place count 1405 transition count 1054
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3895 place count 1404 transition count 1053
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4097 place count 1303 transition count 1053
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4193 place count 1255 transition count 1053
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4342 place count 1255 transition count 1053
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4343 place count 1254 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4344 place count 1253 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4344 place count 1253 transition count 1050
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4348 place count 1251 transition count 1050
Applied a total of 4348 rules in 648 ms. Remains 1251 /3351 variables (removed 2100) and now considering 1050/3001 (removed 1951) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 648 ms. Remains : 1251/3351 places, 1050/3001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1050 rows 1251 cols
[2023-03-19 10:28:13] [INFO ] Computed 550 place invariants in 3 ms
[2023-03-19 10:28:14] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:28:14] [INFO ] [Nat]Absence check using 550 positive place invariants in 188 ms returned sat
[2023-03-19 10:28:15] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:28:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 10:28:15] [INFO ] After 77ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 10:28:15] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-19 10:28:15] [INFO ] After 1242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1050/1050 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1251 transition count 1049
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1250 transition count 1049
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1249 transition count 1048
Applied a total of 4 rules in 138 ms. Remains 1249 /1251 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 1249/1251 places, 1048/1050 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 161544 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161544 steps, saw 135443 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-19 10:28:18] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-19 10:28:18] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:28:19] [INFO ] [Nat]Absence check using 550 positive place invariants in 198 ms returned sat
[2023-03-19 10:28:20] [INFO ] After 788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:28:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 10:28:20] [INFO ] After 66ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 10:28:20] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-19 10:28:20] [INFO ] After 1594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 123 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 1249/1249 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 44 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-19 10:28:20] [INFO ] Invariant cache hit.
[2023-03-19 10:28:21] [INFO ] Implicit Places using invariants in 1004 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1006 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1247/1249 places, 1048/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 1046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 86 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-19 10:28:21] [INFO ] Computed 548 place invariants in 1 ms
[2023-03-19 10:28:22] [INFO ] Implicit Places using invariants in 848 ms returned []
[2023-03-19 10:28:22] [INFO ] Invariant cache hit.
[2023-03-19 10:28:24] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 2526 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1245/1249 places, 1046/1048 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3662 ms. Remains : 1245/1249 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 153818 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153818 steps, saw 128434 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 10:28:27] [INFO ] Invariant cache hit.
[2023-03-19 10:28:27] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:28:28] [INFO ] [Nat]Absence check using 548 positive place invariants in 114 ms returned sat
[2023-03-19 10:28:28] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:28:28] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 0 ms to minimize.
[2023-03-19 10:28:29] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-19 10:28:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2023-03-19 10:28:29] [INFO ] After 1109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-19 10:28:29] [INFO ] After 1588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 47 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 90 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-19 10:28:29] [INFO ] Invariant cache hit.
[2023-03-19 10:28:30] [INFO ] Implicit Places using invariants in 871 ms returned []
[2023-03-19 10:28:30] [INFO ] Invariant cache hit.
[2023-03-19 10:28:32] [INFO ] Implicit Places using invariants and state equation in 2087 ms returned []
Implicit Place search using SMT with State Equation took 2977 ms to find 0 implicit places.
[2023-03-19 10:28:32] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-19 10:28:32] [INFO ] Invariant cache hit.
[2023-03-19 10:28:33] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3813 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 137 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-19 10:28:33] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-19 10:28:33] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:28:33] [INFO ] [Nat]Absence check using 548 positive place invariants in 230 ms returned sat
[2023-03-19 10:28:34] [INFO ] After 581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:28:34] [INFO ] State equation strengthened by 294 read => feed constraints.
[2023-03-19 10:28:34] [INFO ] After 183ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 10:28:34] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-19 10:28:34] [INFO ] After 1484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 402 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 414 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-19 10:28:36] [INFO ] Computed 551 place invariants in 22 ms
[2023-03-19 10:28:38] [INFO ] Implicit Places using invariants in 1665 ms returned []
[2023-03-19 10:28:38] [INFO ] Invariant cache hit.
[2023-03-19 10:28:42] [INFO ] Implicit Places using invariants and state equation in 4059 ms returned []
Implicit Place search using SMT with State Equation took 5732 ms to find 0 implicit places.
[2023-03-19 10:28:42] [INFO ] Invariant cache hit.
[2023-03-19 10:28:44] [INFO ] Dead Transitions using invariants and state equation in 1901 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8076 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 10:28:44] [INFO ] Invariant cache hit.
[2023-03-19 10:28:45] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:28:46] [INFO ] [Nat]Absence check using 551 positive place invariants in 343 ms returned sat
[2023-03-19 10:28:48] [INFO ] After 2099ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:28:49] [INFO ] Deduced a trap composed of 26 places in 1010 ms of which 2 ms to minimize.
[2023-03-19 10:28:50] [INFO ] Deduced a trap composed of 22 places in 1000 ms of which 2 ms to minimize.
[2023-03-19 10:28:52] [INFO ] Deduced a trap composed of 28 places in 1548 ms of which 11 ms to minimize.
[2023-03-19 10:28:54] [INFO ] Deduced a trap composed of 24 places in 1296 ms of which 3 ms to minimize.
[2023-03-19 10:28:55] [INFO ] Deduced a trap composed of 18 places in 1175 ms of which 2 ms to minimize.
[2023-03-19 10:28:56] [INFO ] Deduced a trap composed of 18 places in 1428 ms of which 2 ms to minimize.
[2023-03-19 10:28:58] [INFO ] Deduced a trap composed of 18 places in 967 ms of which 1 ms to minimize.
[2023-03-19 10:28:58] [INFO ] Deduced a trap composed of 20 places in 856 ms of which 2 ms to minimize.
[2023-03-19 10:28:59] [INFO ] Deduced a trap composed of 26 places in 811 ms of which 2 ms to minimize.
[2023-03-19 10:29:01] [INFO ] Deduced a trap composed of 20 places in 903 ms of which 2 ms to minimize.
[2023-03-19 10:29:02] [INFO ] Deduced a trap composed of 29 places in 1054 ms of which 3 ms to minimize.
[2023-03-19 10:29:03] [INFO ] Deduced a trap composed of 28 places in 1304 ms of which 2 ms to minimize.
[2023-03-19 10:29:04] [INFO ] Deduced a trap composed of 28 places in 1057 ms of which 9 ms to minimize.
[2023-03-19 10:29:05] [INFO ] Deduced a trap composed of 24 places in 766 ms of which 2 ms to minimize.
[2023-03-19 10:29:06] [INFO ] Deduced a trap composed of 32 places in 730 ms of which 1 ms to minimize.
[2023-03-19 10:29:07] [INFO ] Deduced a trap composed of 36 places in 722 ms of which 2 ms to minimize.
[2023-03-19 10:29:08] [INFO ] Deduced a trap composed of 27 places in 784 ms of which 2 ms to minimize.
[2023-03-19 10:29:09] [INFO ] Deduced a trap composed of 27 places in 887 ms of which 2 ms to minimize.
[2023-03-19 10:29:10] [INFO ] Deduced a trap composed of 25 places in 660 ms of which 1 ms to minimize.
[2023-03-19 10:29:11] [INFO ] Deduced a trap composed of 22 places in 723 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-19 10:29:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 10:29:11] [INFO ] After 25795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 3351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3351 transition count 2302
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 2652 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 2651 transition count 2301
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1400 place count 2651 transition count 1902
Deduced a syphon composed of 399 places in 4 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 2198 place count 2252 transition count 1902
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3896 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3897 place count 1403 transition count 1052
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3899 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4101 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4197 place count 1253 transition count 1051
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4346 place count 1253 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4347 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4348 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4348 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4352 place count 1249 transition count 1048
Applied a total of 4352 rules in 727 ms. Remains 1249 /3351 variables (removed 2102) and now considering 1048/3001 (removed 1953) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 727 ms. Remains : 1249/3351 places, 1048/3001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 146656 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146656 steps, saw 122610 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-19 10:29:15] [INFO ] Computed 550 place invariants in 10 ms
[2023-03-19 10:29:15] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:29:15] [INFO ] [Nat]Absence check using 550 positive place invariants in 143 ms returned sat
[2023-03-19 10:29:16] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:29:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 10:29:16] [INFO ] After 66ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 10:29:16] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2023-03-19 10:29:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-19 10:29:16] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-19 10:29:16] [INFO ] After 1582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 39 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1249/1249 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 38 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-19 10:29:17] [INFO ] Invariant cache hit.
[2023-03-19 10:29:17] [INFO ] Implicit Places using invariants in 790 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 806 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1247/1249 places, 1048/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 1046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 68 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-19 10:29:17] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-19 10:29:18] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-19 10:29:18] [INFO ] Invariant cache hit.
[2023-03-19 10:29:20] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2503 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1245/1249 places, 1046/1048 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3415 ms. Remains : 1245/1249 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 161159 steps, run timeout after 3017 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161159 steps, saw 134707 distinct states, run finished after 3017 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 10:29:23] [INFO ] Invariant cache hit.
[2023-03-19 10:29:23] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:29:24] [INFO ] [Nat]Absence check using 548 positive place invariants in 149 ms returned sat
[2023-03-19 10:29:24] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:29:25] [INFO ] After 663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-19 10:29:25] [INFO ] After 1180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 64 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 48 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-19 10:29:25] [INFO ] Invariant cache hit.
[2023-03-19 10:29:26] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2023-03-19 10:29:26] [INFO ] Invariant cache hit.
[2023-03-19 10:29:28] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 3154 ms to find 0 implicit places.
[2023-03-19 10:29:28] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-19 10:29:28] [INFO ] Invariant cache hit.
[2023-03-19 10:29:29] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3946 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 79 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-19 10:29:29] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-19 10:29:29] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:29:29] [INFO ] [Nat]Absence check using 548 positive place invariants in 84 ms returned sat
[2023-03-19 10:29:30] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:29:30] [INFO ] State equation strengthened by 294 read => feed constraints.
[2023-03-19 10:29:30] [INFO ] After 163ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 10:29:30] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 1 ms to minimize.
[2023-03-19 10:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
[2023-03-19 10:29:30] [INFO ] After 696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-19 10:29:30] [INFO ] After 1544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 408 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33366 reset in 1785 ms.
Product exploration explored 100000 steps with 33284 reset in 1840 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3351 transition count 3001
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 248 Pre rules applied. Total rules applied 700 place count 3351 transition count 3199
Deduced a syphon composed of 948 places in 6 ms
Iterating global reduction 1 with 248 rules applied. Total rules applied 948 place count 3351 transition count 3199
Performed 950 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1898 places in 8 ms
Iterating global reduction 1 with 950 rules applied. Total rules applied 1898 place count 3351 transition count 3199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1899 place count 3351 transition count 3198
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 2 with 352 rule applications. Total rules 2251 place count 2999 transition count 2846
Deduced a syphon composed of 1546 places in 7 ms
Iterating global reduction 2 with 352 rules applied. Total rules applied 2603 place count 2999 transition count 2846
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1547 places in 7 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2604 place count 2999 transition count 2846
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2606 place count 2997 transition count 2844
Deduced a syphon composed of 1545 places in 7 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2608 place count 2997 transition count 2844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1646 places in 19 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2709 place count 2997 transition count 3274
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2810 place count 2896 transition count 3072
Deduced a syphon composed of 1545 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2911 place count 2896 transition count 3072
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -411
Deduced a syphon composed of 1641 places in 3 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 3007 place count 2896 transition count 3483
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 3103 place count 2800 transition count 3291
Deduced a syphon composed of 1545 places in 3 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 3199 place count 2800 transition count 3291
Deduced a syphon composed of 1545 places in 3 ms
Applied a total of 3199 rules in 2614 ms. Remains 2800 /3351 variables (removed 551) and now considering 3291/3001 (removed -290) transitions.
[2023-03-19 10:29:39] [INFO ] Redundant transitions in 96 ms returned []
// Phase 1: matrix 3291 rows 2800 cols
[2023-03-19 10:29:39] [INFO ] Computed 551 place invariants in 61 ms
[2023-03-19 10:29:41] [INFO ] Dead Transitions using invariants and state equation in 2442 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/3351 places, 3291/3001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5168 ms. Remains : 2800/3351 places, 3291/3001 transitions.
Built C files in :
/tmp/ltsmin2582907605334357217
[2023-03-19 10:29:41] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2582907605334357217
Running compilation step : cd /tmp/ltsmin2582907605334357217;'/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/ltsmin2582907605334357217;'/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/ltsmin2582907605334357217;'/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 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 306 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-19 10:29:45] [INFO ] Computed 551 place invariants in 9 ms
[2023-03-19 10:29:46] [INFO ] Implicit Places using invariants in 1909 ms returned []
[2023-03-19 10:29:46] [INFO ] Invariant cache hit.
[2023-03-19 10:29:51] [INFO ] Implicit Places using invariants and state equation in 4730 ms returned []
Implicit Place search using SMT with State Equation took 6657 ms to find 0 implicit places.
[2023-03-19 10:29:51] [INFO ] Invariant cache hit.
[2023-03-19 10:29:53] [INFO ] Dead Transitions using invariants and state equation in 2027 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9005 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Built C files in :
/tmp/ltsmin4436521532856359264
[2023-03-19 10:29:53] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4436521532856359264
Running compilation step : cd /tmp/ltsmin4436521532856359264;'/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/ltsmin4436521532856359264;'/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/ltsmin4436521532856359264;'/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-19 10:29:57] [INFO ] Flatten gal took : 155 ms
[2023-03-19 10:29:57] [INFO ] Flatten gal took : 103 ms
[2023-03-19 10:29:57] [INFO ] Time to serialize gal into /tmp/LTL10309787261348527169.gal : 20 ms
[2023-03-19 10:29:57] [INFO ] Time to serialize properties into /tmp/LTL2332196034631940418.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10309787261348527169.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14262659143614232157.hoa' '-atoms' '/tmp/LTL2332196034631940418.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
Loading property file /tmp/LTL2332196034631940418.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14262659143614232157.hoa
Detected timeout of ITS tools.
[2023-03-19 10:30:12] [INFO ] Flatten gal took : 87 ms
[2023-03-19 10:30:12] [INFO ] Flatten gal took : 91 ms
[2023-03-19 10:30:12] [INFO ] Time to serialize gal into /tmp/LTL11262996778879768233.gal : 17 ms
[2023-03-19 10:30:12] [INFO ] Time to serialize properties into /tmp/LTL1838925161670016551.ltl : 7 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/LTL11262996778879768233.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1838925161670016551.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
Checking formula 0 : !((G((F("(p3259==0)"))&&(F(("(p256==0)")&&(X("(p256==0)")))))))
Formula 0 simplified : F(G!"(p3259==0)" | G(!"(p256==0)" | X!"(p256==0)"))
Detected timeout of ITS tools.
[2023-03-19 10:30:27] [INFO ] Flatten gal took : 98 ms
[2023-03-19 10:30:27] [INFO ] Applying decomposition
[2023-03-19 10:30:27] [INFO ] Flatten gal took : 70 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/graph5635596904904337802.txt' '-o' '/tmp/graph5635596904904337802.bin' '-w' '/tmp/graph5635596904904337802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5635596904904337802.bin' '-l' '-1' '-v' '-w' '/tmp/graph5635596904904337802.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:30:28] [INFO ] Decomposing Gal with order
[2023-03-19 10:30:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:30:28] [INFO ] Removed a total of 502 redundant transitions.
[2023-03-19 10:30:28] [INFO ] Flatten gal took : 223 ms
[2023-03-19 10:30:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2023-03-19 10:30:29] [INFO ] Time to serialize gal into /tmp/LTL2843850517140411008.gal : 31 ms
[2023-03-19 10:30:29] [INFO ] Time to serialize properties into /tmp/LTL3648105587607116904.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/LTL2843850517140411008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3648105587607116904.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((G((F("(i42.i0.i3.u1003.p3259==0)"))&&(F(("(i5.u86.p256==0)")&&(X("(i5.u86.p256==0)")))))))
Formula 0 simplified : F(G!"(i42.i0.i3.u1003.p3259==0)" | G(!"(i5.u86.p256==0)" | X!"(i5.u86.p256==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin529830480127696502
[2023-03-19 10:30:44] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin529830480127696502
Running compilation step : cd /tmp/ltsmin529830480127696502;'/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/ltsmin529830480127696502;'/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/ltsmin529830480127696502;'/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 ShieldPPPt-PT-050B-LTLFireability-09 finished in 197349 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)||F(p1)||G(p2))))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 657 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
[2023-03-19 10:30:47] [INFO ] Invariant cache hit.
[2023-03-19 10:30:49] [INFO ] Implicit Places using invariants in 1647 ms returned []
[2023-03-19 10:30:49] [INFO ] Invariant cache hit.
[2023-03-19 10:30:54] [INFO ] Implicit Places using invariants and state equation in 4574 ms returned []
Implicit Place search using SMT with State Equation took 6240 ms to find 0 implicit places.
[2023-03-19 10:30:54] [INFO ] Invariant cache hit.
[2023-03-19 10:30:57] [INFO ] Dead Transitions using invariants and state equation in 3145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10043 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 355 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s1075 1), p2:(NEQ s2734 1), p0:(EQ s1313 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 119 reset in 699 ms.
Product exploration explored 100000 steps with 117 reset in 789 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3351 stabilizing places and 798/3001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 1410 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 985 steps, including 0 resets, run visited all 3 properties in 25 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 17 factoid took 992 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 3351 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 310 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
[2023-03-19 10:31:02] [INFO ] Invariant cache hit.
[2023-03-19 10:31:04] [INFO ] Implicit Places using invariants in 1803 ms returned []
[2023-03-19 10:31:04] [INFO ] Invariant cache hit.
[2023-03-19 10:31:08] [INFO ] Implicit Places using invariants and state equation in 4570 ms returned []
Implicit Place search using SMT with State Equation took 6376 ms to find 0 implicit places.
[2023-03-19 10:31:08] [INFO ] Invariant cache hit.
[2023-03-19 10:31:11] [INFO ] Dead Transitions using invariants and state equation in 2664 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9350 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3351 stabilizing places and 798/3001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 503 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 838 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 8 factoid took 650 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 121 reset in 684 ms.
Product exploration explored 100000 steps with 121 reset in 752 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3351 transition count 3001
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 250 Pre rules applied. Total rules applied 700 place count 3351 transition count 3201
Deduced a syphon composed of 950 places in 6 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 950 place count 3351 transition count 3201
Performed 946 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1896 places in 8 ms
Iterating global reduction 1 with 946 rules applied. Total rules applied 1896 place count 3351 transition count 3201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1897 place count 3351 transition count 3200
Renaming transitions due to excessive name length > 1024 char.
Discarding 350 places :
Symmetric choice reduction at 2 with 350 rule applications. Total rules 2247 place count 3001 transition count 2850
Deduced a syphon composed of 1546 places in 6 ms
Iterating global reduction 2 with 350 rules applied. Total rules applied 2597 place count 3001 transition count 2850
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1547 places in 6 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2598 place count 3001 transition count 2850
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2600 place count 2999 transition count 2848
Deduced a syphon composed of 1545 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2602 place count 2999 transition count 2848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1646 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2703 place count 2999 transition count 3278
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2804 place count 2898 transition count 3076
Deduced a syphon composed of 1545 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2905 place count 2898 transition count 3076
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 1643 places in 6 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3003 place count 2898 transition count 3491
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 3101 place count 2800 transition count 3295
Deduced a syphon composed of 1545 places in 5 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3199 place count 2800 transition count 3295
Deduced a syphon composed of 1545 places in 6 ms
Applied a total of 3199 rules in 1979 ms. Remains 2800 /3351 variables (removed 551) and now considering 3295/3001 (removed -294) transitions.
[2023-03-19 10:31:17] [INFO ] Redundant transitions in 140 ms returned []
// Phase 1: matrix 3295 rows 2800 cols
[2023-03-19 10:31:17] [INFO ] Computed 551 place invariants in 28 ms
[2023-03-19 10:31:20] [INFO ] Dead Transitions using invariants and state equation in 3294 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/3351 places, 3295/3001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5426 ms. Remains : 2800/3351 places, 3295/3001 transitions.
Built C files in :
/tmp/ltsmin15718779789334988069
[2023-03-19 10:31:20] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15718779789334988069
Running compilation step : cd /tmp/ltsmin15718779789334988069;'/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/ltsmin15718779789334988069;'/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/ltsmin15718779789334988069;'/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 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 310 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-19 10:31:24] [INFO ] Computed 551 place invariants in 23 ms
[2023-03-19 10:31:25] [INFO ] Implicit Places using invariants in 1709 ms returned []
[2023-03-19 10:31:25] [INFO ] Invariant cache hit.
[2023-03-19 10:31:28] [INFO ] Implicit Places using invariants and state equation in 2401 ms returned []
Implicit Place search using SMT with State Equation took 4126 ms to find 0 implicit places.
[2023-03-19 10:31:28] [INFO ] Invariant cache hit.
[2023-03-19 10:31:31] [INFO ] Dead Transitions using invariants and state equation in 3076 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7525 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Built C files in :
/tmp/ltsmin8414466912639568916
[2023-03-19 10:31:31] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8414466912639568916
Running compilation step : cd /tmp/ltsmin8414466912639568916;'/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/ltsmin8414466912639568916;'/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/ltsmin8414466912639568916;'/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-19 10:31:34] [INFO ] Flatten gal took : 89 ms
[2023-03-19 10:31:34] [INFO ] Flatten gal took : 104 ms
[2023-03-19 10:31:34] [INFO ] Time to serialize gal into /tmp/LTL13167034418009481762.gal : 18 ms
[2023-03-19 10:31:34] [INFO ] Time to serialize properties into /tmp/LTL18340602407085526532.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13167034418009481762.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17841989823510366389.hoa' '-atoms' '/tmp/LTL18340602407085526532.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...320
Loading property file /tmp/LTL18340602407085526532.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17841989823510366389.hoa
Detected timeout of ITS tools.
[2023-03-19 10:31:50] [INFO ] Flatten gal took : 97 ms
[2023-03-19 10:31:50] [INFO ] Flatten gal took : 83 ms
[2023-03-19 10:31:50] [INFO ] Time to serialize gal into /tmp/LTL3578426797187983398.gal : 26 ms
[2023-03-19 10:31:50] [INFO ] Time to serialize properties into /tmp/LTL9037048107348633471.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/LTL3578426797187983398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9037048107348633471.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("(p1522==1)"))||(F("(p1240==1)")))||(G("(p3177!=1)")))))
Formula 0 simplified : X(F!"(p1522==1)" & G!"(p1240==1)" & F!"(p3177!=1)")
Detected timeout of ITS tools.
[2023-03-19 10:32:05] [INFO ] Flatten gal took : 80 ms
[2023-03-19 10:32:05] [INFO ] Applying decomposition
[2023-03-19 10:32:05] [INFO ] Flatten gal took : 89 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/graph12587653589610490948.txt' '-o' '/tmp/graph12587653589610490948.bin' '-w' '/tmp/graph12587653589610490948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12587653589610490948.bin' '-l' '-1' '-v' '-w' '/tmp/graph12587653589610490948.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:32:05] [INFO ] Decomposing Gal with order
[2023-03-19 10:32:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:32:06] [INFO ] Removed a total of 501 redundant transitions.
[2023-03-19 10:32:06] [INFO ] Flatten gal took : 136 ms
[2023-03-19 10:32:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2023-03-19 10:32:06] [INFO ] Time to serialize gal into /tmp/LTL1093920667043525540.gal : 66 ms
[2023-03-19 10:32:06] [INFO ] Time to serialize properties into /tmp/LTL9004616392757843456.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/LTL1093920667043525540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9004616392757843456.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((X(((G("(i22.u470.p1522==1)"))||(F("(i19.u385.p1240==1)")))||(G("(i41.u973.p3177!=1)")))))
Formula 0 simplified : X(F!"(i22.u470.p1522==1)" & G!"(i19.u385.p1240==1)" & F!"(i41.u973.p3177!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7867231316109077814
[2023-03-19 10:32:21] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7867231316109077814
Running compilation step : cd /tmp/ltsmin7867231316109077814;'/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/ltsmin7867231316109077814;'/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/ltsmin7867231316109077814;'/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 ShieldPPPt-PT-050B-LTLFireability-10 finished in 97428 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(p1))))'
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 466 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-19 10:32:25] [INFO ] Computed 551 place invariants in 32 ms
[2023-03-19 10:32:26] [INFO ] Implicit Places using invariants in 1499 ms returned []
[2023-03-19 10:32:26] [INFO ] Invariant cache hit.
[2023-03-19 10:32:30] [INFO ] Implicit Places using invariants and state equation in 4086 ms returned []
Implicit Place search using SMT with State Equation took 5631 ms to find 0 implicit places.
[2023-03-19 10:32:30] [INFO ] Invariant cache hit.
[2023-03-19 10:32:33] [INFO ] Dead Transitions using invariants and state equation in 2258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8371 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s2245 1), p1:(EQ s1562 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-11 finished in 8588 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||(p1&&G(p2))))||G(p3)))'
Support contains 4 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3363 transition count 2314
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 2664 transition count 2314
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1398 place count 2664 transition count 1920
Deduced a syphon composed of 394 places in 4 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2196 place count 2260 transition count 1910
Iterating global reduction 2 with 10 rules applied. Total rules applied 2206 place count 2260 transition count 1910
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2206 place count 2260 transition count 1902
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2222 place count 2252 transition count 1902
Performed 844 Post agglomeration using F-continuation condition.Transition count delta: 844
Deduced a syphon composed of 844 places in 1 ms
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 2 with 1688 rules applied. Total rules applied 3910 place count 1408 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3911 place count 1408 transition count 1057
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3913 place count 1407 transition count 1056
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4115 place count 1306 transition count 1056
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4211 place count 1258 transition count 1056
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4213 place count 1256 transition count 1054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4214 place count 1255 transition count 1054
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4214 place count 1255 transition count 1052
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4218 place count 1253 transition count 1052
Applied a total of 4218 rules in 731 ms. Remains 1253 /3364 variables (removed 2111) and now considering 1052/3014 (removed 1962) transitions.
// Phase 1: matrix 1052 rows 1253 cols
[2023-03-19 10:32:33] [INFO ] Computed 550 place invariants in 2 ms
[2023-03-19 10:32:34] [INFO ] Implicit Places using invariants in 936 ms returned [1236, 1240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 951 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/3364 places, 1052/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1249 transition count 1050
Applied a total of 4 rules in 47 ms. Remains 1249 /1251 variables (removed 2) and now considering 1050/1052 (removed 2) transitions.
// Phase 1: matrix 1050 rows 1249 cols
[2023-03-19 10:32:34] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-19 10:32:35] [INFO ] Implicit Places using invariants in 713 ms returned []
[2023-03-19 10:32:35] [INFO ] Invariant cache hit.
[2023-03-19 10:32:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 10:32:37] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2624 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1249/3364 places, 1050/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4353 ms. Remains : 1249/3364 places, 1050/3014 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=1 dest: 0}, { cond=(AND p0 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2 p3) (AND p1 p2 p3)), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p2) p3)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(EQ s1159 0), p1:(EQ s53 0), p3:(EQ s530 0), p2:(EQ s1226 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 113 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-12 finished in 4663 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' '!((p0 U G(!p0)))'
Support contains 1 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3363 transition count 2315
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 2665 transition count 2315
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1396 place count 2665 transition count 1920
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2196 place count 2260 transition count 1910
Iterating global reduction 2 with 10 rules applied. Total rules applied 2206 place count 2260 transition count 1910
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2206 place count 2260 transition count 1902
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2222 place count 2252 transition count 1902
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 2 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3918 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3919 place count 1404 transition count 1053
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3921 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4123 place count 1302 transition count 1052
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4219 place count 1254 transition count 1052
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4221 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4222 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4222 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4226 place count 1249 transition count 1048
Applied a total of 4226 rules in 684 ms. Remains 1249 /3364 variables (removed 2115) and now considering 1048/3014 (removed 1966) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-19 10:32:38] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-19 10:32:39] [INFO ] Implicit Places using invariants in 866 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 868 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3364 places, 1048/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 48 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-19 10:32:39] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-19 10:32:40] [INFO ] Implicit Places using invariants in 994 ms returned []
[2023-03-19 10:32:40] [INFO ] Invariant cache hit.
[2023-03-19 10:32:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 10:32:42] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2835 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3364 places, 1046/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4435 ms. Remains : 1245/3364 places, 1046/3014 transitions.
Stuttering acceptance computed with spot in 166 ms :[p0, true, p0]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(NEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-13 finished in 4623 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 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3363 transition count 2313
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2663 transition count 2313
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1400 place count 2663 transition count 1918
Deduced a syphon composed of 395 places in 4 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2190 place count 2268 transition count 1918
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2200 place count 2258 transition count 1908
Iterating global reduction 2 with 10 rules applied. Total rules applied 2210 place count 2258 transition count 1908
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2210 place count 2258 transition count 1901
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 2224 place count 2251 transition count 1901
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 2 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3920 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3921 place count 1403 transition count 1052
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3923 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4125 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4221 place count 1253 transition count 1051
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4223 place count 1251 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4224 place count 1250 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4224 place count 1250 transition count 1047
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4228 place count 1248 transition count 1047
Applied a total of 4228 rules in 729 ms. Remains 1248 /3364 variables (removed 2116) and now considering 1047/3014 (removed 1967) transitions.
// Phase 1: matrix 1047 rows 1248 cols
[2023-03-19 10:32:43] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-19 10:32:44] [INFO ] Implicit Places using invariants in 826 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 827 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1246/3364 places, 1047/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 1045
Applied a total of 4 rules in 48 ms. Remains 1244 /1246 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2023-03-19 10:32:44] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-19 10:32:44] [INFO ] Implicit Places using invariants in 819 ms returned []
[2023-03-19 10:32:44] [INFO ] Invariant cache hit.
[2023-03-19 10:32:47] [INFO ] Implicit Places using invariants and state equation in 2453 ms returned []
Implicit Place search using SMT with State Equation took 3283 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1244/3364 places, 1045/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4887 ms. Remains : 1244/3364 places, 1045/3014 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s200 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 773 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-14 finished in 5758 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&&(F(G(p1))||G((F(p2)&&(!p1 U (p3||G(!p1)))))))))'
Support contains 5 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 3363 transition count 2317
Reduce places removed 696 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 698 rules applied. Total rules applied 1394 place count 2667 transition count 2315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1396 place count 2665 transition count 2315
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 1396 place count 2665 transition count 1921
Deduced a syphon composed of 394 places in 3 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 2184 place count 2271 transition count 1921
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2195 place count 2260 transition count 1910
Iterating global reduction 3 with 11 rules applied. Total rules applied 2206 place count 2260 transition count 1910
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 2206 place count 2260 transition count 1902
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 2222 place count 2252 transition count 1902
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 2 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 3 with 1692 rules applied. Total rules applied 3914 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3915 place count 1406 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3917 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4119 place count 1304 transition count 1054
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 4211 place count 1258 transition count 1054
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4213 place count 1256 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4214 place count 1255 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4214 place count 1255 transition count 1050
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4218 place count 1253 transition count 1050
Applied a total of 4218 rules in 706 ms. Remains 1253 /3364 variables (removed 2111) and now considering 1050/3014 (removed 1964) transitions.
// Phase 1: matrix 1050 rows 1253 cols
[2023-03-19 10:32:49] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-19 10:32:49] [INFO ] Implicit Places using invariants in 858 ms returned [1236, 1240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 882 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/3364 places, 1050/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1249 transition count 1048
Applied a total of 4 rules in 51 ms. Remains 1249 /1251 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-19 10:32:49] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-19 10:32:50] [INFO ] Implicit Places using invariants in 774 ms returned []
[2023-03-19 10:32:50] [INFO ] Invariant cache hit.
[2023-03-19 10:32:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 10:32:52] [INFO ] Implicit Places using invariants and state equation in 1924 ms returned []
Implicit Place search using SMT with State Equation took 2712 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1249/3364 places, 1048/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4351 ms. Remains : 1249/3364 places, 1048/3014 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={1, 2} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND p1 p3), acceptance={1} source=3 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={1, 2} source=3 dest: 4}], [{ cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 2} source=4 dest: 2}, { cond=(AND p0 p1 p3), acceptance={1} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p3))), acceptance={1, 2} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1207 1), p1:(EQ s455 1), p2:(EQ s147 1), p3:(AND (NEQ s455 1) (NOT (AND (EQ s640 1) (EQ s642 1))))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 841 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-15 finished in 5660 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)&&F((p1&&X(p1))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-050B-LTLFireability-09
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3363 transition count 2315
Reduce places removed 698 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 700 rules applied. Total rules applied 1398 place count 2665 transition count 2313
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1400 place count 2663 transition count 2313
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 393 Pre rules applied. Total rules applied 1400 place count 2663 transition count 1920
Deduced a syphon composed of 393 places in 4 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2197 place count 2259 transition count 1909
Iterating global reduction 3 with 11 rules applied. Total rules applied 2208 place count 2259 transition count 1909
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 2208 place count 2259 transition count 1901
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 2224 place count 2251 transition count 1901
Performed 845 Post agglomeration using F-continuation condition.Transition count delta: 845
Deduced a syphon composed of 845 places in 1 ms
Reduce places removed 845 places and 0 transitions.
Iterating global reduction 3 with 1690 rules applied. Total rules applied 3914 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3915 place count 1406 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3917 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4119 place count 1304 transition count 1054
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4215 place count 1256 transition count 1054
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4217 place count 1254 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4218 place count 1253 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4218 place count 1253 transition count 1050
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4222 place count 1251 transition count 1050
Applied a total of 4222 rules in 790 ms. Remains 1251 /3364 variables (removed 2113) and now considering 1050/3014 (removed 1964) transitions.
// Phase 1: matrix 1050 rows 1251 cols
[2023-03-19 10:32:55] [INFO ] Computed 550 place invariants in 18 ms
[2023-03-19 10:32:55] [INFO ] Implicit Places using invariants in 807 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 809 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1249/3364 places, 1050/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1247 transition count 1048
Applied a total of 4 rules in 50 ms. Remains 1247 /1249 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2023-03-19 10:32:55] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-19 10:32:56] [INFO ] Implicit Places using invariants in 846 ms returned []
[2023-03-19 10:32:56] [INFO ] Invariant cache hit.
[2023-03-19 10:32:58] [INFO ] Implicit Places using invariants and state equation in 2013 ms returned []
Implicit Place search using SMT with State Equation took 2874 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1247/3364 places, 1048/3014 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4523 ms. Remains : 1247/3364 places, 1048/3014 transitions.
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s1050 0), p1:(EQ s73 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33339 reset in 1301 ms.
Product exploration explored 100000 steps with 33300 reset in 1488 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 390 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 10:33:02] [INFO ] Invariant cache hit.
[2023-03-19 10:33:02] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:33:03] [INFO ] [Nat]Absence check using 548 positive place invariants in 155 ms returned sat
[2023-03-19 10:33:03] [INFO ] After 610ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:33:03] [INFO ] After 720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-19 10:33:04] [INFO ] After 1224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1247 transition count 1047
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1246 transition count 1047
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 81 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1245/1247 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187388 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187388 steps, saw 134777 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-19 10:33:07] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-19 10:33:07] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:33:07] [INFO ] [Nat]Absence check using 548 positive place invariants in 221 ms returned sat
[2023-03-19 10:33:08] [INFO ] After 844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:33:08] [INFO ] After 901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-19 10:33:09] [INFO ] After 1402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 46 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 27 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-19 10:33:09] [INFO ] Invariant cache hit.
[2023-03-19 10:33:10] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2023-03-19 10:33:10] [INFO ] Invariant cache hit.
[2023-03-19 10:33:12] [INFO ] Implicit Places using invariants and state equation in 2179 ms returned []
Implicit Place search using SMT with State Equation took 3319 ms to find 0 implicit places.
[2023-03-19 10:33:12] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-19 10:33:12] [INFO ] Invariant cache hit.
[2023-03-19 10:33:13] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4221 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 59 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-19 10:33:13] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-19 10:33:13] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:33:13] [INFO ] [Nat]Absence check using 548 positive place invariants in 85 ms returned sat
[2023-03-19 10:33:14] [INFO ] After 656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:33:14] [INFO ] After 732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-19 10:33:14] [INFO ] After 1087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 367 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 21 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2023-03-19 10:33:15] [INFO ] Computed 548 place invariants in 1 ms
[2023-03-19 10:33:16] [INFO ] Implicit Places using invariants in 1247 ms returned []
[2023-03-19 10:33:16] [INFO ] Invariant cache hit.
[2023-03-19 10:33:19] [INFO ] Implicit Places using invariants and state equation in 2683 ms returned []
Implicit Place search using SMT with State Equation took 3944 ms to find 0 implicit places.
[2023-03-19 10:33:19] [INFO ] Invariant cache hit.
[2023-03-19 10:33:20] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5035 ms. Remains : 1247/1247 places, 1048/1048 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 10:33:21] [INFO ] Invariant cache hit.
[2023-03-19 10:33:21] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:33:21] [INFO ] [Nat]Absence check using 548 positive place invariants in 200 ms returned sat
[2023-03-19 10:33:22] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:33:22] [INFO ] After 692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-19 10:33:22] [INFO ] After 1148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1247 transition count 1047
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1246 transition count 1047
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 73 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1245/1247 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 182942 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182942 steps, saw 131742 distinct states, run finished after 3011 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-19 10:33:26] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-19 10:33:26] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:33:26] [INFO ] [Nat]Absence check using 548 positive place invariants in 143 ms returned sat
[2023-03-19 10:33:27] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:33:27] [INFO ] After 642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-19 10:33:27] [INFO ] After 1011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 28 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 26 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-19 10:33:27] [INFO ] Invariant cache hit.
[2023-03-19 10:33:28] [INFO ] Implicit Places using invariants in 1020 ms returned []
[2023-03-19 10:33:28] [INFO ] Invariant cache hit.
[2023-03-19 10:33:29] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 2627 ms to find 0 implicit places.
[2023-03-19 10:33:29] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-19 10:33:29] [INFO ] Invariant cache hit.
[2023-03-19 10:33:30] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3434 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 62 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-19 10:33:30] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-19 10:33:30] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:33:31] [INFO ] [Nat]Absence check using 548 positive place invariants in 142 ms returned sat
[2023-03-19 10:33:31] [INFO ] After 751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:33:32] [INFO ] After 859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-19 10:33:32] [INFO ] After 1250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 365 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33370 reset in 1272 ms.
Product exploration explored 100000 steps with 33291 reset in 1468 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 42 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-19 10:33:36] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1048 rows 1247 cols
[2023-03-19 10:33:36] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-19 10:33:37] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1083 ms. Remains : 1247/1247 places, 1048/1048 transitions.
Built C files in :
/tmp/ltsmin7494682946161777864
[2023-03-19 10:33:37] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7494682946161777864
Running compilation step : cd /tmp/ltsmin7494682946161777864;'/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'
Compilation finished in 2192 ms.
Running link step : cd /tmp/ltsmin7494682946161777864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin7494682946161777864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6895608492506897106.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 18 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-19 10:33:52] [INFO ] Invariant cache hit.
[2023-03-19 10:33:53] [INFO ] Implicit Places using invariants in 836 ms returned []
[2023-03-19 10:33:53] [INFO ] Invariant cache hit.
[2023-03-19 10:33:55] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 2942 ms to find 0 implicit places.
[2023-03-19 10:33:55] [INFO ] Invariant cache hit.
[2023-03-19 10:33:56] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3602 ms. Remains : 1247/1247 places, 1048/1048 transitions.
Built C files in :
/tmp/ltsmin1571536615758978624
[2023-03-19 10:33:56] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1571536615758978624
Running compilation step : cd /tmp/ltsmin1571536615758978624;'/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'
Compilation finished in 2067 ms.
Running link step : cd /tmp/ltsmin1571536615758978624;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin1571536615758978624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1291965497187388358.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 10:34:11] [INFO ] Flatten gal took : 31 ms
[2023-03-19 10:34:11] [INFO ] Flatten gal took : 32 ms
[2023-03-19 10:34:12] [INFO ] Time to serialize gal into /tmp/LTL4703755950324338503.gal : 445 ms
[2023-03-19 10:34:12] [INFO ] Time to serialize properties into /tmp/LTL12082442085996192170.prop : 16 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/LTL4703755950324338503.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18394960122189749808.hoa' '-atoms' '/tmp/LTL12082442085996192170.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
Loading property file /tmp/LTL12082442085996192170.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18394960122189749808.hoa
Detected timeout of ITS tools.
[2023-03-19 10:34:27] [INFO ] Flatten gal took : 28 ms
[2023-03-19 10:34:27] [INFO ] Flatten gal took : 28 ms
[2023-03-19 10:34:27] [INFO ] Time to serialize gal into /tmp/LTL3814649666708555381.gal : 24 ms
[2023-03-19 10:34:27] [INFO ] Time to serialize properties into /tmp/LTL6501772996401881141.ltl : 23 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/LTL3814649666708555381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6501772996401881141.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((F("(p3259==0)"))&&(F(("(p256==0)")&&(X("(p256==0)")))))))
Formula 0 simplified : F(G!"(p3259==0)" | G(!"(p256==0)" | X!"(p256==0)"))
Detected timeout of ITS tools.
[2023-03-19 10:34:42] [INFO ] Flatten gal took : 77 ms
[2023-03-19 10:34:42] [INFO ] Applying decomposition
[2023-03-19 10:34:42] [INFO ] Flatten gal took : 34 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/graph443807860702270131.txt' '-o' '/tmp/graph443807860702270131.bin' '-w' '/tmp/graph443807860702270131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph443807860702270131.bin' '-l' '-1' '-v' '-w' '/tmp/graph443807860702270131.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:34:42] [INFO ] Decomposing Gal with order
[2023-03-19 10:34:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:34:43] [INFO ] Removed a total of 305 redundant transitions.
[2023-03-19 10:34:43] [INFO ] Flatten gal took : 62 ms
[2023-03-19 10:34:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 12 ms.
[2023-03-19 10:34:43] [INFO ] Time to serialize gal into /tmp/LTL5009339417894885583.gal : 19 ms
[2023-03-19 10:34:43] [INFO ] Time to serialize properties into /tmp/LTL4532340780224674715.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/LTL5009339417894885583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4532340780224674715.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((G((F("(i22.i1.i0.u338.p3259==0)"))&&(F(("(i1.u25.p256==0)")&&(X("(i1.u25.p256==0)")))))))
Formula 0 simplified : F(G!"(i22.i1.i0.u338.p3259==0)" | G(!"(i1.u25.p256==0)" | X!"(i1.u25.p256==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
423 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.38256,92972,1,0,143672,293,3990,299237,215,1545,189087
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-09 finished in 114147 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + 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' '!(X((G(p0)||F(p1)||G(p2))))'
[2023-03-19 10:34:48] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9217038558202821206
[2023-03-19 10:34:48] [INFO ] Too many transitions (3014) to apply POR reductions. Disabling POR matrices.
[2023-03-19 10:34:48] [INFO ] Applying decomposition
[2023-03-19 10:34:48] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9217038558202821206
Running compilation step : cd /tmp/ltsmin9217038558202821206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' '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'
[2023-03-19 10:34:48] [INFO ] Flatten gal took : 76 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/graph13702802238248682956.txt' '-o' '/tmp/graph13702802238248682956.bin' '-w' '/tmp/graph13702802238248682956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13702802238248682956.bin' '-l' '-1' '-v' '-w' '/tmp/graph13702802238248682956.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:34:48] [INFO ] Decomposing Gal with order
[2023-03-19 10:34:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:34:49] [INFO ] Removed a total of 486 redundant transitions.
[2023-03-19 10:34:49] [INFO ] Flatten gal took : 119 ms
[2023-03-19 10:34:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 43 ms.
[2023-03-19 10:34:49] [INFO ] Time to serialize gal into /tmp/LTLFireability4439024154350205961.gal : 21 ms
[2023-03-19 10:34:49] [INFO ] Time to serialize properties into /tmp/LTLFireability4489905508755742441.ltl : 11 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/LTLFireability4439024154350205961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4489905508755742441.ltl' '-c' '-stutter-deadlock'

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 2 LTL properties
Checking formula 0 : !((G((F("(i42.u1007.p3259==0)"))&&(F(("(i4.i2.i2.u89.p256==0)")&&(X("(i4.i2.i2.u89.p256==0)")))))))
Formula 0 simplified : F(G!"(i42.u1007.p3259==0)" | G(!"(i4.i2.i2.u89.p256==0)" | X!"(i4.i2.i2.u89.p256==0)"))
Compilation finished in 7133 ms.
Running link step : cd /tmp/ltsmin9217038558202821206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin9217038558202821206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(((LTLAPp1==true)&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 10:58:21] [INFO ] Applying decomposition
[2023-03-19 10:58:21] [INFO ] Flatten gal took : 436 ms
[2023-03-19 10:58:21] [INFO ] Decomposing Gal with order
[2023-03-19 10:58:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:58:25] [INFO ] Removed a total of 145 redundant transitions.
[2023-03-19 10:58:25] [INFO ] Flatten gal took : 327 ms
[2023-03-19 10:58:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 590 labels/synchronizations in 204 ms.
[2023-03-19 10:58:26] [INFO ] Time to serialize gal into /tmp/LTLFireability16121398073471762479.gal : 71 ms
[2023-03-19 10:58:26] [INFO ] Time to serialize properties into /tmp/LTLFireability6715402514165722683.ltl : 5 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/LTLFireability16121398073471762479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6715402514165722683.ltl' '-c' '-stutter-deadlock'

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...277
Read 2 LTL properties
Checking formula 0 : !((G((F("(i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u930.p3259==0)"))&&(F(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....432
Formula 0 simplified : F(G!"(i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u930.p3259==0)" | G(!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...422
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin9217038558202821206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(((LTLAPp1==true)&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9217038558202821206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp2==true))||<>((LTLAPp3==true))||[]((LTLAPp4==true))))' '--buchi-type=spotba'
LTSmin run took 89746 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin9217038558202821206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(((LTLAPp1==true)&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 11:21:59] [INFO ] Flatten gal took : 173 ms
[2023-03-19 11:21:59] [INFO ] Input system was already deterministic with 3014 transitions.
[2023-03-19 11:21:59] [INFO ] Transformed 3364 places.
[2023-03-19 11:21:59] [INFO ] Transformed 3014 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 11:22:01] [INFO ] Time to serialize gal into /tmp/LTLFireability595780544081945390.gal : 35 ms
[2023-03-19 11:22:01] [INFO ] Time to serialize properties into /tmp/LTLFireability461097958364538394.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/LTLFireability595780544081945390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability461097958364538394.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...340
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("(p3259==0)"))&&(F(("(p256==0)")&&(X("(p256==0)")))))))
Formula 0 simplified : F(G!"(p3259==0)" | G(!"(p256==0)" | X!"(p256==0)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11785492 kB
After kill :
MemTotal: 16393220 kB
MemFree: 14626696 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-050B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-050B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713800684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;