Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.4K Feb 26 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Feb 26 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 26 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b04-LTLFireability-00
FORMULA_NAME Szymanski-PT-b04-LTLFireability-01
FORMULA_NAME Szymanski-PT-b04-LTLFireability-02
FORMULA_NAME Szymanski-PT-b04-LTLFireability-03
FORMULA_NAME Szymanski-PT-b04-LTLFireability-04
FORMULA_NAME Szymanski-PT-b04-LTLFireability-05
FORMULA_NAME Szymanski-PT-b04-LTLFireability-06
FORMULA_NAME Szymanski-PT-b04-LTLFireability-07
FORMULA_NAME Szymanski-PT-b04-LTLFireability-08
FORMULA_NAME Szymanski-PT-b04-LTLFireability-09
FORMULA_NAME Szymanski-PT-b04-LTLFireability-10
FORMULA_NAME Szymanski-PT-b04-LTLFireability-11
FORMULA_NAME Szymanski-PT-b04-LTLFireability-12
FORMULA_NAME Szymanski-PT-b04-LTLFireability-13
FORMULA_NAME Szymanski-PT-b04-LTLFireability-14
FORMULA_NAME Szymanski-PT-b04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679224218021

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=Szymanski-PT-b04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 11:10:19] [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 11:10:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:10:19] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2023-03-19 11:10:19] [INFO ] Transformed 568 places.
[2023-03-19 11:10:19] [INFO ] Transformed 8320 transitions.
[2023-03-19 11:10:20] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 553 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 174 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:10:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:10:20] [INFO ] Computed 1 place invariants in 47 ms
[2023-03-19 11:10:21] [INFO ] Implicit Places using invariants in 672 ms returned []
[2023-03-19 11:10:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:10:21] [INFO ] Invariant cache hit.
[2023-03-19 11:10:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:10:27] [INFO ] Implicit Places using invariants and state equation in 6636 ms returned []
Implicit Place search using SMT with State Equation took 7346 ms to find 0 implicit places.
[2023-03-19 11:10:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:10:27] [INFO ] Invariant cache hit.
[2023-03-19 11:10:29] [INFO ] Dead Transitions using invariants and state equation in 1940 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9469 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 41 out of 305 places after structural reductions.
[2023-03-19 11:10:30] [INFO ] Flatten gal took : 408 ms
[2023-03-19 11:10:30] [INFO ] Flatten gal took : 233 ms
[2023-03-19 11:10:31] [INFO ] Input system was already deterministic with 7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-19 11:10:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:10:31] [INFO ] Invariant cache hit.
[2023-03-19 11:10:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:10:43] [INFO ] After 12370ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-19 11:10:44] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 22 ms returned sat
[2023-03-19 11:11:05] [INFO ] After 20906ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-19 11:11:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:11:09] [INFO ] After 3895ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :11
[2023-03-19 11:11:09] [INFO ] After 3897ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 11:11:09] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 280 ms.
Support contains 25 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 322 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 305/305 places, 7936/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-19 11:11:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:10] [INFO ] Invariant cache hit.
[2023-03-19 11:11:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:11:21] [INFO ] After 10842ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-19 11:11:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:11:22] [INFO ] After 750ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :1 real:9
[2023-03-19 11:11:22] [INFO ] After 1111ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 11:11:22] [INFO ] After 12117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 11:11:22] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:11:33] [INFO ] After 11191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
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 11:11:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 11:11:47] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 169 ms.
Support contains 19 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 305 transition count 7879
Applied a total of 57 rules in 202 ms. Remains 305 /305 variables (removed 0) and now considering 7879/7936 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 305/305 places, 7879/7936 transitions.
Incomplete random walk after 10001 steps, including 3 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 133925 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133925 steps, saw 56459 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-19 11:11:51] [INFO ] Flow matrix only has 2675 transitions (discarded 5204 similar events)
// Phase 1: matrix 2675 rows 305 cols
[2023-03-19 11:11:51] [INFO ] Computed 1 place invariants in 25 ms
[2023-03-19 11:11:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:11:55] [INFO ] After 3836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 11:11:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:12:05] [INFO ] After 10396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 11:12:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:12:20] [INFO ] After 14485ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 11:12:20] [INFO ] After 14487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 11:12:20] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 136 ms.
Support contains 19 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7879/7879 transitions.
Applied a total of 0 rules in 293 ms. Remains 305 /305 variables (removed 0) and now considering 7879/7879 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 305/305 places, 7879/7879 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7879/7879 transitions.
Applied a total of 0 rules in 198 ms. Remains 305 /305 variables (removed 0) and now considering 7879/7879 (removed 0) transitions.
[2023-03-19 11:12:20] [INFO ] Flow matrix only has 2675 transitions (discarded 5204 similar events)
[2023-03-19 11:12:20] [INFO ] Invariant cache hit.
[2023-03-19 11:12:21] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-19 11:12:21] [INFO ] Flow matrix only has 2675 transitions (discarded 5204 similar events)
[2023-03-19 11:12:21] [INFO ] Invariant cache hit.
[2023-03-19 11:12:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:12:27] [INFO ] Implicit Places using invariants and state equation in 6272 ms returned []
Implicit Place search using SMT with State Equation took 6640 ms to find 0 implicit places.
[2023-03-19 11:12:28] [INFO ] Redundant transitions in 914 ms returned []
[2023-03-19 11:12:28] [INFO ] Flow matrix only has 2675 transitions (discarded 5204 similar events)
[2023-03-19 11:12:28] [INFO ] Invariant cache hit.
[2023-03-19 11:12:30] [INFO ] Dead Transitions using invariants and state equation in 1902 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9660 ms. Remains : 305/305 places, 7879/7879 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Szymanski-PT-b04-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 2304 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' '!(G(F((p0||G((F(p1)&&F(G(p0))))))))'
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 587 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:12:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:12:31] [INFO ] Computed 1 place invariants in 19 ms
[2023-03-19 11:12:31] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-19 11:12:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:31] [INFO ] Invariant cache hit.
[2023-03-19 11:12:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:12:39] [INFO ] Implicit Places using invariants and state equation in 7928 ms returned []
Implicit Place search using SMT with State Equation took 8340 ms to find 0 implicit places.
[2023-03-19 11:12:40] [INFO ] Redundant transitions in 880 ms returned []
[2023-03-19 11:12:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:40] [INFO ] Invariant cache hit.
[2023-03-19 11:12:42] [INFO ] Dead Transitions using invariants and state equation in 1964 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11786 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 223 steps with 0 reset in 13 ms.
FORMULA Szymanski-PT-b04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-00 finished in 12019 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) U p1)))'
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 28 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:12:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:42] [INFO ] Invariant cache hit.
[2023-03-19 11:12:43] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-03-19 11:12:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:43] [INFO ] Invariant cache hit.
[2023-03-19 11:12:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:12:49] [INFO ] Implicit Places using invariants and state equation in 6480 ms returned []
Implicit Place search using SMT with State Equation took 7079 ms to find 0 implicit places.
[2023-03-19 11:12:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:49] [INFO ] Invariant cache hit.
[2023-03-19 11:12:51] [INFO ] Dead Transitions using invariants and state equation in 1981 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9092 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s3 1) (GEQ s300 1))) (GEQ s87 1) (GEQ s301 1)), p0:(AND (GEQ s124 1) (GEQ s258 1))], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-01 finished in 9268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 37 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:12:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:51] [INFO ] Invariant cache hit.
[2023-03-19 11:12:52] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-19 11:12:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:52] [INFO ] Invariant cache hit.
[2023-03-19 11:12:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:13:00] [INFO ] Implicit Places using invariants and state equation in 8011 ms returned []
Implicit Place search using SMT with State Equation took 8422 ms to find 0 implicit places.
[2023-03-19 11:13:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:00] [INFO ] Invariant cache hit.
[2023-03-19 11:13:02] [INFO ] Dead Transitions using invariants and state equation in 1861 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10322 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s24 1) (GEQ s282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-04 finished in 10455 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 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 202 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:13:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:02] [INFO ] Invariant cache hit.
[2023-03-19 11:13:02] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-19 11:13:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:02] [INFO ] Invariant cache hit.
[2023-03-19 11:13:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:13:11] [INFO ] Implicit Places using invariants and state equation in 8125 ms returned []
Implicit Place search using SMT with State Equation took 8531 ms to find 0 implicit places.
[2023-03-19 11:13:11] [INFO ] Redundant transitions in 692 ms returned []
[2023-03-19 11:13:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:11] [INFO ] Invariant cache hit.
[2023-03-19 11:13:13] [INFO ] Dead Transitions using invariants and state equation in 1840 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11272 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s114 1) (GEQ s282 1)) (AND (GEQ s64 1) (GEQ s259 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 2 reset in 456 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA Szymanski-PT-b04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-05 finished in 11791 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)) U (G(p0)&&p1)))'
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 35 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:13:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:14] [INFO ] Invariant cache hit.
[2023-03-19 11:13:14] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-19 11:13:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:14] [INFO ] Invariant cache hit.
[2023-03-19 11:13:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:13:21] [INFO ] Implicit Places using invariants and state equation in 6984 ms returned []
Implicit Place search using SMT with State Equation took 7410 ms to find 0 implicit places.
[2023-03-19 11:13:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:21] [INFO ] Invariant cache hit.
[2023-03-19 11:13:23] [INFO ] Dead Transitions using invariants and state equation in 1784 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9231 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s19 1) (GEQ s274 1)), p0:(AND (GEQ s58 1) (GEQ s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-06 finished in 9353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:13:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:23] [INFO ] Invariant cache hit.
[2023-03-19 11:13:24] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-19 11:13:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:24] [INFO ] Invariant cache hit.
[2023-03-19 11:13:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:13:31] [INFO ] Implicit Places using invariants and state equation in 7508 ms returned []
Implicit Place search using SMT with State Equation took 7948 ms to find 0 implicit places.
[2023-03-19 11:13:32] [INFO ] Redundant transitions in 689 ms returned []
[2023-03-19 11:13:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:32] [INFO ] Invariant cache hit.
[2023-03-19 11:13:34] [INFO ] Dead Transitions using invariants and state equation in 1813 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10651 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s41 1) (GEQ s260 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]]
Stuttering criterion allowed to conclude after 500 steps with 0 reset in 5 ms.
FORMULA Szymanski-PT-b04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-07 finished in 10710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 201 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:13:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:34] [INFO ] Invariant cache hit.
[2023-03-19 11:13:34] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-19 11:13:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:34] [INFO ] Invariant cache hit.
[2023-03-19 11:13:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:13:42] [INFO ] Implicit Places using invariants and state equation in 7906 ms returned []
Implicit Place search using SMT with State Equation took 8325 ms to find 0 implicit places.
[2023-03-19 11:13:43] [INFO ] Redundant transitions in 680 ms returned []
[2023-03-19 11:13:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:43] [INFO ] Invariant cache hit.
[2023-03-19 11:13:45] [INFO ] Dead Transitions using invariants and state equation in 1794 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11013 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s77 1) (GEQ s257 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 0 reset in 487 ms.
Stack based approach found an accepted trace after 125 steps with 0 reset with depth 126 and stack size 126 in 2 ms.
FORMULA Szymanski-PT-b04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-08 finished in 11554 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||X(F((p1||G(p2))))))))'
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 33 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:13:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:45] [INFO ] Invariant cache hit.
[2023-03-19 11:13:46] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-19 11:13:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:46] [INFO ] Invariant cache hit.
[2023-03-19 11:13:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:13:54] [INFO ] Implicit Places using invariants and state equation in 8097 ms returned []
Implicit Place search using SMT with State Equation took 8524 ms to find 0 implicit places.
[2023-03-19 11:13:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:54] [INFO ] Invariant cache hit.
[2023-03-19 11:13:56] [INFO ] Dead Transitions using invariants and state equation in 1808 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10367 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s126 1) (GEQ s261 1)), p1:(AND (GEQ s32 1) (GEQ s279 1)), p2:(OR (LT s99 1) (LT s304 1))], nbAcceptance=1, 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 9 reset in 433 ms.
Product exploration explored 100000 steps with 0 reset in 396 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 11:13:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:57] [INFO ] Invariant cache hit.
[2023-03-19 11:13:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:14:06] [INFO ] After 8627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 11:14:06] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:14:11] [INFO ] After 5259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 11:14:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:14:25] [INFO ] After 13427ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:14:26] [INFO ] After 15063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-19 11:14:26] [INFO ] After 20516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 200 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:14:27] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 11:14:27] [INFO ] Computed 2 place invariants in 19 ms
[2023-03-19 11:14:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:14:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:14:28] [INFO ] After 861ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:14:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:14:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-19 11:14:29] [INFO ] After 1199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:14:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:14:37] [INFO ] After 7728ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:14:37] [INFO ] After 7852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-19 11:14:37] [INFO ] After 9294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7809/7809 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
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
Interrupted probabilistic random walk after 215215 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215215 steps, saw 74860 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:14:40] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:14:40] [INFO ] Invariant cache hit.
[2023-03-19 11:14:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 11:14:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:14:41] [INFO ] After 881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:14:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:14:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:14:42] [INFO ] After 1192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:14:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:14:50] [INFO ] After 7731ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:14:50] [INFO ] After 7872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-19 11:14:50] [INFO ] After 9311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 174 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 11:14:51] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:14:51] [INFO ] Invariant cache hit.
[2023-03-19 11:14:51] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-19 11:14:51] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:14:51] [INFO ] Invariant cache hit.
[2023-03-19 11:14:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:14:59] [INFO ] Implicit Places using invariants and state equation in 7772 ms returned []
Implicit Place search using SMT with State Equation took 8196 ms to find 0 implicit places.
[2023-03-19 11:15:00] [INFO ] Redundant transitions in 668 ms returned []
[2023-03-19 11:15:00] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:15:00] [INFO ] Invariant cache hit.
[2023-03-19 11:15:01] [INFO ] Dead Transitions using invariants and state equation in 1821 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10870 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 5 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 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 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 281 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 11:15:02] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-19 11:15:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:15:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:15:03] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:15:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:15:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:15:03] [INFO ] After 787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:15:04] [INFO ] After 1081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 605 ms.
[2023-03-19 11:15:04] [INFO ] After 1747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 348 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 38 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:15:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:15:05] [INFO ] Computed 1 place invariants in 14 ms
[2023-03-19 11:15:05] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-19 11:15:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:15:05] [INFO ] Invariant cache hit.
[2023-03-19 11:15:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:15:12] [INFO ] Implicit Places using invariants and state equation in 6845 ms returned []
Implicit Place search using SMT with State Equation took 7261 ms to find 0 implicit places.
[2023-03-19 11:15:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:15:12] [INFO ] Invariant cache hit.
[2023-03-19 11:15:14] [INFO ] Dead Transitions using invariants and state equation in 1776 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9075 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 280 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 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 11:15:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:15:14] [INFO ] Invariant cache hit.
[2023-03-19 11:15:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:15:16] [INFO ] After 1529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:15:16] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:15:18] [INFO ] After 2273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:15:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:15:23] [INFO ] After 4700ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:15:25] [INFO ] After 6204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1711 ms.
[2023-03-19 11:15:26] [INFO ] After 10258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 205 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 221524 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221524 steps, saw 75746 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:15:30] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 11:15:30] [INFO ] Computed 2 place invariants in 22 ms
[2023-03-19 11:15:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:15:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:15:30] [INFO ] After 856ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:15:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:15:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:15:32] [INFO ] After 1160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:15:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:15:39] [INFO ] After 7656ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:15:39] [INFO ] After 7783ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-19 11:15:40] [INFO ] After 9189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 173 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 11:15:40] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:15:40] [INFO ] Invariant cache hit.
[2023-03-19 11:15:40] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-19 11:15:40] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:15:40] [INFO ] Invariant cache hit.
[2023-03-19 11:15:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:15:49] [INFO ] Implicit Places using invariants and state equation in 8132 ms returned []
Implicit Place search using SMT with State Equation took 8549 ms to find 0 implicit places.
[2023-03-19 11:15:49] [INFO ] Redundant transitions in 662 ms returned []
[2023-03-19 11:15:49] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:15:49] [INFO ] Invariant cache hit.
[2023-03-19 11:15:51] [INFO ] Dead Transitions using invariants and state equation in 1799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11191 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 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 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 202 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 11:15:51] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-19 11:15:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:15:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:15:52] [INFO ] After 843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:15:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 11:15:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:15:53] [INFO ] After 866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:15:53] [INFO ] After 1171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 638 ms.
[2023-03-19 11:15:54] [INFO ] After 1871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 353 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 423 ms.
Product exploration explored 100000 steps with 0 reset in 439 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:15:57] [INFO ] Redundant transitions in 670 ms returned []
[2023-03-19 11:15:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:15:57] [INFO ] Computed 1 place invariants in 25 ms
[2023-03-19 11:15:58] [INFO ] Dead Transitions using invariants and state equation in 1830 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2713 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin11660125408277951880
[2023-03-19 11:15:59] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11660125408277951880
Running compilation step : cd /tmp/ltsmin11660125408277951880;'/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/ltsmin11660125408277951880;'/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/ltsmin11660125408277951880;'/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 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 38 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:16:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:16:02] [INFO ] Invariant cache hit.
[2023-03-19 11:16:02] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-19 11:16:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:16:02] [INFO ] Invariant cache hit.
[2023-03-19 11:16:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:16:10] [INFO ] Implicit Places using invariants and state equation in 8154 ms returned []
Implicit Place search using SMT with State Equation took 8600 ms to find 0 implicit places.
[2023-03-19 11:16:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:16:10] [INFO ] Invariant cache hit.
[2023-03-19 11:16:12] [INFO ] Dead Transitions using invariants and state equation in 1802 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10442 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin14022364458374756387
[2023-03-19 11:16:12] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14022364458374756387
Running compilation step : cd /tmp/ltsmin14022364458374756387;'/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/ltsmin14022364458374756387;'/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/ltsmin14022364458374756387;'/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 11:16:16] [INFO ] Flatten gal took : 222 ms
[2023-03-19 11:16:16] [INFO ] Flatten gal took : 237 ms
[2023-03-19 11:16:16] [INFO ] Time to serialize gal into /tmp/LTL8556326566688294666.gal : 48 ms
[2023-03-19 11:16:16] [INFO ] Time to serialize properties into /tmp/LTL3059042847710156113.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8556326566688294666.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7939802677289198482.hoa' '-atoms' '/tmp/LTL3059042847710156113.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...317
Loading property file /tmp/LTL3059042847710156113.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7939802677289198482.hoa
Detected timeout of ITS tools.
[2023-03-19 11:16:31] [INFO ] Flatten gal took : 196 ms
[2023-03-19 11:16:31] [INFO ] Flatten gal took : 179 ms
[2023-03-19 11:16:32] [INFO ] Time to serialize gal into /tmp/LTL9542969618843094614.gal : 33 ms
[2023-03-19 11:16:32] [INFO ] Time to serialize properties into /tmp/LTL16249227905939627720.ltl : 2 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/LTL9542969618843094614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16249227905939627720.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 : !((X(G((X(F(("((p32>=1)&&(l23>=1))")||(G("((p99<1)||(l50<1))")))))||("((p126>=1)&&(l5>=1))")))))
Formula 0 simplified : XF(!"((p126>=1)&&(l5>=1))" & XG(!"((p32>=1)&&(l23>=1))" & F!"((p99<1)||(l50<1))"))
Detected timeout of ITS tools.
[2023-03-19 11:16:47] [INFO ] Flatten gal took : 182 ms
[2023-03-19 11:16:47] [INFO ] Applying decomposition
[2023-03-19 11:16:47] [INFO ] Flatten gal took : 186 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/graph4974791277395196041.txt' '-o' '/tmp/graph4974791277395196041.bin' '-w' '/tmp/graph4974791277395196041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4974791277395196041.bin' '-l' '-1' '-v' '-w' '/tmp/graph4974791277395196041.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:16:47] [INFO ] Decomposing Gal with order
[2023-03-19 11:16:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:16:48] [INFO ] Removed a total of 18062 redundant transitions.
[2023-03-19 11:16:48] [INFO ] Flatten gal took : 713 ms
[2023-03-19 11:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1009 labels/synchronizations in 281 ms.
[2023-03-19 11:16:49] [INFO ] Time to serialize gal into /tmp/LTL13501387228359732495.gal : 29 ms
[2023-03-19 11:16:49] [INFO ] Time to serialize properties into /tmp/LTL15112746444555186611.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/LTL13501387228359732495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15112746444555186611.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...256
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F(("((i3.u46.p32>=1)&&(i6.u54.l23>=1))")||(G("((i1.u33.p99<1)||(i2.u62.l50<1))")))))||("((i8.i1.u43.p126>=1)&&(i3.u46.l5>=1)...162
Formula 0 simplified : XF(!"((i8.i1.u43.p126>=1)&&(i3.u46.l5>=1))" & XG(!"((i3.u46.p32>=1)&&(i6.u54.l23>=1))" & F!"((i1.u33.p99<1)||(i2.u62.l50<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17637323606080027442
[2023-03-19 11:17:04] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17637323606080027442
Running compilation step : cd /tmp/ltsmin17637323606080027442;'/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/ltsmin17637323606080027442;'/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/ltsmin17637323606080027442;'/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 Szymanski-PT-b04-LTLFireability-10 finished in 201564 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 X(G(p1))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 30 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:17:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:07] [INFO ] Invariant cache hit.
[2023-03-19 11:17:07] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-19 11:17:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:07] [INFO ] Invariant cache hit.
[2023-03-19 11:17:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:17:14] [INFO ] Implicit Places using invariants and state equation in 6768 ms returned []
Implicit Place search using SMT with State Equation took 7180 ms to find 0 implicit places.
[2023-03-19 11:17:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:14] [INFO ] Invariant cache hit.
[2023-03-19 11:17:16] [INFO ] Dead Transitions using invariants and state equation in 1796 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9008 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s21 1) (GEQ s292 1)), p0:(AND (GEQ s97 1) (GEQ s290 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], 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 Szymanski-PT-b04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-11 finished in 9133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 30 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:17:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:16] [INFO ] Invariant cache hit.
[2023-03-19 11:17:16] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-19 11:17:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:16] [INFO ] Invariant cache hit.
[2023-03-19 11:17:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:17:25] [INFO ] Implicit Places using invariants and state equation in 8167 ms returned []
Implicit Place search using SMT with State Equation took 8599 ms to find 0 implicit places.
[2023-03-19 11:17:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:25] [INFO ] Invariant cache hit.
[2023-03-19 11:17:26] [INFO ] Dead Transitions using invariants and state equation in 1782 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10412 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s110 1) (GEQ s265 1)), p0:(AND (GEQ s67 1) (GEQ s280 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-13 finished in 10600 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)&&F(G(p2)))))'
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 205 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:17:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:27] [INFO ] Invariant cache hit.
[2023-03-19 11:17:27] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-19 11:17:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:27] [INFO ] Invariant cache hit.
[2023-03-19 11:17:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:17:35] [INFO ] Implicit Places using invariants and state equation in 7912 ms returned []
Implicit Place search using SMT with State Equation took 8344 ms to find 0 implicit places.
[2023-03-19 11:17:36] [INFO ] Redundant transitions in 639 ms returned []
[2023-03-19 11:17:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:36] [INFO ] Invariant cache hit.
[2023-03-19 11:17:38] [INFO ] Dead Transitions using invariants and state equation in 2029 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11229 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-15 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=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s83 1) (GEQ s285 1)), p1:(AND (GEQ s74 1) (GEQ s260 1)), p2:(AND (GEQ s84 1) (GEQ s295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-15 finished in 11433 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||X(F((p1||G(p2))))))))'
Found a Lengthening insensitive property : Szymanski-PT-b04-LTLFireability-10
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 67 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:17:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:38] [INFO ] Invariant cache hit.
[2023-03-19 11:17:39] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-19 11:17:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:39] [INFO ] Invariant cache hit.
[2023-03-19 11:17:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:17:47] [INFO ] Implicit Places using invariants and state equation in 8286 ms returned []
Implicit Place search using SMT with State Equation took 8682 ms to find 0 implicit places.
[2023-03-19 11:17:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:47] [INFO ] Invariant cache hit.
[2023-03-19 11:17:49] [INFO ] Dead Transitions using invariants and state equation in 1783 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10533 ms. Remains : 305/305 places, 7936/7936 transitions.
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s126 1) (GEQ s261 1)), p1:(AND (GEQ s32 1) (GEQ s279 1)), p2:(OR (LT s99 1) (LT s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 429 ms.
Product exploration explored 100000 steps with 0 reset in 467 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 232 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 11:17:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:50] [INFO ] Invariant cache hit.
[2023-03-19 11:17:50] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:17:59] [INFO ] After 8624ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 11:17:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:18:04] [INFO ] After 5304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 11:18:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:18:17] [INFO ] After 12499ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:18:18] [INFO ] After 13811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1736 ms.
[2023-03-19 11:18:20] [INFO ] After 20917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) 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 11:18:20] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 11:18:20] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-19 11:18:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:18:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:18:21] [INFO ] After 924ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:18:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 11:18:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:18:22] [INFO ] After 1207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:18:22] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:18:30] [INFO ] After 7927ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:18:30] [INFO ] After 8051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-19 11:18:30] [INFO ] After 9504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 305/305 places, 7809/7809 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
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
Interrupted probabilistic random walk after 215971 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215971 steps, saw 74898 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:18:34] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:18:34] [INFO ] Invariant cache hit.
[2023-03-19 11:18:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:18:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:18:35] [INFO ] After 986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:18:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:18:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-19 11:18:36] [INFO ] After 1334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:18:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:18:44] [INFO ] After 7955ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:18:44] [INFO ] After 8079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-19 11:18:44] [INFO ] After 9650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 170 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 11:18:45] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:18:45] [INFO ] Invariant cache hit.
[2023-03-19 11:18:45] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-19 11:18:45] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:18:45] [INFO ] Invariant cache hit.
[2023-03-19 11:18:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:18:53] [INFO ] Implicit Places using invariants and state equation in 7897 ms returned []
Implicit Place search using SMT with State Equation took 8324 ms to find 0 implicit places.
[2023-03-19 11:18:54] [INFO ] Redundant transitions in 640 ms returned []
[2023-03-19 11:18:54] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:18:54] [INFO ] Invariant cache hit.
[2023-03-19 11:18:56] [INFO ] Dead Transitions using invariants and state equation in 1856 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11008 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 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 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 195 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 11:18:56] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-19 11:18:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 11:18:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:18:57] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:18:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:18:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:18:57] [INFO ] After 794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:18:58] [INFO ] After 1087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 602 ms.
[2023-03-19 11:18:58] [INFO ] After 1747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 29 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:18:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:18:59] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 11:18:59] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-19 11:18:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:18:59] [INFO ] Invariant cache hit.
[2023-03-19 11:19:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:19:06] [INFO ] Implicit Places using invariants and state equation in 6571 ms returned []
Implicit Place search using SMT with State Equation took 6988 ms to find 0 implicit places.
[2023-03-19 11:19:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:19:06] [INFO ] Invariant cache hit.
[2023-03-19 11:19:08] [INFO ] Dead Transitions using invariants and state equation in 1802 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8822 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 337 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-19 11:19:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:19:08] [INFO ] Invariant cache hit.
[2023-03-19 11:19:08] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:19:10] [INFO ] After 1509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:19:10] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:19:12] [INFO ] After 2236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:19:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:19:17] [INFO ] After 4626ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:19:18] [INFO ] After 6130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1735 ms.
[2023-03-19 11:19:20] [INFO ] After 10177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
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
Interrupted probabilistic random walk after 214742 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 214742 steps, saw 74762 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:19:23] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 11:19:23] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-19 11:19:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 11:19:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:19:24] [INFO ] After 872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:19:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 11:19:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-19 11:19:25] [INFO ] After 1171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:19:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:19:33] [INFO ] After 7708ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:19:33] [INFO ] After 7833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-19 11:19:33] [INFO ] After 9249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 170 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 11:19:34] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:19:34] [INFO ] Invariant cache hit.
[2023-03-19 11:19:34] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-19 11:19:34] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:19:34] [INFO ] Invariant cache hit.
[2023-03-19 11:19:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:19:43] [INFO ] Implicit Places using invariants and state equation in 8519 ms returned []
Implicit Place search using SMT with State Equation took 8942 ms to find 0 implicit places.
[2023-03-19 11:19:43] [INFO ] Redundant transitions in 633 ms returned []
[2023-03-19 11:19:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 11:19:43] [INFO ] Invariant cache hit.
[2023-03-19 11:19:45] [INFO ] Dead Transitions using invariants and state equation in 1793 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11560 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 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 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 201 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 11:19:45] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-19 11:19:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 11:19:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-19 11:19:46] [INFO ] After 866ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:19:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 11:19:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 11:19:47] [INFO ] After 790ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:19:47] [INFO ] After 1074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 599 ms.
[2023-03-19 11:19:48] [INFO ] After 1723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 341 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6 reset in 382 ms.
Product exploration explored 100000 steps with 1 reset in 386 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:19:50] [INFO ] Redundant transitions in 654 ms returned []
[2023-03-19 11:19:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:19:50] [INFO ] Computed 1 place invariants in 19 ms
[2023-03-19 11:19:52] [INFO ] Dead Transitions using invariants and state equation in 1838 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2682 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin14202571143310749912
[2023-03-19 11:19:52] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14202571143310749912
Running compilation step : cd /tmp/ltsmin14202571143310749912;'/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/ltsmin14202571143310749912;'/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/ltsmin14202571143310749912;'/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 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 30 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:19:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:19:55] [INFO ] Invariant cache hit.
[2023-03-19 11:19:56] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-19 11:19:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:19:56] [INFO ] Invariant cache hit.
[2023-03-19 11:19:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:20:02] [INFO ] Implicit Places using invariants and state equation in 6585 ms returned []
Implicit Place search using SMT with State Equation took 6985 ms to find 0 implicit places.
[2023-03-19 11:20:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:20:02] [INFO ] Invariant cache hit.
[2023-03-19 11:20:04] [INFO ] Dead Transitions using invariants and state equation in 1820 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8838 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin17943148033241643021
[2023-03-19 11:20:04] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17943148033241643021
Running compilation step : cd /tmp/ltsmin17943148033241643021;'/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/ltsmin17943148033241643021;'/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/ltsmin17943148033241643021;'/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 11:20:08] [INFO ] Flatten gal took : 184 ms
[2023-03-19 11:20:08] [INFO ] Flatten gal took : 180 ms
[2023-03-19 11:20:08] [INFO ] Time to serialize gal into /tmp/LTL12133151276684026277.gal : 40 ms
[2023-03-19 11:20:08] [INFO ] Time to serialize properties into /tmp/LTL13970568331460621859.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/LTL12133151276684026277.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5887836009696577969.hoa' '-atoms' '/tmp/LTL13970568331460621859.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/LTL13970568331460621859.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5887836009696577969.hoa
Detected timeout of ITS tools.
[2023-03-19 11:20:23] [INFO ] Flatten gal took : 177 ms
[2023-03-19 11:20:23] [INFO ] Flatten gal took : 183 ms
[2023-03-19 11:20:23] [INFO ] Time to serialize gal into /tmp/LTL4201855008414820285.gal : 25 ms
[2023-03-19 11:20:23] [INFO ] Time to serialize properties into /tmp/LTL6241582534355574043.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/LTL4201855008414820285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6241582534355574043.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((X(F(("((p32>=1)&&(l23>=1))")||(G("((p99<1)||(l50<1))")))))||("((p126>=1)&&(l5>=1))")))))
Formula 0 simplified : XF(!"((p126>=1)&&(l5>=1))" & XG(!"((p32>=1)&&(l23>=1))" & F!"((p99<1)||(l50<1))"))
Detected timeout of ITS tools.
[2023-03-19 11:20:39] [INFO ] Flatten gal took : 174 ms
[2023-03-19 11:20:39] [INFO ] Applying decomposition
[2023-03-19 11:20:39] [INFO ] Flatten gal took : 195 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/graph15448112201548238290.txt' '-o' '/tmp/graph15448112201548238290.bin' '-w' '/tmp/graph15448112201548238290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15448112201548238290.bin' '-l' '-1' '-v' '-w' '/tmp/graph15448112201548238290.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:20:39] [INFO ] Decomposing Gal with order
[2023-03-19 11:20:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:20:39] [INFO ] Removed a total of 17839 redundant transitions.
[2023-03-19 11:20:40] [INFO ] Flatten gal took : 337 ms
[2023-03-19 11:20:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1087 labels/synchronizations in 210 ms.
[2023-03-19 11:20:40] [INFO ] Time to serialize gal into /tmp/LTL3844963474617012928.gal : 24 ms
[2023-03-19 11:20:40] [INFO ] Time to serialize properties into /tmp/LTL14606947936389074887.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/LTL3844963474617012928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14606947936389074887.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...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F(("((i3.u46.p32>=1)&&(i6.u52.l23>=1))")||(G("((i3.u33.p99<1)||(i1.u61.l50<1))")))))||("((i4.u42.p126>=1)&&(i3.u46.l5>=1))")...159
Formula 0 simplified : XF(!"((i4.u42.p126>=1)&&(i3.u46.l5>=1))" & XG(!"((i3.u46.p32>=1)&&(i6.u52.l23>=1))" & F!"((i3.u33.p99<1)||(i1.u61.l50<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15731687312749153961
[2023-03-19 11:20:55] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15731687312749153961
Running compilation step : cd /tmp/ltsmin15731687312749153961;'/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/ltsmin15731687312749153961;'/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/ltsmin15731687312749153961;'/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 Szymanski-PT-b04-LTLFireability-10 finished in 200032 ms.
[2023-03-19 11:20:58] [INFO ] Flatten gal took : 172 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4538164282284078794
[2023-03-19 11:20:58] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2023-03-19 11:20:58] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4538164282284078794
Running compilation step : cd /tmp/ltsmin4538164282284078794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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 11:20:58] [INFO ] Applying decomposition
[2023-03-19 11:20:59] [INFO ] Flatten gal took : 181 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/graph3092128939063458556.txt' '-o' '/tmp/graph3092128939063458556.bin' '-w' '/tmp/graph3092128939063458556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3092128939063458556.bin' '-l' '-1' '-v' '-w' '/tmp/graph3092128939063458556.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:20:59] [INFO ] Decomposing Gal with order
[2023-03-19 11:20:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:20:59] [INFO ] Removed a total of 18142 redundant transitions.
[2023-03-19 11:20:59] [INFO ] Flatten gal took : 327 ms
[2023-03-19 11:21:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1058 labels/synchronizations in 213 ms.
[2023-03-19 11:21:00] [INFO ] Time to serialize gal into /tmp/LTLFireability1804617495702794523.gal : 19 ms
[2023-03-19 11:21:00] [INFO ] Time to serialize properties into /tmp/LTLFireability7426217779726128721.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/LTLFireability1804617495702794523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7426217779726128721.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 1 LTL properties
Checking formula 0 : !((X(G(("((i2.i0.u42.p126>=1)&&(i1.u46.l5>=1))")||(X(F(("((i1.u47.p32>=1)&&(i5.u53.l23>=1))")||(G("((i8.u33.p99<1)||(i8.u62.l50<1))"))...162
Formula 0 simplified : XF(!"((i2.i0.u42.p126>=1)&&(i1.u46.l5>=1))" & XG(!"((i1.u47.p32>=1)&&(i5.u53.l23>=1))" & F!"((i8.u33.p99<1)||(i8.u62.l50<1))"))
Compilation finished in 30163 ms.
Running link step : cd /tmp/ltsmin4538164282284078794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin4538164282284078794;'/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([](((LTLAPp0==true)||X(<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: LTL layer: formula: X([](((LTLAPp0==true)||X(<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))))
pins2lts-mc-linux64( 0/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.049: "X([](((LTLAPp0==true)||X(<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.054: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.577: There are 7940 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.577: State length is 306, there are 7943 groups
pins2lts-mc-linux64( 0/ 8), 0.577: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.577: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.577: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.577: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.781: [Blue] ~120 levels ~960 states ~5440 transitions
pins2lts-mc-linux64( 4/ 8), 0.974: [Blue] ~240 levels ~1920 states ~10016 transitions
pins2lts-mc-linux64( 3/ 8), 1.234: [Blue] ~388 levels ~3840 states ~19560 transitions
pins2lts-mc-linux64( 3/ 8), 1.835: [Blue] ~388 levels ~7680 states ~40096 transitions
pins2lts-mc-linux64( 3/ 8), 3.019: [Blue] ~847 levels ~15360 states ~87784 transitions
pins2lts-mc-linux64( 6/ 8), 5.046: [Blue] ~2885 levels ~30720 states ~160584 transitions
pins2lts-mc-linux64( 6/ 8), 9.575: [Blue] ~3790 levels ~61440 states ~349880 transitions
pins2lts-mc-linux64( 7/ 8), 18.414: [Blue] ~389 levels ~122880 states ~771760 transitions
pins2lts-mc-linux64( 7/ 8), 36.288: [Blue] ~454 levels ~245760 states ~1634160 transitions
pins2lts-mc-linux64( 3/ 8), 70.046: [Blue] ~26990 levels ~491520 states ~3261048 transitions
pins2lts-mc-linux64( 3/ 8), 134.078: [Blue] ~81094 levels ~983040 states ~6479648 transitions
pins2lts-mc-linux64( 3/ 8), 281.933: [Blue] ~176240 levels ~1966080 states ~12893000 transitions
pins2lts-mc-linux64( 3/ 8), 549.308: [Blue] ~412325 levels ~3932160 states ~26093704 transitions
pins2lts-mc-linux64( 1/ 8), 1034.518: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1034.797:
pins2lts-mc-linux64( 0/ 8), 1034.797: Explored 7088735 states 46408208 transitions, fanout: 6.547
pins2lts-mc-linux64( 0/ 8), 1034.797: Total exploration time 1034.200 sec (1033.950 sec minimum, 1034.032 sec on average)
pins2lts-mc-linux64( 0/ 8), 1034.797: States per second: 6854, Transitions per second: 44874
pins2lts-mc-linux64( 0/ 8), 1034.797:
pins2lts-mc-linux64( 0/ 8), 1034.797: State space has 13261290 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1034.797: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1034.797: blue states: 7088735 (53.45%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1034.797: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1034.797: all-red states: 3762 (0.03%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1034.797:
pins2lts-mc-linux64( 0/ 8), 1034.797: Total memory used for local state coloring: 58.7MB
pins2lts-mc-linux64( 0/ 8), 1034.797:
pins2lts-mc-linux64( 0/ 8), 1034.797: Queue width: 8B, total height: 3848971, memory: 29.37MB
pins2lts-mc-linux64( 0/ 8), 1034.797: Tree memory: 357.2MB, 28.2 B/state, compr.: 2.3%
pins2lts-mc-linux64( 0/ 8), 1034.797: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1034.797: Stored 8280 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1034.797: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1034.797: Est. total memory use: 386.5MB (~1053.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4538164282284078794;'/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([](((LTLAPp0==true)||X(<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4538164282284078794;'/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([](((LTLAPp0==true)||X(<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 11:44:33] [INFO ] Flatten gal took : 179 ms
[2023-03-19 11:44:33] [INFO ] Time to serialize gal into /tmp/LTLFireability995764169573736703.gal : 25 ms
[2023-03-19 11:44:33] [INFO ] Time to serialize properties into /tmp/LTLFireability16008919043623933796.ltl : 2 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/LTLFireability995764169573736703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16008919043623933796.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...297
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p126>=1)&&(l5>=1))")||(X(F(("((p32>=1)&&(l23>=1))")||(G("((p99<1)||(l50<1))")))))))))
Formula 0 simplified : XF(!"((p126>=1)&&(l5>=1))" & XG(!"((p32>=1)&&(l23>=1))" & F!"((p99<1)||(l50<1))"))
Detected timeout of ITS tools.
[2023-03-19 12:08:18] [INFO ] Flatten gal took : 863 ms
[2023-03-19 12:08:23] [INFO ] Input system was already deterministic with 7936 transitions.
[2023-03-19 12:08:23] [INFO ] Transformed 305 places.
[2023-03-19 12:08:23] [INFO ] Transformed 7936 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 12:08:23] [INFO ] Time to serialize gal into /tmp/LTLFireability18205841952893283643.gal : 25 ms
[2023-03-19 12:08:23] [INFO ] Time to serialize properties into /tmp/LTLFireability17364425248982353777.ltl : 4 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/LTLFireability18205841952893283643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17364425248982353777.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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("((p126>=1)&&(l5>=1))")||(X(F(("((p32>=1)&&(l23>=1))")||(G("((p99<1)||(l50<1))")))))))))
Formula 0 simplified : XF(!"((p126>=1)&&(l5>=1))" & XG(!"((p32>=1)&&(l23>=1))" & F!"((p99<1)||(l50<1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13014624 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15441732 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="Szymanski-PT-b04"
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 Szymanski-PT-b04, 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 r485-tall-167912699400460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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