Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713400315.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldIIPt-PT-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713400315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 686K 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 ShieldIIPt-PT-040B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679188403455

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 01:13:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 01:13:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:13:28] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-19 01:13:28] [INFO ] Transformed 2803 places.
[2023-03-19 01:13:28] [INFO ] Transformed 2603 transitions.
[2023-03-19 01:13:28] [INFO ] Found NUPN structural information;
[2023-03-19 01:13:28] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 427 places :
Symmetric choice reduction at 0 with 427 rule applications. Total rules 427 place count 2376 transition count 2176
Iterating global reduction 0 with 427 rules applied. Total rules applied 854 place count 2376 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 855 place count 2375 transition count 2175
Iterating global reduction 0 with 1 rules applied. Total rules applied 856 place count 2375 transition count 2175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 857 place count 2374 transition count 2174
Iterating global reduction 0 with 1 rules applied. Total rules applied 858 place count 2374 transition count 2174
Applied a total of 858 rules in 1095 ms. Remains 2374 /2803 variables (removed 429) and now considering 2174/2603 (removed 429) transitions.
// Phase 1: matrix 2174 rows 2374 cols
[2023-03-19 01:13:29] [INFO ] Computed 361 place invariants in 40 ms
[2023-03-19 01:13:30] [INFO ] Implicit Places using invariants in 1389 ms returned []
[2023-03-19 01:13:30] [INFO ] Invariant cache hit.
[2023-03-19 01:13:33] [INFO ] Implicit Places using invariants and state equation in 2641 ms returned []
Implicit Place search using SMT with State Equation took 4067 ms to find 0 implicit places.
[2023-03-19 01:13:33] [INFO ] Invariant cache hit.
[2023-03-19 01:13:35] [INFO ] Dead Transitions using invariants and state equation in 1644 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2374/2803 places, 2174/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6809 ms. Remains : 2374/2803 places, 2174/2603 transitions.
Support contains 33 out of 2374 places after structural reductions.
[2023-03-19 01:13:35] [INFO ] Flatten gal took : 155 ms
[2023-03-19 01:13:35] [INFO ] Flatten gal took : 97 ms
[2023-03-19 01:13:35] [INFO ] Input system was already deterministic with 2174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 21) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-19 01:13:36] [INFO ] Invariant cache hit.
[2023-03-19 01:13:38] [INFO ] [Real]Absence check using 361 positive place invariants in 222 ms returned sat
[2023-03-19 01:13:38] [INFO ] After 1642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-19 01:13:39] [INFO ] [Nat]Absence check using 361 positive place invariants in 224 ms returned sat
[2023-03-19 01:13:43] [INFO ] After 3209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-19 01:13:44] [INFO ] Deduced a trap composed of 16 places in 1115 ms of which 16 ms to minimize.
[2023-03-19 01:13:46] [INFO ] Deduced a trap composed of 26 places in 997 ms of which 3 ms to minimize.
[2023-03-19 01:13:47] [INFO ] Deduced a trap composed of 31 places in 828 ms of which 3 ms to minimize.
[2023-03-19 01:13:47] [INFO ] Deduced a trap composed of 36 places in 791 ms of which 2 ms to minimize.
[2023-03-19 01:13:48] [INFO ] Deduced a trap composed of 37 places in 853 ms of which 6 ms to minimize.
[2023-03-19 01:13:49] [INFO ] Deduced a trap composed of 19 places in 868 ms of which 3 ms to minimize.
[2023-03-19 01:13:50] [INFO ] Deduced a trap composed of 35 places in 920 ms of which 2 ms to minimize.
[2023-03-19 01:13:51] [INFO ] Deduced a trap composed of 22 places in 745 ms of which 1 ms to minimize.
[2023-03-19 01:13:52] [INFO ] Deduced a trap composed of 36 places in 899 ms of which 2 ms to minimize.
[2023-03-19 01:13:53] [INFO ] Deduced a trap composed of 37 places in 791 ms of which 2 ms to minimize.
[2023-03-19 01:13:54] [INFO ] Deduced a trap composed of 37 places in 870 ms of which 1 ms to minimize.
[2023-03-19 01:13:55] [INFO ] Deduced a trap composed of 18 places in 730 ms of which 2 ms to minimize.
[2023-03-19 01:13:56] [INFO ] Deduced a trap composed of 19 places in 735 ms of which 2 ms to minimize.
[2023-03-19 01:13:57] [INFO ] Deduced a trap composed of 24 places in 773 ms of which 4 ms to minimize.
[2023-03-19 01:13:58] [INFO ] Deduced a trap composed of 25 places in 822 ms of which 4 ms to minimize.
[2023-03-19 01:13:59] [INFO ] Deduced a trap composed of 29 places in 833 ms of which 2 ms to minimize.
[2023-03-19 01:14:00] [INFO ] Deduced a trap composed of 22 places in 763 ms of which 2 ms to minimize.
[2023-03-19 01:14:00] [INFO ] Deduced a trap composed of 35 places in 808 ms of which 1 ms to minimize.
[2023-03-19 01:14:01] [INFO ] Deduced a trap composed of 22 places in 714 ms of which 1 ms to minimize.
[2023-03-19 01:14:02] [INFO ] Deduced a trap composed of 38 places in 711 ms of which 2 ms to minimize.
[2023-03-19 01:14:03] [INFO ] Deduced a trap composed of 40 places in 631 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:14:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:14:03] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 1385 ms.
Support contains 23 out of 2374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Drop transitions removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 465 place count 2374 transition count 1709
Reduce places removed 465 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 467 rules applied. Total rules applied 932 place count 1909 transition count 1707
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 934 place count 1907 transition count 1707
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 311 Pre rules applied. Total rules applied 934 place count 1907 transition count 1396
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1556 place count 1596 transition count 1396
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1559 place count 1593 transition count 1393
Iterating global reduction 3 with 3 rules applied. Total rules applied 1562 place count 1593 transition count 1393
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1562 place count 1593 transition count 1390
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1568 place count 1590 transition count 1390
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 2 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 2928 place count 910 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2929 place count 910 transition count 709
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2931 place count 909 transition count 708
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3133 place count 808 transition count 769
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 3159 place count 795 transition count 778
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3160 place count 795 transition count 777
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 3163 place count 795 transition count 774
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3166 place count 792 transition count 774
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 3206 place count 792 transition count 774
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3207 place count 791 transition count 773
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3209 place count 789 transition count 773
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3209 place count 789 transition count 772
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3211 place count 788 transition count 772
Applied a total of 3211 rules in 524 ms. Remains 788 /2374 variables (removed 1586) and now considering 772/2174 (removed 1402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 788/2374 places, 772/2174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) 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 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 772 rows 788 cols
[2023-03-19 01:14:06] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-19 01:14:06] [INFO ] [Real]Absence check using 359 positive place invariants in 64 ms returned sat
[2023-03-19 01:14:06] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 01:14:07] [INFO ] [Nat]Absence check using 359 positive place invariants in 92 ms returned sat
[2023-03-19 01:14:08] [INFO ] After 994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 01:14:08] [INFO ] State equation strengthened by 134 read => feed constraints.
[2023-03-19 01:14:10] [INFO ] After 2461ms SMT Verify possible using 134 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 01:14:12] [INFO ] After 4315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1384 ms.
[2023-03-19 01:14:14] [INFO ] After 7433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 481 ms.
Support contains 19 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 772/772 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 787 transition count 771
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 787 transition count 769
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 785 transition count 769
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 783 transition count 767
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 781 transition count 770
Applied a total of 14 rules in 61 ms. Remains 781 /788 variables (removed 7) and now considering 770/772 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 781/788 places, 770/772 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 109769 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109769 steps, saw 69263 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 770 rows 781 cols
[2023-03-19 01:14:18] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-19 01:14:19] [INFO ] [Real]Absence check using 359 positive place invariants in 116 ms returned sat
[2023-03-19 01:14:19] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 01:14:19] [INFO ] [Nat]Absence check using 359 positive place invariants in 101 ms returned sat
[2023-03-19 01:14:20] [INFO ] After 947ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 01:14:20] [INFO ] State equation strengthened by 134 read => feed constraints.
[2023-03-19 01:14:21] [INFO ] After 982ms SMT Verify possible using 134 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 01:14:22] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2023-03-19 01:14:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-19 01:14:23] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2023-03-19 01:14:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-19 01:14:23] [INFO ] After 2486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 9724 ms.
[2023-03-19 01:14:33] [INFO ] After 13928ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 1 properties in 463 ms.
Support contains 17 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 770/770 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 781 transition count 769
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 780 transition count 769
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 779 transition count 768
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 778 transition count 767
Applied a total of 5 rules in 59 ms. Remains 778 /781 variables (removed 3) and now considering 767/770 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 778/781 places, 767/770 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 114212 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114212 steps, saw 73323 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 767 rows 778 cols
[2023-03-19 01:14:37] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-19 01:14:37] [INFO ] [Real]Absence check using 359 positive place invariants in 72 ms returned sat
[2023-03-19 01:14:37] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 01:14:38] [INFO ] [Nat]Absence check using 359 positive place invariants in 80 ms returned sat
[2023-03-19 01:14:39] [INFO ] After 831ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 01:14:39] [INFO ] State equation strengthened by 134 read => feed constraints.
[2023-03-19 01:14:40] [INFO ] After 1021ms SMT Verify possible using 134 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-19 01:14:41] [INFO ] After 2647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 817 ms.
[2023-03-19 01:14:42] [INFO ] After 4852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 363 ms.
Support contains 17 out of 778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 767/767 transitions.
Applied a total of 0 rules in 18 ms. Remains 778 /778 variables (removed 0) and now considering 767/767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 778/778 places, 767/767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 767/767 transitions.
Applied a total of 0 rules in 17 ms. Remains 778 /778 variables (removed 0) and now considering 767/767 (removed 0) transitions.
[2023-03-19 01:14:43] [INFO ] Invariant cache hit.
[2023-03-19 01:14:43] [INFO ] Implicit Places using invariants in 482 ms returned [767]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 484 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 777/778 places, 767/767 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 776 transition count 766
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 776 transition count 766
Applied a total of 2 rules in 24 ms. Remains 776 /777 variables (removed 1) and now considering 766/767 (removed 1) transitions.
// Phase 1: matrix 766 rows 776 cols
[2023-03-19 01:14:43] [INFO ] Computed 358 place invariants in 7 ms
[2023-03-19 01:14:44] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-19 01:14:44] [INFO ] Invariant cache hit.
[2023-03-19 01:14:44] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-19 01:14:45] [INFO ] Implicit Places using invariants and state equation in 1807 ms returned []
Implicit Place search using SMT with State Equation took 2279 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 776/778 places, 766/767 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2804 ms. Remains : 776/778 places, 766/767 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 115974 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115974 steps, saw 74635 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-19 01:14:49] [INFO ] Invariant cache hit.
[2023-03-19 01:14:50] [INFO ] [Real]Absence check using 358 positive place invariants in 51 ms returned sat
[2023-03-19 01:14:50] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 01:14:50] [INFO ] [Nat]Absence check using 358 positive place invariants in 86 ms returned sat
[2023-03-19 01:14:51] [INFO ] After 778ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 01:14:51] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-19 01:14:53] [INFO ] After 1665ms SMT Verify possible using 133 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-19 01:14:54] [INFO ] After 2778ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1327 ms.
[2023-03-19 01:14:55] [INFO ] After 5437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 626 ms.
Support contains 17 out of 776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 766/766 transitions.
Applied a total of 0 rules in 20 ms. Remains 776 /776 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 776/776 places, 766/766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 766/766 transitions.
Applied a total of 0 rules in 14 ms. Remains 776 /776 variables (removed 0) and now considering 766/766 (removed 0) transitions.
[2023-03-19 01:14:56] [INFO ] Invariant cache hit.
[2023-03-19 01:14:56] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-19 01:14:56] [INFO ] Invariant cache hit.
[2023-03-19 01:14:57] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-19 01:14:58] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
[2023-03-19 01:14:58] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-19 01:14:58] [INFO ] Invariant cache hit.
[2023-03-19 01:14:59] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2844 ms. Remains : 776/776 places, 766/766 transitions.
Partial Free-agglomeration rule applied 122 times.
Drop transitions removed 122 transitions
Iterating global reduction 0 with 122 rules applied. Total rules applied 122 place count 776 transition count 766
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 776 transition count 764
Applied a total of 124 rules in 40 ms. Remains 776 /776 variables (removed 0) and now considering 764/766 (removed 2) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 764 rows 776 cols
[2023-03-19 01:14:59] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:14:59] [INFO ] [Real]Absence check using 358 positive place invariants in 89 ms returned sat
[2023-03-19 01:14:59] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 01:14:59] [INFO ] [Nat]Absence check using 358 positive place invariants in 82 ms returned sat
[2023-03-19 01:15:00] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 01:15:00] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-19 01:15:01] [INFO ] After 732ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-19 01:15:02] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 1 ms to minimize.
[2023-03-19 01:15:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-19 01:15:02] [INFO ] After 1983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 638 ms.
[2023-03-19 01:15:03] [INFO ] After 3984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Computed a total of 640 stabilizing places and 640 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' '!((p0 U G(p1)))'
Support contains 3 out of 2374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2373 transition count 1694
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1894 transition count 1694
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 958 place count 1894 transition count 1381
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1584 place count 1581 transition count 1381
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1592 place count 1573 transition count 1373
Iterating global reduction 2 with 8 rules applied. Total rules applied 1600 place count 1573 transition count 1373
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1600 place count 1573 transition count 1366
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1614 place count 1566 transition count 1366
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2974 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2975 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2977 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3179 place count 784 transition count 751
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3213 place count 767 transition count 762
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3214 place count 767 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3216 place count 765 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3218 place count 763 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3218 place count 763 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3220 place count 762 transition count 759
Applied a total of 3220 rules in 442 ms. Remains 762 /2374 variables (removed 1612) and now considering 759/2174 (removed 1415) transitions.
// Phase 1: matrix 759 rows 762 cols
[2023-03-19 01:15:04] [INFO ] Computed 359 place invariants in 5 ms
[2023-03-19 01:15:04] [INFO ] Implicit Places using invariants in 424 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 425 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/2374 places, 759/2174 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 758
Applied a total of 2 rules in 28 ms. Remains 760 /761 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 760 cols
[2023-03-19 01:15:04] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:15:05] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-19 01:15:05] [INFO ] Invariant cache hit.
[2023-03-19 01:15:06] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/2374 places, 758/2174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2311 ms. Remains : 760/2374 places, 758/2174 transitions.
Stuttering acceptance computed with spot in 370 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s397 1) (EQ s303 0) (EQ s454 1)), p0:(EQ s397 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 896 ms.
Product exploration explored 100000 steps with 0 reset in 1026 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 774 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 250224 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250224 steps, saw 157016 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:15:12] [INFO ] Invariant cache hit.
[2023-03-19 01:15:12] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:15:13] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2023-03-19 01:15:13] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:15:13] [INFO ] After 403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-19 01:15:13] [INFO ] After 646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 758/758 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 760 transition count 757
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 760 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 759 transition count 756
Applied a total of 3 rules in 96 ms. Remains 759 /760 variables (removed 1) and now considering 756/758 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 759/760 places, 756/758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 282553 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 282553 steps, saw 177771 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:15:16] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-19 01:15:16] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:15:17] [INFO ] [Nat]Absence check using 358 positive place invariants in 44 ms returned sat
[2023-03-19 01:15:17] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:15:17] [INFO ] After 464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-19 01:15:17] [INFO ] After 674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 34 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 23 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-19 01:15:17] [INFO ] Invariant cache hit.
[2023-03-19 01:15:18] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-19 01:15:18] [INFO ] Invariant cache hit.
[2023-03-19 01:15:19] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
[2023-03-19 01:15:19] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-19 01:15:19] [INFO ] Invariant cache hit.
[2023-03-19 01:15:19] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1705 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 23 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:15:19] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-19 01:15:19] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:15:19] [INFO ] [Nat]Absence check using 358 positive place invariants in 56 ms returned sat
[2023-03-19 01:15:20] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:15:20] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-19 01:15:20] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 958 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (NOT p1)]
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 760/760 places, 758/758 transitions.
Applied a total of 0 rules in 24 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 760 cols
[2023-03-19 01:15:21] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-19 01:15:21] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-19 01:15:21] [INFO ] Invariant cache hit.
[2023-03-19 01:15:23] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 1687 ms to find 0 implicit places.
[2023-03-19 01:15:23] [INFO ] Invariant cache hit.
[2023-03-19 01:15:23] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2235 ms. Remains : 760/760 places, 758/758 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 253202 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253202 steps, saw 159097 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:15:27] [INFO ] Invariant cache hit.
[2023-03-19 01:15:27] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:15:27] [INFO ] [Nat]Absence check using 358 positive place invariants in 47 ms returned sat
[2023-03-19 01:15:27] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:15:27] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-19 01:15:27] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 758/758 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 760 transition count 757
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 760 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 759 transition count 756
Applied a total of 3 rules in 70 ms. Remains 759 /760 variables (removed 1) and now considering 756/758 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 759/760 places, 756/758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 267125 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267125 steps, saw 167913 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:15:31] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-19 01:15:31] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:15:31] [INFO ] [Nat]Absence check using 358 positive place invariants in 75 ms returned sat
[2023-03-19 01:15:31] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:15:32] [INFO ] After 374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-19 01:15:32] [INFO ] After 667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 28 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 21 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-19 01:15:32] [INFO ] Invariant cache hit.
[2023-03-19 01:15:32] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-19 01:15:32] [INFO ] Invariant cache hit.
[2023-03-19 01:15:33] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
[2023-03-19 01:15:33] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-19 01:15:33] [INFO ] Invariant cache hit.
[2023-03-19 01:15:33] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1852 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 37 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:15:33] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:15:34] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:15:34] [INFO ] [Nat]Absence check using 358 positive place invariants in 81 ms returned sat
[2023-03-19 01:15:34] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:15:34] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-19 01:15:34] [INFO ] After 640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 640 ms.
Product exploration explored 100000 steps with 0 reset in 795 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (NOT p1)]
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 760/760 places, 758/758 transitions.
Applied a total of 0 rules in 62 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2023-03-19 01:15:37] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 758 rows 760 cols
[2023-03-19 01:15:37] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:15:37] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 564 ms. Remains : 760/760 places, 758/758 transitions.
Built C files in :
/tmp/ltsmin1151824869077661155
[2023-03-19 01:15:37] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1151824869077661155
Running compilation step : cd /tmp/ltsmin1151824869077661155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2221 ms.
Running link step : cd /tmp/ltsmin1151824869077661155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 103 ms.
Running LTSmin : cd /tmp/ltsmin1151824869077661155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7675644779475277309.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 760/760 places, 758/758 transitions.
Applied a total of 0 rules in 26 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2023-03-19 01:15:53] [INFO ] Invariant cache hit.
[2023-03-19 01:15:53] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-19 01:15:53] [INFO ] Invariant cache hit.
[2023-03-19 01:15:54] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1515 ms to find 0 implicit places.
[2023-03-19 01:15:54] [INFO ] Invariant cache hit.
[2023-03-19 01:15:55] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2225 ms. Remains : 760/760 places, 758/758 transitions.
Built C files in :
/tmp/ltsmin6696797987144805502
[2023-03-19 01:15:55] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6696797987144805502
Running compilation step : cd /tmp/ltsmin6696797987144805502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1317 ms.
Running link step : cd /tmp/ltsmin6696797987144805502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin6696797987144805502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14439227099883267758.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 01:16:10] [INFO ] Flatten gal took : 34 ms
[2023-03-19 01:16:10] [INFO ] Flatten gal took : 31 ms
[2023-03-19 01:16:10] [INFO ] Time to serialize gal into /tmp/LTL15972447925986689346.gal : 8 ms
[2023-03-19 01:16:10] [INFO ] Time to serialize properties into /tmp/LTL896858417068720312.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/LTL15972447925986689346.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13796756559031326444.hoa' '-atoms' '/tmp/LTL896858417068720312.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL896858417068720312.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13796756559031326444.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2023-03-19 01:16:25] [INFO ] Flatten gal took : 32 ms
[2023-03-19 01:16:25] [INFO ] Flatten gal took : 31 ms
[2023-03-19 01:16:25] [INFO ] Time to serialize gal into /tmp/LTL13464585877242101270.gal : 5 ms
[2023-03-19 01:16:25] [INFO ] Time to serialize properties into /tmp/LTL11342527937185597474.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/LTL13464585877242101270.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11342527937185597474.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...277
Read 1 LTL properties
Checking formula 0 : !((("(p1460==1)")U(G("(((p1460==1)||(p1126==0))||(p1655==1))"))))
Formula 0 simplified : !"(p1460==1)" R F!"(((p1460==1)||(p1126==0))||(p1655==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2023-03-19 01:16:41] [INFO ] Flatten gal took : 67 ms
[2023-03-19 01:16:41] [INFO ] Applying decomposition
[2023-03-19 01:16:41] [INFO ] Flatten gal took : 35 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/graph13707819021189388145.txt' '-o' '/tmp/graph13707819021189388145.bin' '-w' '/tmp/graph13707819021189388145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13707819021189388145.bin' '-l' '-1' '-v' '-w' '/tmp/graph13707819021189388145.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:16:42] [INFO ] Decomposing Gal with order
[2023-03-19 01:16:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:16:42] [INFO ] Removed a total of 848 redundant transitions.
[2023-03-19 01:16:42] [INFO ] Flatten gal took : 150 ms
[2023-03-19 01:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 350 labels/synchronizations in 48 ms.
[2023-03-19 01:16:42] [INFO ] Time to serialize gal into /tmp/LTL7388621385014175381.gal : 30 ms
[2023-03-19 01:16:42] [INFO ] Time to serialize properties into /tmp/LTL9027828548011713275.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/LTL7388621385014175381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9027828548011713275.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((("(i12.u164.p1460==1)")U(G("(((i12.u164.p1460==1)||(i9.u125.p1126==0))||(i14.u187.p1655==1))"))))
Formula 0 simplified : !"(i12.u164.p1460==1)" R F!"(((i12.u164.p1460==1)||(i9.u125.p1126==0))||(i14.u187.p1655==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2700742874552748678
[2023-03-19 01:16:57] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2700742874552748678
Running compilation step : cd /tmp/ltsmin2700742874552748678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1349 ms.
Running link step : cd /tmp/ltsmin2700742874552748678;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin2700742874552748678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U []((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-00 finished in 129125 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)))'
Support contains 2 out of 2374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2373 transition count 1694
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1894 transition count 1694
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 958 place count 1894 transition count 1381
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1584 place count 1581 transition count 1381
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1593 place count 1572 transition count 1372
Iterating global reduction 2 with 9 rules applied. Total rules applied 1602 place count 1572 transition count 1372
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1602 place count 1572 transition count 1364
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1618 place count 1564 transition count 1364
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 3 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 2976 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2977 place count 885 transition count 684
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2979 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3181 place count 783 transition count 749
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3217 place count 765 transition count 762
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3218 place count 765 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3220 place count 763 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3222 place count 761 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3222 place count 761 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3224 place count 760 transition count 759
Applied a total of 3224 rules in 465 ms. Remains 760 /2374 variables (removed 1614) and now considering 759/2174 (removed 1415) transitions.
// Phase 1: matrix 759 rows 760 cols
[2023-03-19 01:17:13] [INFO ] Computed 359 place invariants in 4 ms
[2023-03-19 01:17:13] [INFO ] Implicit Places using invariants in 426 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 428 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/2374 places, 759/2174 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 758
Applied a total of 2 rules in 31 ms. Remains 758 /759 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 758 cols
[2023-03-19 01:17:13] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:17:14] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-19 01:17:14] [INFO ] Invariant cache hit.
[2023-03-19 01:17:15] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 758/2374 places, 758/2174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2392 ms. Remains : 758/2374 places, 758/2174 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-02 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:(OR (EQ s56 0) (EQ s531 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 697 ms.
Product exploration explored 100000 steps with 0 reset in 834 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 307226 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307226 steps, saw 195264 distinct states, run finished after 3002 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:17:20] [INFO ] Invariant cache hit.
[2023-03-19 01:17:20] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:17:20] [INFO ] [Nat]Absence check using 358 positive place invariants in 61 ms returned sat
[2023-03-19 01:17:21] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:17:21] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-19 01:17:21] [INFO ] After 748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 758/758 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 758 transition count 757
Applied a total of 1 rules in 24 ms. Remains 758 /758 variables (removed 0) and now considering 757/758 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 758/758 places, 757/758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 302582 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 302582 steps, saw 191302 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-19 01:17:24] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:17:24] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:17:24] [INFO ] [Nat]Absence check using 358 positive place invariants in 73 ms returned sat
[2023-03-19 01:17:25] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:17:25] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-19 01:17:25] [INFO ] After 682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 23 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 758/758 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 17 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-19 01:17:25] [INFO ] Invariant cache hit.
[2023-03-19 01:17:25] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-19 01:17:25] [INFO ] Invariant cache hit.
[2023-03-19 01:17:26] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
[2023-03-19 01:17:26] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 01:17:26] [INFO ] Invariant cache hit.
[2023-03-19 01:17:27] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1990 ms. Remains : 758/758 places, 757/757 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 758 transition count 757
Applied a total of 80 rules in 25 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-19 01:17:27] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:17:27] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:17:27] [INFO ] [Nat]Absence check using 358 positive place invariants in 72 ms returned sat
[2023-03-19 01:17:28] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:17:28] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-19 01:17:28] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 3838 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 758/758 transitions.
Applied a total of 0 rules in 35 ms. Remains 758 /758 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 758 cols
[2023-03-19 01:17:32] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:17:32] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-19 01:17:32] [INFO ] Invariant cache hit.
[2023-03-19 01:17:33] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
[2023-03-19 01:17:33] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 01:17:33] [INFO ] Invariant cache hit.
[2023-03-19 01:17:34] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1919 ms. Remains : 758/758 places, 758/758 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 291618 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291618 steps, saw 184282 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:17:37] [INFO ] Invariant cache hit.
[2023-03-19 01:17:37] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:17:37] [INFO ] [Nat]Absence check using 358 positive place invariants in 61 ms returned sat
[2023-03-19 01:17:38] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:17:38] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-19 01:17:38] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 758/758 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 758 transition count 757
Applied a total of 1 rules in 31 ms. Remains 758 /758 variables (removed 0) and now considering 757/758 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 758/758 places, 757/758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 294985 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294985 steps, saw 186309 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-19 01:17:41] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:17:41] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:17:41] [INFO ] [Nat]Absence check using 358 positive place invariants in 121 ms returned sat
[2023-03-19 01:17:42] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:17:42] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-19 01:17:42] [INFO ] After 748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 23 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 758/758 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 17 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-19 01:17:42] [INFO ] Invariant cache hit.
[2023-03-19 01:17:42] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-19 01:17:43] [INFO ] Invariant cache hit.
[2023-03-19 01:17:43] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
[2023-03-19 01:17:43] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 01:17:43] [INFO ] Invariant cache hit.
[2023-03-19 01:17:44] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1799 ms. Remains : 758/758 places, 757/757 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 758 transition count 757
Applied a total of 80 rules in 25 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-19 01:17:44] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:17:44] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:17:44] [INFO ] [Nat]Absence check using 358 positive place invariants in 71 ms returned sat
[2023-03-19 01:17:44] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:17:44] [INFO ] After 374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-19 01:17:45] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 591 ms.
Product exploration explored 100000 steps with 0 reset in 829 ms.
Built C files in :
/tmp/ltsmin10473751484915310701
[2023-03-19 01:17:46] [INFO ] Computing symmetric may disable matrix : 758 transitions.
[2023-03-19 01:17:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:17:46] [INFO ] Computing symmetric may enable matrix : 758 transitions.
[2023-03-19 01:17:46] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:17:47] [INFO ] Computing Do-Not-Accords matrix : 758 transitions.
[2023-03-19 01:17:47] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:17:47] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10473751484915310701
Running compilation step : cd /tmp/ltsmin10473751484915310701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2131 ms.
Running link step : cd /tmp/ltsmin10473751484915310701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin10473751484915310701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16502006260290138983.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 758/758 transitions.
Applied a total of 0 rules in 17 ms. Remains 758 /758 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 758 cols
[2023-03-19 01:18:02] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:18:02] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-19 01:18:02] [INFO ] Invariant cache hit.
[2023-03-19 01:18:03] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2023-03-19 01:18:03] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 01:18:03] [INFO ] Invariant cache hit.
[2023-03-19 01:18:03] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1671 ms. Remains : 758/758 places, 758/758 transitions.
Built C files in :
/tmp/ltsmin17238168639039083869
[2023-03-19 01:18:03] [INFO ] Computing symmetric may disable matrix : 758 transitions.
[2023-03-19 01:18:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:18:03] [INFO ] Computing symmetric may enable matrix : 758 transitions.
[2023-03-19 01:18:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:18:03] [INFO ] Computing Do-Not-Accords matrix : 758 transitions.
[2023-03-19 01:18:03] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:18:03] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17238168639039083869
Running compilation step : cd /tmp/ltsmin17238168639039083869;'/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/ltsmin17238168639039083869;'/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/ltsmin17238168639039083869;'/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 01:18:07] [INFO ] Flatten gal took : 38 ms
[2023-03-19 01:18:08] [INFO ] Flatten gal took : 26 ms
[2023-03-19 01:18:08] [INFO ] Time to serialize gal into /tmp/LTL2180531850221154968.gal : 5 ms
[2023-03-19 01:18:08] [INFO ] Time to serialize properties into /tmp/LTL13966333416975798470.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/LTL2180531850221154968.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1636958010630900697.hoa' '-atoms' '/tmp/LTL13966333416975798470.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13966333416975798470.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1636958010630900697.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60065e+49 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
378 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.90265,128920,1,0,10,770800,24,6,20986,240032,22
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-02 finished in 59348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1)&&(G(p3)||p2))))'
Support contains 5 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2362 transition count 2162
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2362 transition count 2162
Applied a total of 24 rules in 276 ms. Remains 2362 /2374 variables (removed 12) and now considering 2162/2174 (removed 12) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-19 01:18:12] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-19 01:18:13] [INFO ] Implicit Places using invariants in 770 ms returned []
[2023-03-19 01:18:13] [INFO ] Invariant cache hit.
[2023-03-19 01:18:15] [INFO ] Implicit Places using invariants and state equation in 2357 ms returned []
Implicit Place search using SMT with State Equation took 3129 ms to find 0 implicit places.
[2023-03-19 01:18:15] [INFO ] Invariant cache hit.
[2023-03-19 01:18:17] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2374 places, 2162/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4793 ms. Remains : 2362/2374 places, 2162/2174 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p3)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1216 1), p2:(OR (EQ s1715 0) (EQ s945 1)), p3:(AND (OR (EQ s1271 0) (EQ s1674 1)) (EQ s1216 1)), p1:(OR (EQ s1715 0) (EQ s945 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-03 finished in 5187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&(G(p1) U !p2)))&&F(G(p3)))))'
Support contains 5 out of 2374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 2373 transition count 1697
Reduce places removed 476 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 478 rules applied. Total rules applied 954 place count 1897 transition count 1695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 956 place count 1895 transition count 1695
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 956 place count 1895 transition count 1382
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1582 place count 1582 transition count 1382
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1590 place count 1574 transition count 1374
Iterating global reduction 3 with 8 rules applied. Total rules applied 1598 place count 1574 transition count 1374
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1598 place count 1574 transition count 1367
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1612 place count 1567 transition count 1367
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 0 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2970 place count 888 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2971 place count 888 transition count 687
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2973 place count 887 transition count 686
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3175 place count 786 transition count 752
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3209 place count 769 transition count 763
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3211 place count 767 transition count 761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3213 place count 765 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3213 place count 765 transition count 760
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3215 place count 764 transition count 760
Applied a total of 3215 rules in 449 ms. Remains 764 /2374 variables (removed 1610) and now considering 760/2174 (removed 1414) transitions.
// Phase 1: matrix 760 rows 764 cols
[2023-03-19 01:18:18] [INFO ] Computed 359 place invariants in 5 ms
[2023-03-19 01:18:18] [INFO ] Implicit Places using invariants in 521 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 522 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/2374 places, 760/2174 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 759
Applied a total of 2 rules in 55 ms. Remains 762 /763 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 762 cols
[2023-03-19 01:18:18] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:18:19] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-19 01:18:19] [INFO ] Invariant cache hit.
[2023-03-19 01:18:19] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-03-19 01:18:21] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 2577 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 762/2374 places, 759/2174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3604 ms. Remains : 762/2374 places, 759/2174 transitions.
Stuttering acceptance computed with spot in 2253 ms :[(OR (NOT p0) (NOT p3) p2), (OR (NOT p0) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), p2]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 4}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p2 p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s342 1), p2:(OR (EQ s597 0) (EQ s536 1)), p1:(OR (EQ s169 0) (EQ s289 1)), p3:(AND (EQ s536 0) (EQ s597 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-04 finished in 5904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2362 transition count 2162
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2362 transition count 2162
Applied a total of 24 rules in 312 ms. Remains 2362 /2374 variables (removed 12) and now considering 2162/2174 (removed 12) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-19 01:18:23] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-19 01:18:24] [INFO ] Implicit Places using invariants in 847 ms returned []
[2023-03-19 01:18:24] [INFO ] Invariant cache hit.
[2023-03-19 01:18:26] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 3120 ms to find 0 implicit places.
[2023-03-19 01:18:26] [INFO ] Invariant cache hit.
[2023-03-19 01:18:28] [INFO ] Dead Transitions using invariants and state equation in 1501 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2374 places, 2162/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4934 ms. Remains : 2362/2374 places, 2162/2174 transitions.
Stuttering acceptance computed with spot in 2940 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1721 0) (EQ s1560 1)), p0:(OR (EQ s1890 0) (EQ s1309 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1635 ms.
Product exploration explored 100000 steps with 50000 reset in 1616 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 174 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-05 finished in 11373 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((p0&&X(F(p1)))))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2362 transition count 2162
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2362 transition count 2162
Applied a total of 24 rules in 335 ms. Remains 2362 /2374 variables (removed 12) and now considering 2162/2174 (removed 12) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-19 01:18:35] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-19 01:18:36] [INFO ] Implicit Places using invariants in 930 ms returned []
[2023-03-19 01:18:36] [INFO ] Invariant cache hit.
[2023-03-19 01:18:38] [INFO ] Implicit Places using invariants and state equation in 2307 ms returned []
Implicit Place search using SMT with State Equation took 3263 ms to find 0 implicit places.
[2023-03-19 01:18:38] [INFO ] Invariant cache hit.
[2023-03-19 01:18:39] [INFO ] Dead Transitions using invariants and state equation in 1351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2374 places, 2162/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4951 ms. Remains : 2362/2374 places, 2162/2174 transitions.
Stuttering acceptance computed with spot in 653 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s252 0) (EQ s4 1)), p0:(OR (EQ s317 0) (EQ s448 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6621 reset in 462 ms.
Product exploration explored 100000 steps with 6678 reset in 449 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 363 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-19 01:18:42] [INFO ] Invariant cache hit.
[2023-03-19 01:18:43] [INFO ] [Real]Absence check using 361 positive place invariants in 265 ms returned sat
[2023-03-19 01:18:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:18:53] [INFO ] [Real]Absence check using state equation in 9920 ms returned sat
[2023-03-19 01:18:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:18:55] [INFO ] [Nat]Absence check using 361 positive place invariants in 172 ms returned sat
[2023-03-19 01:18:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:18:56] [INFO ] [Nat]Absence check using state equation in 1483 ms returned sat
[2023-03-19 01:18:57] [INFO ] Computed and/alt/rep : 2161/3242/2161 causal constraints (skipped 0 transitions) in 126 ms.
[2023-03-19 01:19:10] [INFO ] Deduced a trap composed of 22 places in 1307 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:19:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 2 out of 2362 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Applied a total of 0 rules in 166 ms. Remains 2362 /2362 variables (removed 0) and now considering 2162/2162 (removed 0) transitions.
[2023-03-19 01:19:10] [INFO ] Invariant cache hit.
[2023-03-19 01:19:11] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-19 01:19:11] [INFO ] Invariant cache hit.
[2023-03-19 01:19:13] [INFO ] Implicit Places using invariants and state equation in 2013 ms returned []
Implicit Place search using SMT with State Equation took 2704 ms to find 0 implicit places.
[2023-03-19 01:19:13] [INFO ] Invariant cache hit.
[2023-03-19 01:19:14] [INFO ] Dead Transitions using invariants and state equation in 1219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4091 ms. Remains : 2362/2362 places, 2162/2162 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-19 01:19:15] [INFO ] Invariant cache hit.
[2023-03-19 01:19:16] [INFO ] [Real]Absence check using 361 positive place invariants in 325 ms returned sat
[2023-03-19 01:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:19:27] [INFO ] [Real]Absence check using state equation in 10608 ms returned sat
[2023-03-19 01:19:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:19:28] [INFO ] [Nat]Absence check using 361 positive place invariants in 272 ms returned sat
[2023-03-19 01:19:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:19:30] [INFO ] [Nat]Absence check using state equation in 1479 ms returned sat
[2023-03-19 01:19:30] [INFO ] Computed and/alt/rep : 2161/3242/2161 causal constraints (skipped 0 transitions) in 116 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:19:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6700 reset in 391 ms.
Product exploration explored 100000 steps with 6740 reset in 368 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 2362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2362 transition count 2162
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 162 Pre rules applied. Total rules applied 477 place count 2362 transition count 2284
Deduced a syphon composed of 639 places in 4 ms
Iterating global reduction 1 with 162 rules applied. Total rules applied 639 place count 2362 transition count 2284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 640 place count 2361 transition count 2283
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 641 place count 2361 transition count 2283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 641 place count 2361 transition count 2284
Deduced a syphon composed of 640 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 642 place count 2361 transition count 2284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 643 place count 2360 transition count 2282
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 644 place count 2360 transition count 2282
Performed 797 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1436 places in 2 ms
Iterating global reduction 1 with 797 rules applied. Total rules applied 1441 place count 2360 transition count 2282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1442 place count 2360 transition count 2281
Renaming transitions due to excessive name length > 1024 char.
Discarding 319 places :
Symmetric choice reduction at 2 with 319 rule applications. Total rules 1761 place count 2041 transition count 1962
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 2080 place count 2041 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2081 place count 2041 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2083 place count 2039 transition count 1960
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2085 place count 2039 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -529
Deduced a syphon composed of 1217 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2186 place count 2039 transition count 2489
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2287 place count 1938 transition count 2287
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2388 place count 1938 transition count 2287
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -309
Deduced a syphon composed of 1174 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2446 place count 1938 transition count 2596
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2504 place count 1880 transition count 2480
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2562 place count 1880 transition count 2480
Deduced a syphon composed of 1116 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2571 place count 1880 transition count 2471
Deduced a syphon composed of 1116 places in 2 ms
Applied a total of 2571 rules in 1703 ms. Remains 1880 /2362 variables (removed 482) and now considering 2471/2162 (removed -309) transitions.
[2023-03-19 01:19:45] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 2471 rows 1880 cols
[2023-03-19 01:19:45] [INFO ] Computed 361 place invariants in 38 ms
[2023-03-19 01:19:46] [INFO ] Dead Transitions using invariants and state equation in 1334 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1880/2362 places, 2471/2162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3089 ms. Remains : 1880/2362 places, 2471/2162 transitions.
Built C files in :
/tmp/ltsmin15418417462955778503
[2023-03-19 01:19:47] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15418417462955778503
Running compilation step : cd /tmp/ltsmin15418417462955778503;'/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/ltsmin15418417462955778503;'/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/ltsmin15418417462955778503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2361 transition count 2161
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2361 transition count 2161
Applied a total of 2 rules in 246 ms. Remains 2361 /2362 variables (removed 1) and now considering 2161/2162 (removed 1) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-19 01:19:50] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-19 01:19:51] [INFO ] Implicit Places using invariants in 788 ms returned []
[2023-03-19 01:19:51] [INFO ] Invariant cache hit.
[2023-03-19 01:19:53] [INFO ] Implicit Places using invariants and state equation in 2116 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
[2023-03-19 01:19:53] [INFO ] Invariant cache hit.
[2023-03-19 01:19:54] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2362 places, 2161/2162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4532 ms. Remains : 2361/2362 places, 2161/2162 transitions.
Built C files in :
/tmp/ltsmin16535127618425808773
[2023-03-19 01:19:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16535127618425808773
Running compilation step : cd /tmp/ltsmin16535127618425808773;'/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/ltsmin16535127618425808773;'/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/ltsmin16535127618425808773;'/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 01:19:57] [INFO ] Flatten gal took : 49 ms
[2023-03-19 01:19:57] [INFO ] Flatten gal took : 48 ms
[2023-03-19 01:19:57] [INFO ] Time to serialize gal into /tmp/LTL16564266551760268595.gal : 9 ms
[2023-03-19 01:19:57] [INFO ] Time to serialize properties into /tmp/LTL6998884704784547676.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/LTL16564266551760268595.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2032133076228978823.hoa' '-atoms' '/tmp/LTL6998884704784547676.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6998884704784547676.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2032133076228978823.hoa
Detected timeout of ITS tools.
[2023-03-19 01:20:12] [INFO ] Flatten gal took : 51 ms
[2023-03-19 01:20:13] [INFO ] Flatten gal took : 51 ms
[2023-03-19 01:20:13] [INFO ] Time to serialize gal into /tmp/LTL6845644568365986578.gal : 9 ms
[2023-03-19 01:20:13] [INFO ] Time to serialize properties into /tmp/LTL11822899001663884527.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/LTL6845644568365986578.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11822899001663884527.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((X(F("((p289==0)&&(p4==1))")))&&("((p366==0)||(p522==1))"))))
Formula 0 simplified : X(!"((p366==0)||(p522==1))" | XG!"((p289==0)&&(p4==1))")
Detected timeout of ITS tools.
[2023-03-19 01:20:28] [INFO ] Flatten gal took : 59 ms
[2023-03-19 01:20:28] [INFO ] Applying decomposition
[2023-03-19 01:20:28] [INFO ] Flatten gal took : 46 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/graph4316570067335681801.txt' '-o' '/tmp/graph4316570067335681801.bin' '-w' '/tmp/graph4316570067335681801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4316570067335681801.bin' '-l' '-1' '-v' '-w' '/tmp/graph4316570067335681801.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:20:28] [INFO ] Decomposing Gal with order
[2023-03-19 01:20:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:20:28] [INFO ] Removed a total of 397 redundant transitions.
[2023-03-19 01:20:28] [INFO ] Flatten gal took : 92 ms
[2023-03-19 01:20:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-19 01:20:43] [INFO ] Time to serialize gal into /tmp/LTL3065933518774399141.gal : 14714 ms
[2023-03-19 01:20:45] [INFO ] Time to serialize properties into /tmp/LTL1541576964963847223.ltl : 2206 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/LTL3065933518774399141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1541576964963847223.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((X(F("((i3.i4.u96.p289==0)&&(i33.i0.u2.p4==1))")))&&("((i4.i5.u122.p366==0)||(i6.i6.u169.p522==1))"))))
Formula 0 simplified : X(!"((i4.i5.u122.p366==0)||(i6.i6.u169.p522==1))" | XG!"((i3.i4.u96.p289==0)&&(i33.i0.u2.p4==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8069704643864578040
[2023-03-19 01:21:00] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8069704643864578040
Running compilation step : cd /tmp/ltsmin8069704643864578040;'/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/ltsmin8069704643864578040;'/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/ltsmin8069704643864578040;'/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 ShieldIIPt-PT-040B-LTLCardinality-09 finished in 149011 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 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2361 transition count 2161
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2361 transition count 2161
Applied a total of 26 rules in 305 ms. Remains 2361 /2374 variables (removed 13) and now considering 2161/2174 (removed 13) transitions.
[2023-03-19 01:21:04] [INFO ] Invariant cache hit.
[2023-03-19 01:21:04] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-03-19 01:21:04] [INFO ] Invariant cache hit.
[2023-03-19 01:21:07] [INFO ] Implicit Places using invariants and state equation in 2440 ms returned []
Implicit Place search using SMT with State Equation took 3226 ms to find 0 implicit places.
[2023-03-19 01:21:07] [INFO ] Invariant cache hit.
[2023-03-19 01:21:08] [INFO ] Dead Transitions using invariants and state equation in 1248 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2374 places, 2161/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4780 ms. Remains : 2361/2374 places, 2161/2174 transitions.
Stuttering acceptance computed with spot in 1324 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s970 0) (EQ s982 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 448 steps with 0 reset in 4 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-10 finished in 6150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(X(p1)) U G(!p0)))))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2364 transition count 2164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2364 transition count 2164
Applied a total of 20 rules in 312 ms. Remains 2364 /2374 variables (removed 10) and now considering 2164/2174 (removed 10) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-19 01:21:10] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-19 01:21:11] [INFO ] Implicit Places using invariants in 1181 ms returned []
[2023-03-19 01:21:11] [INFO ] Invariant cache hit.
[2023-03-19 01:21:14] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3754 ms to find 0 implicit places.
[2023-03-19 01:21:14] [INFO ] Invariant cache hit.
[2023-03-19 01:21:15] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2364/2374 places, 2164/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5454 ms. Remains : 2364/2374 places, 2164/2174 transitions.
Stuttering acceptance computed with spot in 421 ms :[true, (NOT p0), p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s2293 0) (EQ s774 1)), p1:(OR (EQ s78 0) (EQ s1105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20036 reset in 803 ms.
Product exploration explored 100000 steps with 20033 reset in 774 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 300 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 398 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 01:21:18] [INFO ] Invariant cache hit.
[2023-03-19 01:21:18] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 01:21:19] [INFO ] [Nat]Absence check using 361 positive place invariants in 136 ms returned sat
[2023-03-19 01:21:21] [INFO ] After 1405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 01:21:21] [INFO ] Deduced a trap composed of 19 places in 641 ms of which 2 ms to minimize.
[2023-03-19 01:21:22] [INFO ] Deduced a trap composed of 19 places in 623 ms of which 2 ms to minimize.
[2023-03-19 01:21:23] [INFO ] Deduced a trap composed of 35 places in 598 ms of which 2 ms to minimize.
[2023-03-19 01:21:24] [INFO ] Deduced a trap composed of 20 places in 675 ms of which 26 ms to minimize.
[2023-03-19 01:21:24] [INFO ] Deduced a trap composed of 18 places in 453 ms of which 1 ms to minimize.
[2023-03-19 01:21:25] [INFO ] Deduced a trap composed of 21 places in 446 ms of which 1 ms to minimize.
[2023-03-19 01:21:25] [INFO ] Deduced a trap composed of 23 places in 550 ms of which 2 ms to minimize.
[2023-03-19 01:21:26] [INFO ] Deduced a trap composed of 22 places in 468 ms of which 1 ms to minimize.
[2023-03-19 01:21:26] [INFO ] Deduced a trap composed of 24 places in 516 ms of which 1 ms to minimize.
[2023-03-19 01:21:27] [INFO ] Deduced a trap composed of 18 places in 548 ms of which 1 ms to minimize.
[2023-03-19 01:21:28] [INFO ] Deduced a trap composed of 31 places in 462 ms of which 1 ms to minimize.
[2023-03-19 01:21:28] [INFO ] Deduced a trap composed of 23 places in 432 ms of which 1 ms to minimize.
[2023-03-19 01:21:29] [INFO ] Deduced a trap composed of 28 places in 453 ms of which 1 ms to minimize.
[2023-03-19 01:21:29] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 1 ms to minimize.
[2023-03-19 01:21:30] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 1 ms to minimize.
[2023-03-19 01:21:30] [INFO ] Deduced a trap composed of 28 places in 501 ms of which 1 ms to minimize.
[2023-03-19 01:21:31] [INFO ] Deduced a trap composed of 30 places in 515 ms of which 2 ms to minimize.
[2023-03-19 01:21:31] [INFO ] Deduced a trap composed of 30 places in 389 ms of which 1 ms to minimize.
[2023-03-19 01:21:32] [INFO ] Deduced a trap composed of 29 places in 362 ms of which 1 ms to minimize.
[2023-03-19 01:21:32] [INFO ] Deduced a trap composed of 24 places in 371 ms of which 1 ms to minimize.
[2023-03-19 01:21:33] [INFO ] Deduced a trap composed of 31 places in 420 ms of which 1 ms to minimize.
[2023-03-19 01:21:33] [INFO ] Deduced a trap composed of 41 places in 389 ms of which 1 ms to minimize.
[2023-03-19 01:21:34] [INFO ] Deduced a trap composed of 30 places in 407 ms of which 1 ms to minimize.
[2023-03-19 01:21:34] [INFO ] Deduced a trap composed of 31 places in 427 ms of which 1 ms to minimize.
[2023-03-19 01:21:35] [INFO ] Deduced a trap composed of 29 places in 355 ms of which 1 ms to minimize.
[2023-03-19 01:21:35] [INFO ] Deduced a trap composed of 25 places in 395 ms of which 1 ms to minimize.
[2023-03-19 01:21:35] [INFO ] Deduced a trap composed of 34 places in 327 ms of which 1 ms to minimize.
[2023-03-19 01:21:36] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 1 ms to minimize.
[2023-03-19 01:21:36] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 1 ms to minimize.
[2023-03-19 01:21:37] [INFO ] Deduced a trap composed of 44 places in 358 ms of which 1 ms to minimize.
[2023-03-19 01:21:37] [INFO ] Deduced a trap composed of 29 places in 341 ms of which 1 ms to minimize.
[2023-03-19 01:21:37] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 1 ms to minimize.
[2023-03-19 01:21:38] [INFO ] Deduced a trap composed of 34 places in 369 ms of which 1 ms to minimize.
[2023-03-19 01:21:38] [INFO ] Deduced a trap composed of 40 places in 353 ms of which 1 ms to minimize.
[2023-03-19 01:21:39] [INFO ] Deduced a trap composed of 41 places in 365 ms of which 1 ms to minimize.
[2023-03-19 01:21:39] [INFO ] Deduced a trap composed of 38 places in 318 ms of which 1 ms to minimize.
[2023-03-19 01:21:40] [INFO ] Deduced a trap composed of 41 places in 355 ms of which 1 ms to minimize.
[2023-03-19 01:21:40] [INFO ] Deduced a trap composed of 45 places in 423 ms of which 2 ms to minimize.
[2023-03-19 01:21:41] [INFO ] Deduced a trap composed of 38 places in 427 ms of which 2 ms to minimize.
[2023-03-19 01:21:41] [INFO ] Deduced a trap composed of 36 places in 411 ms of which 1 ms to minimize.
[2023-03-19 01:21:42] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 1 ms to minimize.
[2023-03-19 01:21:42] [INFO ] Deduced a trap composed of 41 places in 365 ms of which 1 ms to minimize.
[2023-03-19 01:21:42] [INFO ] Deduced a trap composed of 39 places in 330 ms of which 1 ms to minimize.
[2023-03-19 01:21:43] [INFO ] Deduced a trap composed of 48 places in 343 ms of which 1 ms to minimize.
[2023-03-19 01:21:43] [INFO ] Deduced a trap composed of 47 places in 315 ms of which 0 ms to minimize.
[2023-03-19 01:21:44] [INFO ] Deduced a trap composed of 39 places in 321 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:21:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:21:44] [INFO ] After 25298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 129 ms.
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 958 place count 1885 transition count 1367
Deduced a syphon composed of 318 places in 14 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1594 place count 1567 transition count 1367
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2956 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2959 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3161 place count 784 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3197 place count 766 transition count 763
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3198 place count 766 transition count 762
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3199 place count 766 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3200 place count 765 transition count 761
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3240 place count 765 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3241 place count 764 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3243 place count 762 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3243 place count 762 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3245 place count 761 transition count 759
Applied a total of 3245 rules in 346 ms. Remains 761 /2364 variables (removed 1603) and now considering 759/2164 (removed 1405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 761/2364 places, 759/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 204941 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204941 steps, saw 114621 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 759 rows 761 cols
[2023-03-19 01:21:47] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-19 01:21:48] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 01:21:48] [INFO ] [Nat]Absence check using 359 positive place invariants in 80 ms returned sat
[2023-03-19 01:21:49] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 01:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 01:21:49] [INFO ] After 168ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 01:21:49] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-19 01:21:49] [INFO ] After 1685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 72 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 13 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 761/761 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 12 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2023-03-19 01:21:49] [INFO ] Invariant cache hit.
[2023-03-19 01:21:50] [INFO ] Implicit Places using invariants in 662 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 663 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 759/759 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 758
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 758
Applied a total of 2 rules in 22 ms. Remains 759 /760 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 759 cols
[2023-03-19 01:21:50] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-19 01:21:51] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-19 01:21:51] [INFO ] Invariant cache hit.
[2023-03-19 01:21:52] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 758/759 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2122 ms. Remains : 759/761 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 178182 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178182 steps, saw 97594 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 01:21:55] [INFO ] Invariant cache hit.
[2023-03-19 01:21:55] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 01:21:55] [INFO ] [Nat]Absence check using 358 positive place invariants in 55 ms returned sat
[2023-03-19 01:21:56] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 01:21:56] [INFO ] After 716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-19 01:21:56] [INFO ] After 1129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 173 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 759/759 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2023-03-19 01:21:56] [INFO ] Invariant cache hit.
[2023-03-19 01:21:57] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-19 01:21:57] [INFO ] Invariant cache hit.
[2023-03-19 01:21:58] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1529 ms to find 0 implicit places.
[2023-03-19 01:21:58] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-19 01:21:58] [INFO ] Invariant cache hit.
[2023-03-19 01:21:58] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1976 ms. Remains : 759/759 places, 758/758 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 759 transition count 758
Applied a total of 79 rules in 27 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 758 rows 759 cols
[2023-03-19 01:21:58] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-19 01:21:58] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 01:21:59] [INFO ] [Nat]Absence check using 358 positive place invariants in 65 ms returned sat
[2023-03-19 01:21:59] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 01:21:59] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-19 01:21:59] [INFO ] After 205ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 01:22:00] [INFO ] After 572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-19 01:22:00] [INFO ] After 1444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 321 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Stuttering acceptance computed with spot in 463 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-19 01:22:01] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-19 01:22:03] [INFO ] [Real]Absence check using 361 positive place invariants in 442 ms returned sat
[2023-03-19 01:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:22:13] [INFO ] [Real]Absence check using state equation in 10732 ms returned sat
[2023-03-19 01:22:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:22:15] [INFO ] [Nat]Absence check using 361 positive place invariants in 496 ms returned sat
[2023-03-19 01:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:22:28] [INFO ] [Nat]Absence check using state equation in 12812 ms returned sat
[2023-03-19 01:22:28] [INFO ] Computed and/alt/rep : 2163/3245/2163 causal constraints (skipped 0 transitions) in 153 ms.
[2023-03-19 01:22:28] [INFO ] Added : 10 causal constraints over 2 iterations in 503 ms. Result :unknown
Could not prove EG p0
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 207 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
[2023-03-19 01:22:29] [INFO ] Invariant cache hit.
[2023-03-19 01:22:29] [INFO ] Implicit Places using invariants in 816 ms returned []
[2023-03-19 01:22:29] [INFO ] Invariant cache hit.
[2023-03-19 01:22:32] [INFO ] Implicit Places using invariants and state equation in 2402 ms returned []
Implicit Place search using SMT with State Equation took 3232 ms to find 0 implicit places.
[2023-03-19 01:22:32] [INFO ] Invariant cache hit.
[2023-03-19 01:22:33] [INFO ] Dead Transitions using invariants and state equation in 1494 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4934 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 01:22:34] [INFO ] Invariant cache hit.
[2023-03-19 01:22:35] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 01:22:35] [INFO ] [Nat]Absence check using 361 positive place invariants in 121 ms returned sat
[2023-03-19 01:22:36] [INFO ] After 1306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 01:22:37] [INFO ] Deduced a trap composed of 19 places in 569 ms of which 2 ms to minimize.
[2023-03-19 01:22:38] [INFO ] Deduced a trap composed of 19 places in 524 ms of which 2 ms to minimize.
[2023-03-19 01:22:38] [INFO ] Deduced a trap composed of 35 places in 551 ms of which 1 ms to minimize.
[2023-03-19 01:22:39] [INFO ] Deduced a trap composed of 20 places in 559 ms of which 1 ms to minimize.
[2023-03-19 01:22:40] [INFO ] Deduced a trap composed of 18 places in 483 ms of which 1 ms to minimize.
[2023-03-19 01:22:40] [INFO ] Deduced a trap composed of 21 places in 530 ms of which 1 ms to minimize.
[2023-03-19 01:22:41] [INFO ] Deduced a trap composed of 23 places in 505 ms of which 1 ms to minimize.
[2023-03-19 01:22:41] [INFO ] Deduced a trap composed of 22 places in 456 ms of which 2 ms to minimize.
[2023-03-19 01:22:42] [INFO ] Deduced a trap composed of 24 places in 427 ms of which 1 ms to minimize.
[2023-03-19 01:22:43] [INFO ] Deduced a trap composed of 18 places in 510 ms of which 1 ms to minimize.
[2023-03-19 01:22:43] [INFO ] Deduced a trap composed of 31 places in 506 ms of which 1 ms to minimize.
[2023-03-19 01:22:44] [INFO ] Deduced a trap composed of 23 places in 390 ms of which 1 ms to minimize.
[2023-03-19 01:22:44] [INFO ] Deduced a trap composed of 28 places in 499 ms of which 1 ms to minimize.
[2023-03-19 01:22:45] [INFO ] Deduced a trap composed of 26 places in 396 ms of which 1 ms to minimize.
[2023-03-19 01:22:45] [INFO ] Deduced a trap composed of 27 places in 375 ms of which 1 ms to minimize.
[2023-03-19 01:22:45] [INFO ] Deduced a trap composed of 28 places in 399 ms of which 1 ms to minimize.
[2023-03-19 01:22:46] [INFO ] Deduced a trap composed of 30 places in 464 ms of which 1 ms to minimize.
[2023-03-19 01:22:47] [INFO ] Deduced a trap composed of 30 places in 418 ms of which 1 ms to minimize.
[2023-03-19 01:22:47] [INFO ] Deduced a trap composed of 29 places in 403 ms of which 1 ms to minimize.
[2023-03-19 01:22:47] [INFO ] Deduced a trap composed of 24 places in 436 ms of which 1 ms to minimize.
[2023-03-19 01:22:48] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 1 ms to minimize.
[2023-03-19 01:22:48] [INFO ] Deduced a trap composed of 41 places in 409 ms of which 1 ms to minimize.
[2023-03-19 01:22:49] [INFO ] Deduced a trap composed of 30 places in 391 ms of which 1 ms to minimize.
[2023-03-19 01:22:49] [INFO ] Deduced a trap composed of 31 places in 381 ms of which 1 ms to minimize.
[2023-03-19 01:22:50] [INFO ] Deduced a trap composed of 29 places in 457 ms of which 2 ms to minimize.
[2023-03-19 01:22:50] [INFO ] Deduced a trap composed of 25 places in 389 ms of which 1 ms to minimize.
[2023-03-19 01:22:51] [INFO ] Deduced a trap composed of 34 places in 360 ms of which 1 ms to minimize.
[2023-03-19 01:22:51] [INFO ] Deduced a trap composed of 38 places in 396 ms of which 1 ms to minimize.
[2023-03-19 01:22:52] [INFO ] Deduced a trap composed of 41 places in 386 ms of which 1 ms to minimize.
[2023-03-19 01:22:52] [INFO ] Deduced a trap composed of 44 places in 388 ms of which 1 ms to minimize.
[2023-03-19 01:22:53] [INFO ] Deduced a trap composed of 29 places in 392 ms of which 2 ms to minimize.
[2023-03-19 01:22:53] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 1 ms to minimize.
[2023-03-19 01:22:54] [INFO ] Deduced a trap composed of 34 places in 387 ms of which 1 ms to minimize.
[2023-03-19 01:22:54] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 1 ms to minimize.
[2023-03-19 01:22:54] [INFO ] Deduced a trap composed of 41 places in 378 ms of which 1 ms to minimize.
[2023-03-19 01:22:55] [INFO ] Deduced a trap composed of 38 places in 371 ms of which 1 ms to minimize.
[2023-03-19 01:22:55] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 1 ms to minimize.
[2023-03-19 01:22:56] [INFO ] Deduced a trap composed of 45 places in 387 ms of which 1 ms to minimize.
[2023-03-19 01:22:56] [INFO ] Deduced a trap composed of 38 places in 385 ms of which 1 ms to minimize.
[2023-03-19 01:22:57] [INFO ] Deduced a trap composed of 36 places in 353 ms of which 1 ms to minimize.
[2023-03-19 01:22:57] [INFO ] Deduced a trap composed of 42 places in 315 ms of which 1 ms to minimize.
[2023-03-19 01:22:57] [INFO ] Deduced a trap composed of 41 places in 363 ms of which 0 ms to minimize.
[2023-03-19 01:22:58] [INFO ] Deduced a trap composed of 39 places in 338 ms of which 1 ms to minimize.
[2023-03-19 01:22:58] [INFO ] Deduced a trap composed of 48 places in 538 ms of which 1 ms to minimize.
[2023-03-19 01:22:59] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 0 ms to minimize.
[2023-03-19 01:22:59] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 1 ms to minimize.
[2023-03-19 01:23:00] [INFO ] Deduced a trap composed of 47 places in 347 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:23:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:23:00] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 135 ms.
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 958 place count 1885 transition count 1367
Deduced a syphon composed of 318 places in 2 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1594 place count 1567 transition count 1367
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2956 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2959 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3161 place count 784 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3197 place count 766 transition count 763
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3198 place count 766 transition count 762
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3199 place count 766 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3200 place count 765 transition count 761
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3240 place count 765 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3241 place count 764 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3243 place count 762 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3243 place count 762 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3245 place count 761 transition count 759
Applied a total of 3245 rules in 292 ms. Remains 761 /2364 variables (removed 1603) and now considering 759/2164 (removed 1405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 761/2364 places, 759/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 198744 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198744 steps, saw 111492 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 759 rows 761 cols
[2023-03-19 01:23:03] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-19 01:23:04] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 01:23:04] [INFO ] [Nat]Absence check using 359 positive place invariants in 43 ms returned sat
[2023-03-19 01:23:04] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 01:23:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 01:23:04] [INFO ] After 62ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 01:23:04] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-19 01:23:04] [INFO ] After 754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 66 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 11 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 761/761 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 11 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2023-03-19 01:23:04] [INFO ] Invariant cache hit.
[2023-03-19 01:23:05] [INFO ] Implicit Places using invariants in 391 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 392 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 759/759 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 758
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 758
Applied a total of 2 rules in 20 ms. Remains 759 /760 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 759 cols
[2023-03-19 01:23:05] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:23:05] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-19 01:23:05] [INFO ] Invariant cache hit.
[2023-03-19 01:23:07] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 758/759 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2285 ms. Remains : 759/761 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 163167 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163167 steps, saw 89159 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 01:23:10] [INFO ] Invariant cache hit.
[2023-03-19 01:23:10] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 01:23:10] [INFO ] [Nat]Absence check using 358 positive place invariants in 107 ms returned sat
[2023-03-19 01:23:11] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 01:23:11] [INFO ] After 761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-19 01:23:11] [INFO ] After 1219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 156 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 13 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 759/759 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2023-03-19 01:23:12] [INFO ] Invariant cache hit.
[2023-03-19 01:23:12] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-19 01:23:12] [INFO ] Invariant cache hit.
[2023-03-19 01:23:13] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
[2023-03-19 01:23:13] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-19 01:23:13] [INFO ] Invariant cache hit.
[2023-03-19 01:23:13] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1952 ms. Remains : 759/759 places, 758/758 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 759 transition count 758
Applied a total of 79 rules in 33 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 758 rows 759 cols
[2023-03-19 01:23:14] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:23:14] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 01:23:14] [INFO ] [Nat]Absence check using 358 positive place invariants in 37 ms returned sat
[2023-03-19 01:23:14] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 01:23:14] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-19 01:23:14] [INFO ] After 212ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 01:23:15] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 211 ms.
[2023-03-19 01:23:15] [INFO ] After 1342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 478 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Stuttering acceptance computed with spot in 442 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-19 01:23:16] [INFO ] Computed 361 place invariants in 12 ms
[2023-03-19 01:23:18] [INFO ] [Real]Absence check using 361 positive place invariants in 439 ms returned sat
[2023-03-19 01:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:23:29] [INFO ] [Real]Absence check using state equation in 11482 ms returned sat
[2023-03-19 01:23:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:23:31] [INFO ] [Nat]Absence check using 361 positive place invariants in 505 ms returned sat
[2023-03-19 01:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:23:43] [INFO ] [Nat]Absence check using state equation in 12515 ms returned sat
[2023-03-19 01:23:44] [INFO ] Computed and/alt/rep : 2163/3245/2163 causal constraints (skipped 0 transitions) in 112 ms.
[2023-03-19 01:23:46] [INFO ] Deduced a trap composed of 17 places in 1257 ms of which 15 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:23:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p0
Could not prove EG p0
Stuttering acceptance computed with spot in 445 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Product exploration explored 100000 steps with 19989 reset in 758 ms.
Product exploration explored 100000 steps with 19964 reset in 695 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 447 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 2164
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 159 Pre rules applied. Total rules applied 479 place count 2364 transition count 2286
Deduced a syphon composed of 638 places in 4 ms
Iterating global reduction 1 with 159 rules applied. Total rules applied 638 place count 2364 transition count 2286
Performed 802 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1440 places in 3 ms
Iterating global reduction 1 with 802 rules applied. Total rules applied 1440 place count 2364 transition count 2287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1441 place count 2364 transition count 2286
Renaming transitions due to excessive name length > 1024 char.
Discarding 323 places :
Symmetric choice reduction at 2 with 323 rule applications. Total rules 1764 place count 2041 transition count 1962
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 323 rules applied. Total rules applied 2087 place count 2041 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2088 place count 2041 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2090 place count 2039 transition count 1960
Deduced a syphon composed of 1116 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2092 place count 2039 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -533
Deduced a syphon composed of 1217 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2193 place count 2039 transition count 2493
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2294 place count 1938 transition count 2291
Deduced a syphon composed of 1116 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2395 place count 1938 transition count 2291
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1172 places in 3 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2451 place count 1938 transition count 2598
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 2507 place count 1882 transition count 2486
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2563 place count 1882 transition count 2486
Deduced a syphon composed of 1116 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2572 place count 1882 transition count 2477
Deduced a syphon composed of 1116 places in 2 ms
Applied a total of 2572 rules in 1258 ms. Remains 1882 /2364 variables (removed 482) and now considering 2477/2164 (removed -313) transitions.
[2023-03-19 01:23:49] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 2477 rows 1882 cols
[2023-03-19 01:23:49] [INFO ] Computed 361 place invariants in 38 ms
[2023-03-19 01:23:51] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1882/2364 places, 2477/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2711 ms. Remains : 1882/2364 places, 2477/2164 transitions.
Built C files in :
/tmp/ltsmin1934860372927610870
[2023-03-19 01:23:51] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1934860372927610870
Running compilation step : cd /tmp/ltsmin1934860372927610870;'/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/ltsmin1934860372927610870;'/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/ltsmin1934860372927610870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 180 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-19 01:23:54] [INFO ] Computed 361 place invariants in 12 ms
[2023-03-19 01:23:55] [INFO ] Implicit Places using invariants in 766 ms returned []
[2023-03-19 01:23:55] [INFO ] Invariant cache hit.
[2023-03-19 01:23:57] [INFO ] Implicit Places using invariants and state equation in 2155 ms returned []
Implicit Place search using SMT with State Equation took 2935 ms to find 0 implicit places.
[2023-03-19 01:23:57] [INFO ] Invariant cache hit.
[2023-03-19 01:23:58] [INFO ] Dead Transitions using invariants and state equation in 1357 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4488 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Built C files in :
/tmp/ltsmin7910975224157648440
[2023-03-19 01:23:58] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7910975224157648440
Running compilation step : cd /tmp/ltsmin7910975224157648440;'/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/ltsmin7910975224157648440;'/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/ltsmin7910975224157648440;'/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 01:24:02] [INFO ] Flatten gal took : 52 ms
[2023-03-19 01:24:02] [INFO ] Flatten gal took : 44 ms
[2023-03-19 01:24:02] [INFO ] Time to serialize gal into /tmp/LTL12668549596332922057.gal : 12 ms
[2023-03-19 01:24:02] [INFO ] Time to serialize properties into /tmp/LTL6388282995518372383.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/LTL12668549596332922057.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11110184999441590157.hoa' '-atoms' '/tmp/LTL6388282995518372383.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/LTL6388282995518372383.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11110184999441590157.hoa
Detected timeout of ITS tools.
[2023-03-19 01:24:17] [INFO ] Flatten gal took : 45 ms
[2023-03-19 01:24:17] [INFO ] Flatten gal took : 43 ms
[2023-03-19 01:24:17] [INFO ] Time to serialize gal into /tmp/LTL13231889850260931453.gal : 20 ms
[2023-03-19 01:24:17] [INFO ] Time to serialize properties into /tmp/LTL7116785542915042224.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/LTL13231889850260931453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7116785542915042224.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 : !(((F("((p2714==0)||(p908==1))"))&&(X((X(X("((p81==0)||(p1301==1))")))U(G(!("((p2714==0)||(p908==1))")))))))
Formula 0 simplified : G!"((p2714==0)||(p908==1))" | X(XX!"((p81==0)||(p1301==1))" R F"((p2714==0)||(p908==1))")
Detected timeout of ITS tools.
[2023-03-19 01:24:32] [INFO ] Flatten gal took : 92 ms
[2023-03-19 01:24:32] [INFO ] Applying decomposition
[2023-03-19 01:24:32] [INFO ] Flatten gal took : 55 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/graph13178919545799360719.txt' '-o' '/tmp/graph13178919545799360719.bin' '-w' '/tmp/graph13178919545799360719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13178919545799360719.bin' '-l' '-1' '-v' '-w' '/tmp/graph13178919545799360719.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:24:32] [INFO ] Decomposing Gal with order
[2023-03-19 01:24:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:24:33] [INFO ] Removed a total of 397 redundant transitions.
[2023-03-19 01:24:33] [INFO ] Flatten gal took : 82 ms
[2023-03-19 01:24:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-19 01:24:33] [INFO ] Time to serialize gal into /tmp/LTL12493838303732023759.gal : 18 ms
[2023-03-19 01:24:33] [INFO ] Time to serialize properties into /tmp/LTL9917943766471581549.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/LTL12493838303732023759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9917943766471581549.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 : !(((F("((i38.i5.u858.p2714==0)||(i1.i5.u293.p908==1))"))&&(X((X(X("((i2.i6.u32.p81==0)||(i19.i2.u417.p1301==1))")))U(G(!("((i38.i5.u85...197
Formula 0 simplified : G!"((i38.i5.u858.p2714==0)||(i1.i5.u293.p908==1))" | X(XX!"((i2.i6.u32.p81==0)||(i19.i2.u417.p1301==1))" R F"((i38.i5.u858.p2714==0)...180
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14588387880495962234
[2023-03-19 01:24:48] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14588387880495962234
Running compilation step : cd /tmp/ltsmin14588387880495962234;'/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/ltsmin14588387880495962234;'/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/ltsmin14588387880495962234;'/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 ShieldIIPt-PT-040B-LTLCardinality-14 finished in 221255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p1))&&G(p2)&&p0)))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2364 transition count 2164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2364 transition count 2164
Applied a total of 20 rules in 307 ms. Remains 2364 /2374 variables (removed 10) and now considering 2164/2174 (removed 10) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-19 01:24:51] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-19 01:24:52] [INFO ] Implicit Places using invariants in 974 ms returned []
[2023-03-19 01:24:52] [INFO ] Invariant cache hit.
[2023-03-19 01:24:55] [INFO ] Implicit Places using invariants and state equation in 2570 ms returned []
Implicit Place search using SMT with State Equation took 3551 ms to find 0 implicit places.
[2023-03-19 01:24:55] [INFO ] Invariant cache hit.
[2023-03-19 01:24:56] [INFO ] Dead Transitions using invariants and state equation in 1477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2364/2374 places, 2164/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5336 ms. Remains : 2364/2374 places, 2164/2174 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 3}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (OR (EQ s2049 0) (EQ s624 1)) (OR (EQ s1293 0) (EQ s385 1))), p2:(OR (EQ s1293 0) (EQ s385 1)), p1:(OR (EQ s2049 0) (EQ s624 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 649 ms.
Product exploration explored 100000 steps with 0 reset in 732 ms.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2364 stabilizing places and 639/2164 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:24:59] [INFO ] Invariant cache hit.
[2023-03-19 01:24:59] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:24:59] [INFO ] [Nat]Absence check using 361 positive place invariants in 158 ms returned sat
[2023-03-19 01:25:01] [INFO ] After 1110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:25:01] [INFO ] Deduced a trap composed of 24 places in 491 ms of which 1 ms to minimize.
[2023-03-19 01:25:02] [INFO ] Deduced a trap composed of 20 places in 502 ms of which 2 ms to minimize.
[2023-03-19 01:25:02] [INFO ] Deduced a trap composed of 21 places in 461 ms of which 1 ms to minimize.
[2023-03-19 01:25:03] [INFO ] Deduced a trap composed of 21 places in 447 ms of which 1 ms to minimize.
[2023-03-19 01:25:03] [INFO ] Deduced a trap composed of 29 places in 425 ms of which 3 ms to minimize.
[2023-03-19 01:25:04] [INFO ] Deduced a trap composed of 27 places in 522 ms of which 2 ms to minimize.
[2023-03-19 01:25:05] [INFO ] Deduced a trap composed of 29 places in 498 ms of which 2 ms to minimize.
[2023-03-19 01:25:05] [INFO ] Deduced a trap composed of 22 places in 491 ms of which 2 ms to minimize.
[2023-03-19 01:25:06] [INFO ] Deduced a trap composed of 25 places in 454 ms of which 1 ms to minimize.
[2023-03-19 01:25:06] [INFO ] Deduced a trap composed of 23 places in 563 ms of which 1 ms to minimize.
[2023-03-19 01:25:07] [INFO ] Deduced a trap composed of 19 places in 429 ms of which 1 ms to minimize.
[2023-03-19 01:25:07] [INFO ] Deduced a trap composed of 17 places in 470 ms of which 1 ms to minimize.
[2023-03-19 01:25:08] [INFO ] Deduced a trap composed of 23 places in 480 ms of which 1 ms to minimize.
[2023-03-19 01:25:09] [INFO ] Deduced a trap composed of 20 places in 429 ms of which 1 ms to minimize.
[2023-03-19 01:25:09] [INFO ] Deduced a trap composed of 33 places in 427 ms of which 1 ms to minimize.
[2023-03-19 01:25:10] [INFO ] Deduced a trap composed of 32 places in 396 ms of which 1 ms to minimize.
[2023-03-19 01:25:10] [INFO ] Deduced a trap composed of 28 places in 402 ms of which 1 ms to minimize.
[2023-03-19 01:25:11] [INFO ] Deduced a trap composed of 37 places in 384 ms of which 1 ms to minimize.
[2023-03-19 01:25:11] [INFO ] Deduced a trap composed of 37 places in 381 ms of which 1 ms to minimize.
[2023-03-19 01:25:11] [INFO ] Deduced a trap composed of 34 places in 378 ms of which 1 ms to minimize.
[2023-03-19 01:25:12] [INFO ] Deduced a trap composed of 27 places in 437 ms of which 1 ms to minimize.
[2023-03-19 01:25:12] [INFO ] Deduced a trap composed of 33 places in 383 ms of which 1 ms to minimize.
[2023-03-19 01:25:13] [INFO ] Deduced a trap composed of 28 places in 377 ms of which 1 ms to minimize.
[2023-03-19 01:25:13] [INFO ] Deduced a trap composed of 44 places in 370 ms of which 1 ms to minimize.
[2023-03-19 01:25:14] [INFO ] Deduced a trap composed of 37 places in 379 ms of which 1 ms to minimize.
[2023-03-19 01:25:14] [INFO ] Deduced a trap composed of 20 places in 370 ms of which 1 ms to minimize.
[2023-03-19 01:25:15] [INFO ] Deduced a trap composed of 40 places in 359 ms of which 1 ms to minimize.
[2023-03-19 01:25:15] [INFO ] Deduced a trap composed of 39 places in 341 ms of which 1 ms to minimize.
[2023-03-19 01:25:16] [INFO ] Deduced a trap composed of 36 places in 369 ms of which 1 ms to minimize.
[2023-03-19 01:25:16] [INFO ] Deduced a trap composed of 31 places in 317 ms of which 1 ms to minimize.
[2023-03-19 01:25:16] [INFO ] Deduced a trap composed of 44 places in 311 ms of which 1 ms to minimize.
[2023-03-19 01:25:17] [INFO ] Deduced a trap composed of 34 places in 347 ms of which 0 ms to minimize.
[2023-03-19 01:25:17] [INFO ] Deduced a trap composed of 41 places in 329 ms of which 1 ms to minimize.
[2023-03-19 01:25:18] [INFO ] Deduced a trap composed of 37 places in 384 ms of which 0 ms to minimize.
[2023-03-19 01:25:18] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 1 ms to minimize.
[2023-03-19 01:25:19] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 1 ms to minimize.
[2023-03-19 01:25:19] [INFO ] Deduced a trap composed of 40 places in 308 ms of which 1 ms to minimize.
[2023-03-19 01:25:19] [INFO ] Deduced a trap composed of 38 places in 321 ms of which 0 ms to minimize.
[2023-03-19 01:25:20] [INFO ] Deduced a trap composed of 38 places in 328 ms of which 1 ms to minimize.
[2023-03-19 01:25:20] [INFO ] Deduced a trap composed of 34 places in 391 ms of which 1 ms to minimize.
[2023-03-19 01:25:21] [INFO ] Deduced a trap composed of 35 places in 357 ms of which 0 ms to minimize.
[2023-03-19 01:25:21] [INFO ] Deduced a trap composed of 49 places in 325 ms of which 1 ms to minimize.
[2023-03-19 01:25:22] [INFO ] Deduced a trap composed of 37 places in 332 ms of which 0 ms to minimize.
[2023-03-19 01:25:22] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 1 ms to minimize.
[2023-03-19 01:25:22] [INFO ] Deduced a trap composed of 37 places in 377 ms of which 2 ms to minimize.
[2023-03-19 01:25:23] [INFO ] Deduced a trap composed of 46 places in 307 ms of which 1 ms to minimize.
[2023-03-19 01:25:23] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 1 ms to minimize.
[2023-03-19 01:25:24] [INFO ] Deduced a trap composed of 47 places in 350 ms of which 0 ms to minimize.
[2023-03-19 01:25:24] [INFO ] Deduced a trap composed of 45 places in 306 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:25:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:25:24] [INFO ] After 25245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 958 place count 1885 transition count 1366
Deduced a syphon composed of 319 places in 3 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1596 place count 1566 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1597 place count 1565 transition count 1365
Iterating global reduction 2 with 1 rules applied. Total rules applied 1598 place count 1565 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1598 place count 1565 transition count 1364
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1600 place count 1564 transition count 1364
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2962 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2963 place count 883 transition count 682
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2965 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3167 place count 781 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3201 place count 764 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3202 place count 764 transition count 756
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3203 place count 764 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3204 place count 763 transition count 755
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3244 place count 763 transition count 755
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3245 place count 762 transition count 754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3247 place count 760 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3247 place count 760 transition count 753
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3249 place count 759 transition count 753
Applied a total of 3249 rules in 399 ms. Remains 759 /2364 variables (removed 1605) and now considering 753/2164 (removed 1411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 759/2364 places, 753/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 265633 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265633 steps, saw 169661 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 759 cols
[2023-03-19 01:25:28] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-19 01:25:28] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:25:28] [INFO ] [Nat]Absence check using 359 positive place invariants in 56 ms returned sat
[2023-03-19 01:25:28] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:25:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 01:25:28] [INFO ] After 34ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:25:28] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-19 01:25:28] [INFO ] After 692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 468 steps, including 163 resets, run visited all 1 properties in 6 ms. (steps per millisecond=78 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p1))), (F (OR (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 497 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 361 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 244 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-19 01:25:30] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-19 01:25:31] [INFO ] Implicit Places using invariants in 1031 ms returned []
[2023-03-19 01:25:31] [INFO ] Invariant cache hit.
[2023-03-19 01:25:33] [INFO ] Implicit Places using invariants and state equation in 2301 ms returned []
Implicit Place search using SMT with State Equation took 3334 ms to find 0 implicit places.
[2023-03-19 01:25:33] [INFO ] Invariant cache hit.
[2023-03-19 01:25:35] [INFO ] Dead Transitions using invariants and state equation in 1276 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4854 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2364 stabilizing places and 639/2164 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:25:35] [INFO ] Invariant cache hit.
[2023-03-19 01:25:36] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:25:36] [INFO ] [Nat]Absence check using 361 positive place invariants in 129 ms returned sat
[2023-03-19 01:25:37] [INFO ] After 1248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:25:38] [INFO ] Deduced a trap composed of 24 places in 565 ms of which 1 ms to minimize.
[2023-03-19 01:25:39] [INFO ] Deduced a trap composed of 20 places in 507 ms of which 2 ms to minimize.
[2023-03-19 01:25:39] [INFO ] Deduced a trap composed of 21 places in 476 ms of which 1 ms to minimize.
[2023-03-19 01:25:40] [INFO ] Deduced a trap composed of 21 places in 457 ms of which 1 ms to minimize.
[2023-03-19 01:25:41] [INFO ] Deduced a trap composed of 29 places in 715 ms of which 2 ms to minimize.
[2023-03-19 01:25:41] [INFO ] Deduced a trap composed of 27 places in 538 ms of which 1 ms to minimize.
[2023-03-19 01:25:42] [INFO ] Deduced a trap composed of 29 places in 508 ms of which 1 ms to minimize.
[2023-03-19 01:25:42] [INFO ] Deduced a trap composed of 22 places in 498 ms of which 1 ms to minimize.
[2023-03-19 01:25:43] [INFO ] Deduced a trap composed of 25 places in 412 ms of which 1 ms to minimize.
[2023-03-19 01:25:43] [INFO ] Deduced a trap composed of 23 places in 439 ms of which 1 ms to minimize.
[2023-03-19 01:25:44] [INFO ] Deduced a trap composed of 19 places in 437 ms of which 2 ms to minimize.
[2023-03-19 01:25:45] [INFO ] Deduced a trap composed of 17 places in 526 ms of which 1 ms to minimize.
[2023-03-19 01:25:45] [INFO ] Deduced a trap composed of 23 places in 413 ms of which 1 ms to minimize.
[2023-03-19 01:25:46] [INFO ] Deduced a trap composed of 20 places in 545 ms of which 1 ms to minimize.
[2023-03-19 01:25:46] [INFO ] Deduced a trap composed of 33 places in 422 ms of which 1 ms to minimize.
[2023-03-19 01:25:47] [INFO ] Deduced a trap composed of 32 places in 404 ms of which 1 ms to minimize.
[2023-03-19 01:25:47] [INFO ] Deduced a trap composed of 28 places in 417 ms of which 1 ms to minimize.
[2023-03-19 01:25:48] [INFO ] Deduced a trap composed of 37 places in 409 ms of which 2 ms to minimize.
[2023-03-19 01:25:48] [INFO ] Deduced a trap composed of 37 places in 381 ms of which 1 ms to minimize.
[2023-03-19 01:25:49] [INFO ] Deduced a trap composed of 34 places in 432 ms of which 1 ms to minimize.
[2023-03-19 01:25:49] [INFO ] Deduced a trap composed of 27 places in 365 ms of which 1 ms to minimize.
[2023-03-19 01:25:50] [INFO ] Deduced a trap composed of 33 places in 405 ms of which 1 ms to minimize.
[2023-03-19 01:25:50] [INFO ] Deduced a trap composed of 28 places in 464 ms of which 1 ms to minimize.
[2023-03-19 01:25:51] [INFO ] Deduced a trap composed of 44 places in 431 ms of which 1 ms to minimize.
[2023-03-19 01:25:51] [INFO ] Deduced a trap composed of 37 places in 462 ms of which 1 ms to minimize.
[2023-03-19 01:25:52] [INFO ] Deduced a trap composed of 20 places in 381 ms of which 1 ms to minimize.
[2023-03-19 01:25:52] [INFO ] Deduced a trap composed of 40 places in 342 ms of which 0 ms to minimize.
[2023-03-19 01:25:53] [INFO ] Deduced a trap composed of 39 places in 355 ms of which 1 ms to minimize.
[2023-03-19 01:25:53] [INFO ] Deduced a trap composed of 36 places in 328 ms of which 1 ms to minimize.
[2023-03-19 01:25:54] [INFO ] Deduced a trap composed of 31 places in 369 ms of which 1 ms to minimize.
[2023-03-19 01:25:54] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 1 ms to minimize.
[2023-03-19 01:25:54] [INFO ] Deduced a trap composed of 34 places in 327 ms of which 1 ms to minimize.
[2023-03-19 01:25:55] [INFO ] Deduced a trap composed of 41 places in 309 ms of which 0 ms to minimize.
[2023-03-19 01:25:55] [INFO ] Deduced a trap composed of 37 places in 313 ms of which 1 ms to minimize.
[2023-03-19 01:25:56] [INFO ] Deduced a trap composed of 35 places in 342 ms of which 2 ms to minimize.
[2023-03-19 01:25:56] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 1 ms to minimize.
[2023-03-19 01:25:56] [INFO ] Deduced a trap composed of 40 places in 451 ms of which 2 ms to minimize.
[2023-03-19 01:25:57] [INFO ] Deduced a trap composed of 38 places in 352 ms of which 0 ms to minimize.
[2023-03-19 01:25:57] [INFO ] Deduced a trap composed of 38 places in 349 ms of which 1 ms to minimize.
[2023-03-19 01:25:58] [INFO ] Deduced a trap composed of 34 places in 295 ms of which 1 ms to minimize.
[2023-03-19 01:25:58] [INFO ] Deduced a trap composed of 35 places in 357 ms of which 1 ms to minimize.
[2023-03-19 01:25:59] [INFO ] Deduced a trap composed of 49 places in 332 ms of which 1 ms to minimize.
[2023-03-19 01:25:59] [INFO ] Deduced a trap composed of 37 places in 355 ms of which 1 ms to minimize.
[2023-03-19 01:26:00] [INFO ] Deduced a trap composed of 51 places in 364 ms of which 1 ms to minimize.
[2023-03-19 01:26:00] [INFO ] Deduced a trap composed of 37 places in 357 ms of which 1 ms to minimize.
[2023-03-19 01:26:00] [INFO ] Deduced a trap composed of 46 places in 308 ms of which 0 ms to minimize.
[2023-03-19 01:26:01] [INFO ] Deduced a trap composed of 44 places in 321 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:26:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:26:01] [INFO ] After 25214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 958 place count 1885 transition count 1366
Deduced a syphon composed of 319 places in 3 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1596 place count 1566 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1597 place count 1565 transition count 1365
Iterating global reduction 2 with 1 rules applied. Total rules applied 1598 place count 1565 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1598 place count 1565 transition count 1364
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1600 place count 1564 transition count 1364
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2962 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2963 place count 883 transition count 682
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2965 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3167 place count 781 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3201 place count 764 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3202 place count 764 transition count 756
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3203 place count 764 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3204 place count 763 transition count 755
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3244 place count 763 transition count 755
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3245 place count 762 transition count 754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3247 place count 760 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3247 place count 760 transition count 753
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3249 place count 759 transition count 753
Applied a total of 3249 rules in 428 ms. Remains 759 /2364 variables (removed 1605) and now considering 753/2164 (removed 1411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 759/2364 places, 753/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 255345 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255345 steps, saw 163007 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 759 cols
[2023-03-19 01:26:04] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-19 01:26:05] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:26:05] [INFO ] [Nat]Absence check using 359 positive place invariants in 91 ms returned sat
[2023-03-19 01:26:05] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:26:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 01:26:05] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:26:05] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-19 01:26:05] [INFO ] After 726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 494 steps, including 128 resets, run visited all 1 properties in 9 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p2 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p1))), (F (OR (NOT p2) (NOT p1)))]
Knowledge based reduction with 3 factoid took 330 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 362 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 698 ms.
Product exploration explored 100000 steps with 0 reset in 751 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2364 transition count 2164
Performed 163 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 163 Pre rules applied. Total rules applied 477 place count 2364 transition count 2287
Deduced a syphon composed of 640 places in 4 ms
Iterating global reduction 1 with 163 rules applied. Total rules applied 640 place count 2364 transition count 2287
Performed 797 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1437 places in 2 ms
Iterating global reduction 1 with 797 rules applied. Total rules applied 1437 place count 2364 transition count 2287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1438 place count 2364 transition count 2286
Renaming transitions due to excessive name length > 1024 char.
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1754 place count 2048 transition count 1970
Deduced a syphon composed of 1121 places in 2 ms
Iterating global reduction 2 with 316 rules applied. Total rules applied 2070 place count 2048 transition count 1970
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1122 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2071 place count 2048 transition count 1970
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2073 place count 2046 transition count 1968
Deduced a syphon composed of 1120 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2075 place count 2046 transition count 1968
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -520
Deduced a syphon composed of 1221 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2176 place count 2046 transition count 2488
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2278 place count 1944 transition count 2284
Deduced a syphon composed of 1119 places in 3 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2380 place count 1944 transition count 2284
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -312
Deduced a syphon composed of 1176 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2437 place count 1944 transition count 2596
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2494 place count 1887 transition count 2482
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2551 place count 1887 transition count 2482
Deduced a syphon composed of 1119 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2560 place count 1887 transition count 2473
Deduced a syphon composed of 1119 places in 2 ms
Applied a total of 2560 rules in 975 ms. Remains 1887 /2364 variables (removed 477) and now considering 2473/2164 (removed -309) transitions.
[2023-03-19 01:26:10] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 2473 rows 1887 cols
[2023-03-19 01:26:10] [INFO ] Computed 361 place invariants in 32 ms
[2023-03-19 01:26:11] [INFO ] Dead Transitions using invariants and state equation in 1413 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1887/2364 places, 2473/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2438 ms. Remains : 1887/2364 places, 2473/2164 transitions.
Built C files in :
/tmp/ltsmin15498762766537784810
[2023-03-19 01:26:11] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15498762766537784810
Running compilation step : cd /tmp/ltsmin15498762766537784810;'/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/ltsmin15498762766537784810;'/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/ltsmin15498762766537784810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 203 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-19 01:26:14] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-19 01:26:15] [INFO ] Implicit Places using invariants in 851 ms returned []
[2023-03-19 01:26:15] [INFO ] Invariant cache hit.
[2023-03-19 01:26:18] [INFO ] Implicit Places using invariants and state equation in 2422 ms returned []
Implicit Place search using SMT with State Equation took 3274 ms to find 0 implicit places.
[2023-03-19 01:26:18] [INFO ] Invariant cache hit.
[2023-03-19 01:26:19] [INFO ] Dead Transitions using invariants and state equation in 1597 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5074 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Built C files in :
/tmp/ltsmin6320091131494269353
[2023-03-19 01:26:19] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6320091131494269353
Running compilation step : cd /tmp/ltsmin6320091131494269353;'/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/ltsmin6320091131494269353;'/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/ltsmin6320091131494269353;'/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 01:26:22] [INFO ] Flatten gal took : 46 ms
[2023-03-19 01:26:22] [INFO ] Flatten gal took : 45 ms
[2023-03-19 01:26:22] [INFO ] Time to serialize gal into /tmp/LTL13163556278765549933.gal : 10 ms
[2023-03-19 01:26:22] [INFO ] Time to serialize properties into /tmp/LTL10497040222391240484.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/LTL13163556278765549933.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8071355518329120926.hoa' '-atoms' '/tmp/LTL10497040222391240484.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/LTL10497040222391240484.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8071355518329120926.hoa
Detected timeout of ITS tools.
[2023-03-19 01:26:38] [INFO ] Flatten gal took : 44 ms
[2023-03-19 01:26:38] [INFO ] Flatten gal took : 46 ms
[2023-03-19 01:26:38] [INFO ] Time to serialize gal into /tmp/LTL11878754620497720432.gal : 8 ms
[2023-03-19 01:26:38] [INFO ] Time to serialize properties into /tmp/LTL2293332883823207653.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/LTL11878754620497720432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2293332883823207653.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(((X(X("((p2423==0)||(p733==1))")))&&(G("((p1524==0)||(p448==1))")))&&("(((p2423==0)||(p733==1))&&((p1524==0)||(p448==1)))"))))
Formula 0 simplified : X(!"(((p2423==0)||(p733==1))&&((p1524==0)||(p448==1)))" | XX!"((p2423==0)||(p733==1))" | F!"((p1524==0)||(p448==1))")
Detected timeout of ITS tools.
[2023-03-19 01:26:53] [INFO ] Flatten gal took : 84 ms
[2023-03-19 01:26:53] [INFO ] Applying decomposition
[2023-03-19 01:26:53] [INFO ] Flatten gal took : 68 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/graph11888878976609516803.txt' '-o' '/tmp/graph11888878976609516803.bin' '-w' '/tmp/graph11888878976609516803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11888878976609516803.bin' '-l' '-1' '-v' '-w' '/tmp/graph11888878976609516803.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:26:53] [INFO ] Decomposing Gal with order
[2023-03-19 01:26:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:26:53] [INFO ] Removed a total of 401 redundant transitions.
[2023-03-19 01:26:53] [INFO ] Flatten gal took : 80 ms
[2023-03-19 01:26:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2023-03-19 01:26:53] [INFO ] Time to serialize gal into /tmp/LTL13321981074747380224.gal : 19 ms
[2023-03-19 01:26:53] [INFO ] Time to serialize properties into /tmp/LTL16889525965658308698.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/LTL13321981074747380224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16889525965658308698.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(((X(X("((i34.i3.u765.p2423==0)||(i11.i0.u236.p733==1))")))&&(G("((i1.i4.u486.p1524==0)||(i7.i7.u146.p448==1))")))&&("(((i34.i3.u7...244
Formula 0 simplified : X(!"(((i34.i3.u765.p2423==0)||(i11.i0.u236.p733==1))&&((i1.i4.u486.p1524==0)||(i7.i7.u146.p448==1)))" | XX!"((i34.i3.u765.p2423==0)|...232
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6855399166737307079
[2023-03-19 01:27:08] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6855399166737307079
Running compilation step : cd /tmp/ltsmin6855399166737307079;'/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/ltsmin6855399166737307079;'/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/ltsmin6855399166737307079;'/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 ShieldIIPt-PT-040B-LTLCardinality-15 finished in 140702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
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((p0&&X(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(X(p1)) U G(!p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p1))&&G(p2)&&p0)))'
[2023-03-19 01:27:12] [INFO ] Flatten gal took : 85 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14132349817415572258
[2023-03-19 01:27:12] [INFO ] Too many transitions (2174) to apply POR reductions. Disabling POR matrices.
[2023-03-19 01:27:12] [INFO ] Applying decomposition
[2023-03-19 01:27:12] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14132349817415572258
Running compilation step : cd /tmp/ltsmin14132349817415572258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' '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 01:27:12] [INFO ] Flatten gal took : 42 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/graph339650989367016963.txt' '-o' '/tmp/graph339650989367016963.bin' '-w' '/tmp/graph339650989367016963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph339650989367016963.bin' '-l' '-1' '-v' '-w' '/tmp/graph339650989367016963.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:27:12] [INFO ] Decomposing Gal with order
[2023-03-19 01:27:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:27:12] [INFO ] Removed a total of 390 redundant transitions.
[2023-03-19 01:27:12] [INFO ] Flatten gal took : 80 ms
[2023-03-19 01:27:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-19 01:27:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality12119830973318665573.gal : 18 ms
[2023-03-19 01:27:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality9325299233829021322.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/LTLCardinality12119830973318665573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9325299233829021322.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((("(i21.i5.u464.p1460==1)")U(G("(((i21.i5.u464.p1460==1)||(i16.i5.u362.p1126==0))||(i24.i3.u526.p1655==1))"))))
Formula 0 simplified : !"(i21.i5.u464.p1460==1)" R F!"(((i21.i5.u464.p1460==1)||(i16.i5.u362.p1126==0))||(i24.i3.u526.p1655==1))"
Compilation finished in 5199 ms.
Running link step : cd /tmp/ltsmin14132349817415572258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin14132349817415572258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((LTLAPp0==true) U []((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin14132349817415572258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((LTLAPp0==true) U []((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14132349817415572258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp2==true)&&X(<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 01:51:47] [INFO ] Applying decomposition
[2023-03-19 01:51:47] [INFO ] Flatten gal took : 147 ms
[2023-03-19 01:51:47] [INFO ] Decomposing Gal with order
[2023-03-19 01:51:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:51:48] [INFO ] Removed a total of 116 redundant transitions.
[2023-03-19 01:51:48] [INFO ] Flatten gal took : 194 ms
[2023-03-19 01:51:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-19 01:51:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality18280526759073922197.gal : 32 ms
[2023-03-19 01:51:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality12296115307095618813.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/LTLCardinality18280526759073922197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12296115307095618813.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...278
Read 4 LTL properties
Checking formula 0 : !((("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u395.p1460==1)")U(G("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...376
Formula 0 simplified : !"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u395.p1460==1)" R F!"(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....371
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin14132349817415572258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp2==true)&&X(<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14132349817415572258;'/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' '(<>((LTLAPp4==true))&&X((X(X((LTLAPp5==true))) U [](!(LTLAPp4==true)))))' '--buchi-type=spotba'
LTSmin run took 6284 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin14132349817415572258;'/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((X(X((LTLAPp7==true)))&&[]((LTLAPp8==true))&&(LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin14132349817415572258;'/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((X(X((LTLAPp7==true)))&&[]((LTLAPp8==true))&&(LTLAPp6==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin14132349817415572258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((LTLAPp0==true) U []((LTLAPp1==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 3271316 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16032968 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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