java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:18:08,842 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:18:08,844 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:18:08,856 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:18:08,856 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:18:08,857 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:18:08,859 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:18:08,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:18:08,862 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:18:08,863 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:18:08,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:18:08,864 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:18:08,865 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:18:08,866 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:18:08,868 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:18:08,868 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:18:08,869 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:18:08,871 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:18:08,873 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:18:08,879 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:18:08,880 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:18:08,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:18:08,887 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:18:08,888 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:18:08,888 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:18:08,889 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:18:08,890 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:18:08,891 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:18:08,892 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:18:08,893 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:18:08,893 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:18:08,894 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:18:08,894 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:18:08,894 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:18:08,895 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:18:08,896 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:18:08,896 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:18:08,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:18:08,906 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:18:08,907 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:18:08,907 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:18:08,908 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:18:08,908 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:18:08,909 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:18:08,909 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:18:08,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:18:08,909 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:18:08,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:18:08,910 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:18:08,910 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:18:08,911 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:18:08,911 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:18:08,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:18:08,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:18:08,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:18:08,980 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:18:08,980 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:18:08,981 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl [2018-10-10 15:18:08,981 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl' [2018-10-10 15:18:09,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:18:09,037 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:18:09,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:18:09,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:18:09,038 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:18:09,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:09" (1/1) ... [2018-10-10 15:18:09,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:09" (1/1) ... [2018-10-10 15:18:09,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:09" (1/1) ... [2018-10-10 15:18:09,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:09" (1/1) ... [2018-10-10 15:18:09,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:09" (1/1) ... [2018-10-10 15:18:09,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:09" (1/1) ... [2018-10-10 15:18:09,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:09" (1/1) ... [2018-10-10 15:18:09,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:18:09,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:18:09,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:18:09,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:18:09,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:18:09,173 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:18:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:18:09,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:18:09,781 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:18:09,782 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:18:09 BoogieIcfgContainer [2018-10-10 15:18:09,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:18:09,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:18:09,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:18:09,787 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:18:09,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:09" (1/2) ... [2018-10-10 15:18:09,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e25fe0 and model type ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:18:09, skipping insertion in model container [2018-10-10 15:18:09,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:18:09" (2/2) ... [2018-10-10 15:18:09,790 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl [2018-10-10 15:18:09,800 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:18:09,810 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:18:09,827 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:18:09,854 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:18:09,855 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:18:09,855 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:18:09,855 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:18:09,856 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:18:09,856 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:18:09,856 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:18:09,856 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:18:09,856 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:18:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-10-10 15:18:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-10 15:18:09,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:09,886 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:09,887 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:09,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1145449833, now seen corresponding path program 1 times [2018-10-10 15:18:09,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:10,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:18:10,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 15:18:10,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:18:10,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:18:10,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:18:10,784 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 12 states. [2018-10-10 15:18:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:11,920 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-10-10 15:18:11,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:18:11,922 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-10-10 15:18:11,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:11,944 INFO L225 Difference]: With dead ends: 141 [2018-10-10 15:18:11,945 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 15:18:11,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:18:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 15:18:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 103. [2018-10-10 15:18:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-10 15:18:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-10-10 15:18:12,024 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 48 [2018-10-10 15:18:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:12,025 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-10-10 15:18:12,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:18:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-10-10 15:18:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-10 15:18:12,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:12,030 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:12,031 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:12,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:12,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1952169465, now seen corresponding path program 1 times [2018-10-10 15:18:12,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:12,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:12,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:18:12,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:18:12,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:18:12,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:18:12,388 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 8 states. [2018-10-10 15:18:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:12,667 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-10-10 15:18:12,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:18:12,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-10-10 15:18:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:12,670 INFO L225 Difference]: With dead ends: 172 [2018-10-10 15:18:12,670 INFO L226 Difference]: Without dead ends: 172 [2018-10-10 15:18:12,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:18:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-10 15:18:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 122. [2018-10-10 15:18:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-10 15:18:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-10-10 15:18:12,687 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 74 [2018-10-10 15:18:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:12,688 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-10-10 15:18:12,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:18:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-10-10 15:18:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 15:18:12,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:12,692 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:12,692 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:12,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash -721157772, now seen corresponding path program 1 times [2018-10-10 15:18:12,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 15:18:13,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:13,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:18:13,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:18:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:18:13,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:18:13,224 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 15 states. [2018-10-10 15:18:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:14,442 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2018-10-10 15:18:14,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:18:14,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-10 15:18:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:14,447 INFO L225 Difference]: With dead ends: 182 [2018-10-10 15:18:14,448 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 15:18:14,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:18:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 15:18:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 144. [2018-10-10 15:18:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 15:18:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 147 transitions. [2018-10-10 15:18:14,468 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 147 transitions. Word has length 89 [2018-10-10 15:18:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:14,472 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 147 transitions. [2018-10-10 15:18:14,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:18:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2018-10-10 15:18:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 15:18:14,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:14,476 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:14,478 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:14,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:14,479 INFO L82 PathProgramCache]: Analyzing trace with hash 310169170, now seen corresponding path program 2 times [2018-10-10 15:18:14,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 15:18:14,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:14,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:18:14,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:18:14,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:18:14,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:18:14,762 INFO L87 Difference]: Start difference. First operand 144 states and 147 transitions. Second operand 10 states. [2018-10-10 15:18:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:15,349 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-10-10 15:18:15,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:18:15,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-10-10 15:18:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:15,353 INFO L225 Difference]: With dead ends: 171 [2018-10-10 15:18:15,353 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 15:18:15,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:18:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 15:18:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 145. [2018-10-10 15:18:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-10 15:18:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 148 transitions. [2018-10-10 15:18:15,365 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 148 transitions. Word has length 115 [2018-10-10 15:18:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:15,366 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 148 transitions. [2018-10-10 15:18:15,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:18:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2018-10-10 15:18:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-10 15:18:15,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:15,369 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:15,369 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:15,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:15,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1640106551, now seen corresponding path program 3 times [2018-10-10 15:18:15,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 18 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 15:18:15,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:15,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:18:15,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:18:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:18:15,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:18:15,600 INFO L87 Difference]: Start difference. First operand 145 states and 148 transitions. Second operand 12 states. [2018-10-10 15:18:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:16,158 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2018-10-10 15:18:16,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:18:16,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-10-10 15:18:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:16,161 INFO L225 Difference]: With dead ends: 173 [2018-10-10 15:18:16,161 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 15:18:16,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:18:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 15:18:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 160. [2018-10-10 15:18:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-10 15:18:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 163 transitions. [2018-10-10 15:18:16,171 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 163 transitions. Word has length 130 [2018-10-10 15:18:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:16,172 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 163 transitions. [2018-10-10 15:18:16,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:18:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2018-10-10 15:18:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-10 15:18:16,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:16,174 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:16,175 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:16,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:16,175 INFO L82 PathProgramCache]: Analyzing trace with hash 200806770, now seen corresponding path program 4 times [2018-10-10 15:18:16,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 15:18:16,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:16,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:18:16,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:18:16,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:18:16,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:18:16,880 INFO L87 Difference]: Start difference. First operand 160 states and 163 transitions. Second operand 18 states. [2018-10-10 15:18:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:18,166 INFO L93 Difference]: Finished difference Result 270 states and 275 transitions. [2018-10-10 15:18:18,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:18:18,169 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 145 [2018-10-10 15:18:18,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:18,171 INFO L225 Difference]: With dead ends: 270 [2018-10-10 15:18:18,171 INFO L226 Difference]: Without dead ends: 270 [2018-10-10 15:18:18,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:18:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-10 15:18:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 216. [2018-10-10 15:18:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 15:18:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2018-10-10 15:18:18,184 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 145 [2018-10-10 15:18:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:18,184 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2018-10-10 15:18:18,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:18:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2018-10-10 15:18:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-10 15:18:18,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:18,188 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:18,188 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:18,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:18,189 INFO L82 PathProgramCache]: Analyzing trace with hash -866906256, now seen corresponding path program 5 times [2018-10-10 15:18:18,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 88 proven. 196 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 15:18:19,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:19,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:18:19,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:18:19,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:18:19,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:18:19,169 INFO L87 Difference]: Start difference. First operand 216 states and 220 transitions. Second operand 16 states. [2018-10-10 15:18:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:19,930 INFO L93 Difference]: Finished difference Result 244 states and 248 transitions. [2018-10-10 15:18:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:18:19,931 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 201 [2018-10-10 15:18:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:19,933 INFO L225 Difference]: With dead ends: 244 [2018-10-10 15:18:19,933 INFO L226 Difference]: Without dead ends: 244 [2018-10-10 15:18:19,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:18:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-10 15:18:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2018-10-10 15:18:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 15:18:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 235 transitions. [2018-10-10 15:18:19,942 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 235 transitions. Word has length 201 [2018-10-10 15:18:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:19,942 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 235 transitions. [2018-10-10 15:18:19,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:18:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2018-10-10 15:18:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-10 15:18:19,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:19,946 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:19,947 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:19,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:19,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1812687637, now seen corresponding path program 6 times [2018-10-10 15:18:19,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:20,578 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:18:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 348 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-10 15:18:21,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:21,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:18:21,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:18:21,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:18:21,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:18:21,361 INFO L87 Difference]: Start difference. First operand 231 states and 235 transitions. Second operand 26 states. [2018-10-10 15:18:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:26,505 INFO L93 Difference]: Finished difference Result 472 states and 479 transitions. [2018-10-10 15:18:26,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:18:26,506 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 216 [2018-10-10 15:18:26,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:26,508 INFO L225 Difference]: With dead ends: 472 [2018-10-10 15:18:26,509 INFO L226 Difference]: Without dead ends: 472 [2018-10-10 15:18:26,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1316, Invalid=5994, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:18:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-10 15:18:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 288. [2018-10-10 15:18:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-10 15:18:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 292 transitions. [2018-10-10 15:18:26,520 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 292 transitions. Word has length 216 [2018-10-10 15:18:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:26,520 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 292 transitions. [2018-10-10 15:18:26,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:18:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 292 transitions. [2018-10-10 15:18:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-10 15:18:26,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:26,525 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:26,526 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:26,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash 139865938, now seen corresponding path program 7 times [2018-10-10 15:18:26,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 732 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-10 15:18:27,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:27,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:18:27,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:18:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:18:27,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:18:27,737 INFO L87 Difference]: Start difference. First operand 288 states and 292 transitions. Second operand 28 states. [2018-10-10 15:18:30,448 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-10-10 15:18:33,902 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-10 15:18:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:34,009 INFO L93 Difference]: Finished difference Result 543 states and 551 transitions. [2018-10-10 15:18:34,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 15:18:34,010 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 287 [2018-10-10 15:18:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:34,017 INFO L225 Difference]: With dead ends: 543 [2018-10-10 15:18:34,018 INFO L226 Difference]: Without dead ends: 543 [2018-10-10 15:18:34,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1695, Invalid=8007, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 15:18:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-10-10 15:18:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 359. [2018-10-10 15:18:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-10 15:18:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 364 transitions. [2018-10-10 15:18:34,038 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 364 transitions. Word has length 287 [2018-10-10 15:18:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:34,039 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 364 transitions. [2018-10-10 15:18:34,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:18:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 364 transitions. [2018-10-10 15:18:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-10 15:18:34,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:34,046 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:34,046 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:34,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:34,049 INFO L82 PathProgramCache]: Analyzing trace with hash -105768181, now seen corresponding path program 8 times [2018-10-10 15:18:34,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 0 proven. 1283 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-10-10 15:18:35,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:35,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:18:35,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:18:35,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:18:35,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:18:35,311 INFO L87 Difference]: Start difference. First operand 359 states and 364 transitions. Second operand 30 states. [2018-10-10 15:18:38,873 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-10-10 15:18:41,860 WARN L178 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-10 15:18:43,753 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-10 15:18:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:44,408 INFO L93 Difference]: Finished difference Result 614 states and 623 transitions. [2018-10-10 15:18:44,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 15:18:44,409 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 358 [2018-10-10 15:18:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:44,412 INFO L225 Difference]: With dead ends: 614 [2018-10-10 15:18:44,412 INFO L226 Difference]: Without dead ends: 614 [2018-10-10 15:18:44,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2133, Invalid=10299, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 15:18:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-10-10 15:18:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 430. [2018-10-10 15:18:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-10 15:18:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 436 transitions. [2018-10-10 15:18:44,424 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 436 transitions. Word has length 358 [2018-10-10 15:18:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:44,425 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 436 transitions. [2018-10-10 15:18:44,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:18:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 436 transitions. [2018-10-10 15:18:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-10 15:18:44,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:44,428 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:44,428 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:44,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash -268663502, now seen corresponding path program 9 times [2018-10-10 15:18:44,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2001 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-10-10 15:18:45,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:45,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:18:45,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:18:45,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:18:45,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:18:45,927 INFO L87 Difference]: Start difference. First operand 430 states and 436 transitions. Second operand 32 states. [2018-10-10 15:18:49,180 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-10-10 15:18:53,625 WARN L178 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-10-10 15:18:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:54,377 INFO L93 Difference]: Finished difference Result 685 states and 695 transitions. [2018-10-10 15:18:54,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-10 15:18:54,377 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 429 [2018-10-10 15:18:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:54,383 INFO L225 Difference]: With dead ends: 685 [2018-10-10 15:18:54,383 INFO L226 Difference]: Without dead ends: 685 [2018-10-10 15:18:54,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4977 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2630, Invalid=12870, Unknown=0, NotChecked=0, Total=15500 [2018-10-10 15:18:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-10-10 15:18:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 501. [2018-10-10 15:18:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-10-10 15:18:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 508 transitions. [2018-10-10 15:18:54,398 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 508 transitions. Word has length 429 [2018-10-10 15:18:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:54,399 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 508 transitions. [2018-10-10 15:18:54,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:18:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 508 transitions. [2018-10-10 15:18:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-10-10 15:18:54,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:54,404 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:54,404 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:54,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:54,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1253599531, now seen corresponding path program 10 times [2018-10-10 15:18:54,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:55,039 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:18:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3111 backedges. 0 proven. 2886 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-10-10 15:18:56,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:56,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:18:56,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:18:56,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:18:56,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:18:56,244 INFO L87 Difference]: Start difference. First operand 501 states and 508 transitions. Second operand 34 states. [2018-10-10 15:18:58,607 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-10-10 15:19:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:05,480 INFO L93 Difference]: Finished difference Result 756 states and 767 transitions. [2018-10-10 15:19:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-10 15:19:05,480 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 500 [2018-10-10 15:19:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:05,484 INFO L225 Difference]: With dead ends: 756 [2018-10-10 15:19:05,484 INFO L226 Difference]: Without dead ends: 756 [2018-10-10 15:19:05,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=3186, Invalid=15720, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 15:19:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-10-10 15:19:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 572. [2018-10-10 15:19:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-10-10 15:19:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 580 transitions. [2018-10-10 15:19:05,499 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 580 transitions. Word has length 500 [2018-10-10 15:19:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:05,500 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 580 transitions. [2018-10-10 15:19:05,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:19:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 580 transitions. [2018-10-10 15:19:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-10-10 15:19:05,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:05,504 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:05,505 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:05,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash -928443630, now seen corresponding path program 11 times [2018-10-10 15:19:05,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:06,059 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:19:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 3938 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-10-10 15:19:08,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:08,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:19:08,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:19:08,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:19:08,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:19:08,475 INFO L87 Difference]: Start difference. First operand 572 states and 580 transitions. Second operand 36 states. [2018-10-10 15:19:15,350 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-10 15:19:18,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:18,677 INFO L93 Difference]: Finished difference Result 827 states and 839 transitions. [2018-10-10 15:19:18,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-10 15:19:18,677 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 571 [2018-10-10 15:19:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:18,681 INFO L225 Difference]: With dead ends: 827 [2018-10-10 15:19:18,682 INFO L226 Difference]: Without dead ends: 827 [2018-10-10 15:19:18,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7687 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3801, Invalid=18849, Unknown=0, NotChecked=0, Total=22650 [2018-10-10 15:19:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-10-10 15:19:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 643. [2018-10-10 15:19:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-10-10 15:19:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 652 transitions. [2018-10-10 15:19:18,695 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 652 transitions. Word has length 571 [2018-10-10 15:19:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:18,696 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 652 transitions. [2018-10-10 15:19:18,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:19:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 652 transitions. [2018-10-10 15:19:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2018-10-10 15:19:18,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:18,702 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:18,702 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:18,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash 529104715, now seen corresponding path program 12 times [2018-10-10 15:19:18,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 0 proven. 5157 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-10-10 15:19:21,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:21,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:19:21,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:19:21,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:19:21,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:19:21,978 INFO L87 Difference]: Start difference. First operand 643 states and 652 transitions. Second operand 38 states. [2018-10-10 15:19:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:33,507 INFO L93 Difference]: Finished difference Result 898 states and 911 transitions. [2018-10-10 15:19:33,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-10 15:19:33,508 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 642 [2018-10-10 15:19:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:33,512 INFO L225 Difference]: With dead ends: 898 [2018-10-10 15:19:33,512 INFO L226 Difference]: Without dead ends: 898 [2018-10-10 15:19:33,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9270 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=4475, Invalid=22257, Unknown=0, NotChecked=0, Total=26732 [2018-10-10 15:19:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-10-10 15:19:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 714. [2018-10-10 15:19:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-10-10 15:19:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 724 transitions. [2018-10-10 15:19:33,525 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 724 transitions. Word has length 642 [2018-10-10 15:19:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:33,526 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 724 transitions. [2018-10-10 15:19:33,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:19:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 724 transitions. [2018-10-10 15:19:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-10-10 15:19:33,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:33,532 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:33,533 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:33,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash -744892174, now seen corresponding path program 13 times [2018-10-10 15:19:33,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 6543 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-10-10 15:19:36,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:36,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:19:36,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:19:36,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:19:36,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:19:36,025 INFO L87 Difference]: Start difference. First operand 714 states and 724 transitions. Second operand 40 states. [2018-10-10 15:19:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:48,229 INFO L93 Difference]: Finished difference Result 969 states and 983 transitions. [2018-10-10 15:19:48,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-10 15:19:48,229 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 713 [2018-10-10 15:19:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:48,233 INFO L225 Difference]: With dead ends: 969 [2018-10-10 15:19:48,233 INFO L226 Difference]: Without dead ends: 969 [2018-10-10 15:19:48,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11005 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=5208, Invalid=25944, Unknown=0, NotChecked=0, Total=31152 [2018-10-10 15:19:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-10-10 15:19:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 785. [2018-10-10 15:19:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-10-10 15:19:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 796 transitions. [2018-10-10 15:19:48,248 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 796 transitions. Word has length 713 [2018-10-10 15:19:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:48,249 INFO L481 AbstractCegarLoop]: Abstraction has 785 states and 796 transitions. [2018-10-10 15:19:48,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:19:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 796 transitions. [2018-10-10 15:19:48,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-10-10 15:19:48,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:48,256 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:48,256 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:48,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:48,256 INFO L82 PathProgramCache]: Analyzing trace with hash -450405013, now seen corresponding path program 14 times [2018-10-10 15:19:48,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8513 backedges. 0 proven. 8096 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2018-10-10 15:19:51,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:51,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:19:51,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:19:51,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:19:51,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1481, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:19:51,059 INFO L87 Difference]: Start difference. First operand 785 states and 796 transitions. Second operand 42 states. [2018-10-10 15:20:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:05,089 INFO L93 Difference]: Finished difference Result 1040 states and 1055 transitions. [2018-10-10 15:20:05,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-10-10 15:20:05,089 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 784 [2018-10-10 15:20:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:05,093 INFO L225 Difference]: With dead ends: 1040 [2018-10-10 15:20:05,093 INFO L226 Difference]: Without dead ends: 1040 [2018-10-10 15:20:05,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12892 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=6000, Invalid=29910, Unknown=0, NotChecked=0, Total=35910 [2018-10-10 15:20:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-10-10 15:20:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 856. [2018-10-10 15:20:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-10 15:20:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 868 transitions. [2018-10-10 15:20:05,109 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 868 transitions. Word has length 784 [2018-10-10 15:20:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:05,110 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 868 transitions. [2018-10-10 15:20:05,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:20:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 868 transitions. [2018-10-10 15:20:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-10-10 15:20:05,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:05,140 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:05,140 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:05,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1837946578, now seen corresponding path program 15 times [2018-10-10 15:20:05,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:05,845 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:20:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10281 backedges. 0 proven. 9816 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-10-10 15:20:08,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:08,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:20:08,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:20:08,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:20:08,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:20:08,813 INFO L87 Difference]: Start difference. First operand 856 states and 868 transitions. Second operand 44 states. [2018-10-10 15:20:15,310 WARN L178 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-10-10 15:20:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:24,790 INFO L93 Difference]: Finished difference Result 1111 states and 1127 transitions. [2018-10-10 15:20:24,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-10 15:20:24,790 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 855 [2018-10-10 15:20:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:24,795 INFO L225 Difference]: With dead ends: 1111 [2018-10-10 15:20:24,795 INFO L226 Difference]: Without dead ends: 1111 [2018-10-10 15:20:24,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14931 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=6851, Invalid=34155, Unknown=0, NotChecked=0, Total=41006 [2018-10-10 15:20:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2018-10-10 15:20:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 927. [2018-10-10 15:20:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-10 15:20:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 940 transitions. [2018-10-10 15:20:24,810 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 940 transitions. Word has length 855 [2018-10-10 15:20:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:24,811 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 940 transitions. [2018-10-10 15:20:24,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:20:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 940 transitions. [2018-10-10 15:20:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-10-10 15:20:24,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:24,820 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:24,820 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:24,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash -49020021, now seen corresponding path program 16 times [2018-10-10 15:20:24,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:25,508 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:20:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12216 backedges. 0 proven. 11703 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-10-10 15:20:28,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:28,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:20:28,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:20:28,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:20:28,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1769, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:20:28,680 INFO L87 Difference]: Start difference. First operand 927 states and 940 transitions. Second operand 46 states. [2018-10-10 15:20:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:45,665 INFO L93 Difference]: Finished difference Result 1182 states and 1199 transitions. [2018-10-10 15:20:45,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-10 15:20:45,665 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 926 [2018-10-10 15:20:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:45,669 INFO L225 Difference]: With dead ends: 1182 [2018-10-10 15:20:45,669 INFO L226 Difference]: Without dead ends: 1182 [2018-10-10 15:20:45,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17122 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=7761, Invalid=38679, Unknown=0, NotChecked=0, Total=46440 [2018-10-10 15:20:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-10-10 15:20:45,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 998. [2018-10-10 15:20:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-10-10 15:20:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1012 transitions. [2018-10-10 15:20:45,683 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1012 transitions. Word has length 926 [2018-10-10 15:20:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:45,684 INFO L481 AbstractCegarLoop]: Abstraction has 998 states and 1012 transitions. [2018-10-10 15:20:45,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:20:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1012 transitions. [2018-10-10 15:20:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2018-10-10 15:20:45,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:45,694 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:45,694 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:45,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:45,694 INFO L82 PathProgramCache]: Analyzing trace with hash -289403726, now seen corresponding path program 17 times [2018-10-10 15:20:45,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14318 backedges. 0 proven. 13757 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-10-10 15:20:50,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:50,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:20:50,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:20:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:20:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1922, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:20:50,024 INFO L87 Difference]: Start difference. First operand 998 states and 1012 transitions. Second operand 48 states. [2018-10-10 15:21:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:07,392 INFO L93 Difference]: Finished difference Result 1253 states and 1271 transitions. [2018-10-10 15:21:07,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-10 15:21:07,392 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 997 [2018-10-10 15:21:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:07,397 INFO L225 Difference]: With dead ends: 1253 [2018-10-10 15:21:07,397 INFO L226 Difference]: Without dead ends: 1253 [2018-10-10 15:21:07,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19465 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=8730, Invalid=43482, Unknown=0, NotChecked=0, Total=52212 [2018-10-10 15:21:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-10-10 15:21:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1069. [2018-10-10 15:21:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-10-10 15:21:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1084 transitions. [2018-10-10 15:21:07,410 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1084 transitions. Word has length 997 [2018-10-10 15:21:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:07,411 INFO L481 AbstractCegarLoop]: Abstraction has 1069 states and 1084 transitions. [2018-10-10 15:21:07,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:21:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1084 transitions. [2018-10-10 15:21:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1069 [2018-10-10 15:21:07,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:07,422 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:07,423 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:07,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:07,423 INFO L82 PathProgramCache]: Analyzing trace with hash -581865045, now seen corresponding path program 18 times [2018-10-10 15:21:07,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 16587 backedges. 0 proven. 15978 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-10-10 15:21:11,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:11,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:21:11,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:21:11,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:21:11,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=2081, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:21:11,991 INFO L87 Difference]: Start difference. First operand 1069 states and 1084 transitions. Second operand 50 states. [2018-10-10 15:21:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:31,891 INFO L93 Difference]: Finished difference Result 1324 states and 1343 transitions. [2018-10-10 15:21:31,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-10 15:21:31,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1068 [2018-10-10 15:21:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:31,896 INFO L225 Difference]: With dead ends: 1324 [2018-10-10 15:21:31,896 INFO L226 Difference]: Without dead ends: 1324 [2018-10-10 15:21:31,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21960 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=9758, Invalid=48564, Unknown=0, NotChecked=0, Total=58322 [2018-10-10 15:21:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2018-10-10 15:21:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1140. [2018-10-10 15:21:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2018-10-10 15:21:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1156 transitions. [2018-10-10 15:21:31,911 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1156 transitions. Word has length 1068 [2018-10-10 15:21:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:31,912 INFO L481 AbstractCegarLoop]: Abstraction has 1140 states and 1156 transitions. [2018-10-10 15:21:31,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:21:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1156 transitions. [2018-10-10 15:21:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1140 [2018-10-10 15:21:31,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:31,924 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:31,924 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:31,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1963885934, now seen corresponding path program 19 times [2018-10-10 15:21:31,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 19023 backedges. 0 proven. 18366 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2018-10-10 15:21:37,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:37,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:21:37,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:21:37,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:21:37,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=2246, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:21:37,839 INFO L87 Difference]: Start difference. First operand 1140 states and 1156 transitions. Second operand 52 states. [2018-10-10 15:21:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:59,628 INFO L93 Difference]: Finished difference Result 1395 states and 1415 transitions. [2018-10-10 15:21:59,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-10 15:21:59,628 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1139 [2018-10-10 15:21:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:59,633 INFO L225 Difference]: With dead ends: 1395 [2018-10-10 15:21:59,634 INFO L226 Difference]: Without dead ends: 1395 [2018-10-10 15:21:59,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24607 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=10845, Invalid=53925, Unknown=0, NotChecked=0, Total=64770 [2018-10-10 15:21:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-10-10 15:21:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1211. [2018-10-10 15:21:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-10-10 15:21:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1228 transitions. [2018-10-10 15:21:59,650 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1228 transitions. Word has length 1139 [2018-10-10 15:21:59,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:59,651 INFO L481 AbstractCegarLoop]: Abstraction has 1211 states and 1228 transitions. [2018-10-10 15:21:59,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:21:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1228 transitions. [2018-10-10 15:21:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1211 [2018-10-10 15:21:59,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:59,665 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:59,665 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:59,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:59,666 INFO L82 PathProgramCache]: Analyzing trace with hash 811706315, now seen corresponding path program 20 times [2018-10-10 15:21:59,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 21626 backedges. 7367 proven. 452 refuted. 0 times theorem prover too weak. 13807 trivial. 0 not checked. [2018-10-10 15:22:02,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:02,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:22:02,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:22:02,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:22:02,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:22:02,309 INFO L87 Difference]: Start difference. First operand 1211 states and 1228 transitions. Second operand 20 states. [2018-10-10 15:22:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:03,211 INFO L93 Difference]: Finished difference Result 1421 states and 1438 transitions. [2018-10-10 15:22:03,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:22:03,213 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1210 [2018-10-10 15:22:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:03,217 INFO L225 Difference]: With dead ends: 1421 [2018-10-10 15:22:03,217 INFO L226 Difference]: Without dead ends: 1421 [2018-10-10 15:22:03,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=375, Invalid=1517, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:22:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2018-10-10 15:22:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1421. [2018-10-10 15:22:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-10-10 15:22:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1438 transitions. [2018-10-10 15:22:03,231 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1438 transitions. Word has length 1210 [2018-10-10 15:22:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:03,231 INFO L481 AbstractCegarLoop]: Abstraction has 1421 states and 1438 transitions. [2018-10-10 15:22:03,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:22:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1438 transitions. [2018-10-10 15:22:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1421 [2018-10-10 15:22:03,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:03,249 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:03,250 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:03,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:03,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1413142415, now seen corresponding path program 21 times [2018-10-10 15:22:03,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 33323 backedges. 0 proven. 31990 refuted. 0 times theorem prover too weak. 1333 trivial. 0 not checked. [2018-10-10 15:22:10,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:10,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:22:10,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:22:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:22:10,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=2417, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:22:10,765 INFO L87 Difference]: Start difference. First operand 1421 states and 1438 transitions. Second operand 54 states. [2018-10-10 15:22:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:34,011 INFO L93 Difference]: Finished difference Result 1706 states and 1727 transitions. [2018-10-10 15:22:34,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-10 15:22:34,011 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 1420 [2018-10-10 15:22:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:34,016 INFO L225 Difference]: With dead ends: 1706 [2018-10-10 15:22:34,016 INFO L226 Difference]: Without dead ends: 1706 [2018-10-10 15:22:34,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27406 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=11991, Invalid=59565, Unknown=0, NotChecked=0, Total=71556 [2018-10-10 15:22:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-10-10 15:22:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1507. [2018-10-10 15:22:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-10-10 15:22:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1525 transitions. [2018-10-10 15:22:34,031 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1525 transitions. Word has length 1420 [2018-10-10 15:22:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:34,032 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1525 transitions. [2018-10-10 15:22:34,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:22:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1525 transitions. [2018-10-10 15:22:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1507 [2018-10-10 15:22:34,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:34,051 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:34,052 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:34,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:34,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2031502445, now seen corresponding path program 22 times [2018-10-10 15:22:34,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 37731 backedges. 0 proven. 36304 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2018-10-10 15:22:42,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:42,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:22:42,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:22:42,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:22:42,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=2594, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:22:42,047 INFO L87 Difference]: Start difference. First operand 1507 states and 1525 transitions. Second operand 56 states. [2018-10-10 15:23:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:06,149 INFO L93 Difference]: Finished difference Result 1792 states and 1814 transitions. [2018-10-10 15:23:06,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2018-10-10 15:23:06,149 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1506 [2018-10-10 15:23:06,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:06,155 INFO L225 Difference]: With dead ends: 1792 [2018-10-10 15:23:06,155 INFO L226 Difference]: Without dead ends: 1792 [2018-10-10 15:23:06,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30357 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=13196, Invalid=65484, Unknown=0, NotChecked=0, Total=78680 [2018-10-10 15:23:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2018-10-10 15:23:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1593. [2018-10-10 15:23:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2018-10-10 15:23:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 1612 transitions. [2018-10-10 15:23:06,172 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 1612 transitions. Word has length 1506 [2018-10-10 15:23:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:06,173 INFO L481 AbstractCegarLoop]: Abstraction has 1593 states and 1612 transitions. [2018-10-10 15:23:06,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:23:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1612 transitions. [2018-10-10 15:23:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1593 [2018-10-10 15:23:06,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:06,194 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:06,194 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:06,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:06,195 INFO L82 PathProgramCache]: Analyzing trace with hash 874096331, now seen corresponding path program 23 times [2018-10-10 15:23:06,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:07,329 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:23:07,525 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:23:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 42413 backedges. 0 proven. 40892 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2018-10-10 15:23:15,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:15,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:23:15,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:23:15,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:23:15,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2777, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:23:15,335 INFO L87 Difference]: Start difference. First operand 1593 states and 1612 transitions. Second operand 58 states. [2018-10-10 15:23:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:42,221 INFO L93 Difference]: Finished difference Result 1878 states and 1901 transitions. [2018-10-10 15:23:42,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2018-10-10 15:23:42,221 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1592 [2018-10-10 15:23:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:42,227 INFO L225 Difference]: With dead ends: 1878 [2018-10-10 15:23:42,227 INFO L226 Difference]: Without dead ends: 1878 [2018-10-10 15:23:42,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33460 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=14460, Invalid=71682, Unknown=0, NotChecked=0, Total=86142 [2018-10-10 15:23:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2018-10-10 15:23:42,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1679. [2018-10-10 15:23:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2018-10-10 15:23:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 1699 transitions. [2018-10-10 15:23:42,243 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 1699 transitions. Word has length 1592 [2018-10-10 15:23:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:42,244 INFO L481 AbstractCegarLoop]: Abstraction has 1679 states and 1699 transitions. [2018-10-10 15:23:42,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:23:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 1699 transitions. [2018-10-10 15:23:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1679 [2018-10-10 15:23:42,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:42,263 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:42,263 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:42,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash 756014761, now seen corresponding path program 24 times [2018-10-10 15:23:42,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 47369 backedges. 0 proven. 45754 refuted. 0 times theorem prover too weak. 1615 trivial. 0 not checked. [2018-10-10 15:23:51,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:51,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:23:51,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:23:51,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:23:51,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=2966, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:23:51,547 INFO L87 Difference]: Start difference. First operand 1679 states and 1699 transitions. Second operand 60 states. [2018-10-10 15:24:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:19,961 INFO L93 Difference]: Finished difference Result 1964 states and 1988 transitions. [2018-10-10 15:24:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2018-10-10 15:24:19,962 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1678 [2018-10-10 15:24:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:19,967 INFO L225 Difference]: With dead ends: 1964 [2018-10-10 15:24:19,967 INFO L226 Difference]: Without dead ends: 1964 [2018-10-10 15:24:19,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36715 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=15783, Invalid=78159, Unknown=0, NotChecked=0, Total=93942 [2018-10-10 15:24:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2018-10-10 15:24:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1765. [2018-10-10 15:24:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-10-10 15:24:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1786 transitions. [2018-10-10 15:24:19,983 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1786 transitions. Word has length 1678 [2018-10-10 15:24:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:19,984 INFO L481 AbstractCegarLoop]: Abstraction has 1765 states and 1786 transitions. [2018-10-10 15:24:19,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:24:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1786 transitions. [2018-10-10 15:24:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1765 [2018-10-10 15:24:20,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:20,002 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:20,003 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:20,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1755591673, now seen corresponding path program 25 times [2018-10-10 15:24:20,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 52599 backedges. 0 proven. 50890 refuted. 0 times theorem prover too weak. 1709 trivial. 0 not checked. [2018-10-10 15:24:30,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:30,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:24:30,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:24:30,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:24:30,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=3161, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:24:30,538 INFO L87 Difference]: Start difference. First operand 1765 states and 1786 transitions. Second operand 62 states. [2018-10-10 15:24:54,719 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-10-10 15:25:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:01,004 INFO L93 Difference]: Finished difference Result 2050 states and 2075 transitions. [2018-10-10 15:25:01,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2018-10-10 15:25:01,004 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1764 [2018-10-10 15:25:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:01,012 INFO L225 Difference]: With dead ends: 2050 [2018-10-10 15:25:01,012 INFO L226 Difference]: Without dead ends: 2050 [2018-10-10 15:25:01,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40122 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=17165, Invalid=84915, Unknown=0, NotChecked=0, Total=102080 [2018-10-10 15:25:01,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2018-10-10 15:25:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1851. [2018-10-10 15:25:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2018-10-10 15:25:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 1873 transitions. [2018-10-10 15:25:01,029 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 1873 transitions. Word has length 1764 [2018-10-10 15:25:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:01,030 INFO L481 AbstractCegarLoop]: Abstraction has 1851 states and 1873 transitions. [2018-10-10 15:25:01,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:25:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 1873 transitions. [2018-10-10 15:25:01,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1851 [2018-10-10 15:25:01,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:01,053 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:01,053 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:01,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:01,053 INFO L82 PathProgramCache]: Analyzing trace with hash 804802277, now seen corresponding path program 26 times [2018-10-10 15:25:01,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 58103 backedges. 0 proven. 56300 refuted. 0 times theorem prover too weak. 1803 trivial. 0 not checked. [2018-10-10 15:25:12,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:12,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:25:12,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:25:12,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:25:12,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=3362, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:25:12,432 INFO L87 Difference]: Start difference. First operand 1851 states and 1873 transitions. Second operand 64 states. [2018-10-10 15:25:42,459 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-10 15:25:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:44,731 INFO L93 Difference]: Finished difference Result 2136 states and 2162 transitions. [2018-10-10 15:25:44,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 275 states. [2018-10-10 15:25:44,732 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1850 [2018-10-10 15:25:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:44,738 INFO L225 Difference]: With dead ends: 2136 [2018-10-10 15:25:44,738 INFO L226 Difference]: Without dead ends: 2136 [2018-10-10 15:25:44,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43681 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=18606, Invalid=91950, Unknown=0, NotChecked=0, Total=110556 [2018-10-10 15:25:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2018-10-10 15:25:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1937. [2018-10-10 15:25:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1937 states. [2018-10-10 15:25:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 1960 transitions. [2018-10-10 15:25:44,754 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 1960 transitions. Word has length 1850 [2018-10-10 15:25:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:44,755 INFO L481 AbstractCegarLoop]: Abstraction has 1937 states and 1960 transitions. [2018-10-10 15:25:44,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:25:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 1960 transitions. [2018-10-10 15:25:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1937 [2018-10-10 15:25:44,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:44,777 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:44,778 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:44,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:44,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1149745341, now seen corresponding path program 27 times [2018-10-10 15:25:44,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 63881 backedges. 0 proven. 61984 refuted. 0 times theorem prover too weak. 1897 trivial. 0 not checked. [2018-10-10 15:25:56,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:56,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:25:56,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:25:56,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:25:56,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=721, Invalid=3569, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:25:56,532 INFO L87 Difference]: Start difference. First operand 1937 states and 1960 transitions. Second operand 66 states. [2018-10-10 15:26:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:31,839 INFO L93 Difference]: Finished difference Result 2222 states and 2249 transitions. [2018-10-10 15:26:31,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 286 states. [2018-10-10 15:26:31,839 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 1936 [2018-10-10 15:26:31,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:31,845 INFO L225 Difference]: With dead ends: 2222 [2018-10-10 15:26:31,845 INFO L226 Difference]: Without dead ends: 2222 [2018-10-10 15:26:31,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47392 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=20106, Invalid=99264, Unknown=0, NotChecked=0, Total=119370 [2018-10-10 15:26:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2018-10-10 15:26:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2023. [2018-10-10 15:26:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2018-10-10 15:26:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2047 transitions. [2018-10-10 15:26:31,866 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2047 transitions. Word has length 1936 [2018-10-10 15:26:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:31,867 INFO L481 AbstractCegarLoop]: Abstraction has 2023 states and 2047 transitions. [2018-10-10 15:26:31,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:26:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2047 transitions. [2018-10-10 15:26:31,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2023 [2018-10-10 15:26:31,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:31,891 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:31,891 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:31,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash 67540257, now seen corresponding path program 28 times [2018-10-10 15:26:31,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 69933 backedges. 0 proven. 67942 refuted. 0 times theorem prover too weak. 1991 trivial. 0 not checked. [2018-10-10 15:26:44,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:44,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 15:26:44,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 15:26:44,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 15:26:44,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=774, Invalid=3782, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:26:44,735 INFO L87 Difference]: Start difference. First operand 2023 states and 2047 transitions. Second operand 68 states.